Simple Random Walk on Long Range Percolation Clusters II: Scaling Limits
Nicholas Crawford, Allan Sly

TL;DR
This paper establishes the scaling limits of simple random walks on long range percolation clusters, showing convergence to stable Lévy processes or Brownian motion depending on parameters, thus confirming a conjecture and extending understanding of such models.
Contribution
It proves the convergence of random walks on long range percolation clusters to stable Lévy processes for certain parameters, confirming a conjecture and providing new insights into their scaling behavior.
Findings
Convergence to an $ ext{alpha}$-stable Lévy process for $s ext{ in } (d, d+1)$.
Convergence to Brownian motion when $d=1$ and $s>2$.
Established both quenched and annealed convergence results.
Abstract
We study limit laws for simple random walks on supercritical long range percolation clusters on . For the long range percolation model, the probability that two vertices are connected behaves asymptotically as . When , we prove that the scaling limit of simple random walk on the infinite component converges to an -stable L\'evy process with establishing a conjecture of Berger and Biskup. The convergence holds in both the quenched and annealed senses. In the case where and we show that the simple random walk converges to a Brownian motion. The proof combines heat kernel bounds from our companion paper, ergodic theory estimates and an involved coupling constructed through the exploration of a large number of walks on the cluster.
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
