Randomly biased walks on subcritical trees
Gerard Ben Arous, Alan Hammond

TL;DR
This paper analyzes the return time of biased random walks on subcritical Galton-Watson trees, revealing a power-law decay in conductance and developing renewal theory in random environments.
Contribution
It provides a detailed asymptotic analysis of total conductance decay and extends renewal theory to the context of randomly biased walks on subcritical trees.
Findings
Total conductance exhibits pure power-law decay.
Decay analysis uses classical defective renewal theorem.
Decomposition of trees conditioned on high conductance is developed.
Abstract
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen, independently for distinct edges, according to a law that satisfies a logarithmic non-lattice condition. The mean return time of the walk is in essence given by the total conductance of the tree. We determine the asymptotic decay of this total conductance, finding it to have a pure power-law decay. In the case of the conductance associated to a single vertex at maximal depth in the tree, this asymptotic decay may be analysed by the classical defective renewal theorem, due to the non-lattice edge-bias assumption. However, the derivation of the decay for total conductance requires computing an additional constant multiple outside the power-law that allows for…
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 · Diffusion and Search Dynamics
