Stable limit laws for randomly biased walks on supercritical trees
From MaRDI portal
Publication:373593
DOI10.1214/12-AOP752zbMATH Open1304.60110arXiv1101.4043MaRDI QIDQ373593FDOQ373593
Authors: Alan Hammond
Publication date: 17 October 2013
Published in: The Annals of Probability (Search for Journal in Brave)
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 where the biases on edges are taken to be a given constant, there is a logarithmic periodicity effect that prevents the existence of a stable limit law for scaled walker displacement. It is randomization of edge-biases that is responsible for the emergence of the stable limit in the present article, while also introducing further correlations into the model in comparison with the constant bias case. The derivation requires the development of a detailed understanding of trap geometry and the interplay between traps and backbone.The paper may be considered as a sequel to [2], since it makes use of a result on the regular tail of the total conductance of a randomly biased subcritical Galton-Watson tree.
Full work available at URL: https://arxiv.org/abs/1101.4043
Recommendations
- Randomly biased walks on subcritical trees
- Random walks on Galton-Watson trees with random conductances
- Local times of subdiffusive biased walks on trees
- Almost sure convergence for stochastically biased random walks on trees
- Escape regimes of biased random walks on Galton-Watson trees
- The speed of random walk on Galton-Watson trees with vanishing conductances
- The speed of a biased random walk on a Galton-Watson tree is analytic
- Functional central limit theorem for a random walk in a random environment
- A quenched central limit theorem for biased random walks on supercritical Galton-Watson trees
Sums of independent random variables; random walks (60G50) Stable stochastic processes (60G52) Processes in random environments (60K37)
Cites Work
- Title not available (Why is that?)
- Probability. Theory and examples.
- Probability on trees and networks
- A probabilistic representation of constants in Kesten's renewal theorem
- Random trees and applications
- Scaling limit for trap models on \(\mathbb Z^d\)
- Title not available (Why is that?)
- Biased random walks on Galton-Watson trees
- Almost sure convergence for stochastically biased random walks on trees
- Limit laws for transient random walks in random environment on \(\mathbb Z\)
- Random walk in a random environment and first-passage percolation on trees
- The electrical resistance of a graph captures its commute and cover times
- The speed of biased random walk on percolation clusters
- On the anisotropic walk on the supercritical percolation cluster
- Randomly biased walks on subcritical trees
- Stable limit laws for randomly biased walks on supercritical trees
- Phase transition for the speed of the biased random walk on the supercritical percolation cluster
- Biased random walks on Galton-Watson trees with leaves
- Transient random walks in random environment on a Galton-Watson tree
Cited In (17)
- Limit theorems for reinforced random walks on certain trees
- Phase transition for the speed of the biased random walk on the supercritical percolation cluster
- A quenched central limit theorem for biased random walks on supercritical Galton-Watson trees
- Lyons‐Pemantle‐Peres Monotonicity Problem for High Biases
- Scaling limits for sub-ballistic biased random walks in random conductances
- Non-Gaussian fluctuations of randomly trapped random walks
- Local times of subdiffusive biased walks on trees
- Escape regimes of biased random walks on Galton-Watson trees
- The tail of the length of an excursion in a trap of random size
- Biased random walk on spanning trees of the ladder graph
- Randomly biased walks on subcritical trees
- Biased random walks on random graphs
- Biased random walk on supercritical percolation: anomalous fluctuations in the ballistic regime
- The slow regime of randomly biased walks on trees
- Stable limit laws for randomly biased walks on supercritical trees
- Biased random walk on critical Galton-Watson trees conditioned to survive
- Biased random walks on Galton-Watson trees with leaves
This page was built for publication: Stable limit laws for randomly biased walks on supercritical trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q373593)