Biased Random Walk on Spanning Trees of the Ladder Graph
Nina Gantert, Achim Klenke

TL;DR
This paper analyzes a biased random walk on a specially constructed spanning tree of a ladder graph, deriving explicit formulas for the walk's speed, identifying phase transitions, and confirming the Einstein relation at zero bias.
Contribution
It provides an explicit analysis of the biased random walk on a ladder graph spanning tree, including formulas for speed and phase transition points, which is novel compared to previous models.
Findings
Speed is a continuous, unimodal function of bias $eta$.
Phase transitions occur at explicit critical biases $eta_c^{(1)}$ and $eta_c^{(2)}$.
Central limit theorem holds for $eta<eta_c^{(2)}$ and Einstein relation is confirmed at $eta=1$.
Abstract
We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight for the (vertical) rungs. Now take a random walk on that spanning tree with a bias to the right. In contrast to other random graphs considered in the literature (random percolation clusters, Galton-Watson trees) this one allows for an explicit analysis based on a decomposition of the graph into independent pieces. We give an explicit formula for the speed of the biased random walk as a function of both the bias and the edge weight . We conclude that the speed is a continuous, unimodal function of that is positive if and only if for an explicit critical value depending on . In particular, the…
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 · Complex Network Analysis Techniques
