Stable limit laws for randomly biased walks on supercritical trees
Alan Hammond

TL;DR
This paper studies a random walk on a supercritical Galton-Watson tree with randomly assigned edge biases, establishing conditions for sub-ballistic behavior and proving a stable limit law for the walk's scaled displacement.
Contribution
It introduces a model with random edge biases, derives the sub-ballistic regime, and proves a stable limit law for the walk's displacement, highlighting the role of randomness in bias.
Findings
Identifies conditions for sub-ballistic behavior.
Derives a formula for the exponent gamma.
Proves convergence to a stable law for scaled displacement.
Abstract
We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on distinct edges, each one according to a given law that satisfies a logarithmic non-lattice condition. We determine the condition under which the walk is sub-ballistic, and, in the sub-ballistic regime, we find a formula for the exponent gamma (which is positive but less than one) such that the distance | X_n | moved by the walk in time n is of the order of n^gamma. We prove a stable limiting law for walker distance at late time, proving that the rescaled walk n^{-gamma} | X_n | converges in distribution to an explicitly identified function of the stable law of index gamma. This paper is a counterpart to [4], in which it is proved that, in the model…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Theoretical and Computational Physics · Markov Chains and Monte Carlo Methods
