A probabilistic model for the 5x+1 problem and related maps
We construct a probabilistic model which "mimics" the behaviour of a certain number-theoretical algorithm. This model involves study of a binary tree with randomly labelled edges, such that the labels have different distributions, depending on their directions. A number of properties of this tree are rigorously studied. As an application, this study could suggest what one could expect in the original algorithm.
Year of publication: |
2006
|
---|---|
Authors: | Volkov, Stanislav |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 116.2006, 4, p. 662-674
|
Publisher: |
Elsevier |
Keywords: | Random environment on trees Large deviations First-passage percolation 3x+1 Problem |
Saved in:
Saved in favorites
Similar items by person
-
Shcherbakov, Vadim, (2010)
-
A note on the simple random walk on : Probability of exiting sequences of sets
Volkov, Stanislav, (2006)
-
On a coloured tree with non i.i.d. random labels
Michael, Skevi, (2010)
- More ...