| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1151314 | Statistics & Probability Letters | 2016 | 6 Pages |
Abstract
We consider a Markov chain on the positive odd integers, which can be viewed as a stochastic version of the Collatz 3x+13x+1 Problem. We show that, no matter its initial value, the chain visits 1 infinitely often. Its values, however, are unbounded.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Statistics and Probability
Authors
Aristides V. Doumas, Vassilis G. Papanicolaou,