The speed of a biased random walk on a percolation cluster at high density
Alexander Fribergh (CIMS)

TL;DR
This paper investigates how the speed of a biased random walk on a percolation cluster in high-density lattices depends on the percolation parameter, providing a first-order expansion near full density.
Contribution
It introduces a first-order expansion of the walk's speed at high density, revealing how percolation affects the walk's velocity in the lattice.
Findings
Percolation slows down the random walk near full density.
The speed expansion is valid for drifts along lattice components.
The study focuses on the case where the percolation parameter p approaches 1.
Abstract
We study the speed of a biased random walk on a percolation cluster on in function of the percolation parameter . We obtain a first order expansion of the speed at which proves that percolating slows down the random walk at least in the case where the drift is along a component of the lattice.
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 · Probability and Risk Models · Random Matrices and Applications
