Subdiffusivity of random walk on the 2D invasion percolation cluster
From MaRDI portal
Publication:2447724
Abstract: We derive "quenched" subdiffusive lower bounds for the exit time tau(n) from a box of size n for the simple random walk on the planar invasion percolation cluster. The first part of the paper is devoted to proving an almost sure analog of H. Kesten's subdiffusivity theorem for the random walk on the incipient infinite cluster and the invasion percolation cluster using ideas of M. Aizenman, A. Burchard and A. Pisztora. The proof combines lower bounds on the instrinsic distance in these graphs and general inequalities for reversible Markov chains. In the second part of the paper, we present a sharpening of Kesten's original argument, leading to an explicit almost sure lower bound for tau(n) in terms of percolation arm exponents. The methods give tau(n) geq n^{2+epsilon_0 + kappa}, where epsilon_0>0 depends on the instrinsic distance and (assuming the exact value of the backbone exponent) kappa can be taken to be 17/384 on the hexagonal lattice.
Recommendations
- Chemical subdiffusivity of critical 2D percolation
- Subdiffusive behavior of random walk on a random cluster
- The fractal volume of the two-dimensional invasion percolation cluster
- Random walk attracted by percolation clusters
- Random walk in a strongly inhomogeneous environment and invasion percolation
Cites work
- Domination by product measures
- Graph theory
- scientific article; zbMATH DE number 3826957 (Why is no real title available?)
- scientific article; zbMATH DE number 3934148 (Why is no real title available?)
- scientific article; zbMATH DE number 3936137 (Why is no real title available?)
- scientific article; zbMATH DE number 3960728 (Why is no real title available?)
- scientific article; zbMATH DE number 3971949 (Why is no real title available?)
- Hölder regularity and dimension bounds for random curves
- Inequalities with applications to percolation and reliability
- Invasion percolation and the incipient infinite cluster in 2D
- Invasion percolation on regular trees
- Near-critical percolation in two dimensions
- On monochromatic arm exponents for 2D critical percolation
- Percolation
- Probability on trees and networks
- Proof of the Van den Berg–Kesten Conjecture
- Random walk on the incipient infinite cluster for oriented percolation in high dimensions
- Random walk on the incipient infinite cluster on trees
- Random walks on Galton-Watson trees with infinite variance offspring distribution conditioned to survive
- Relations between invasion percolation and critical percolation in two dimensions
- Scaling relations for 2D-percolation
- Spectral dimension and random walks on the two dimensional uniform spanning tree
- Subdiffusive behavior of random walk on a random cluster
- The Alexander-Orbach conjecture holds in high dimensions
- The critical probability of bond percolation on the square lattice equals 1/2
- The fractal volume of the two-dimensional invasion percolation cluster
- The incipient infinite cluster in two-dimensional percolation
Cited in
(5)- Subdiffusive behavior of random walk on a random cluster
- Efficient methods for the estimation of homogenized coefficients
- Chemical subdiffusivity of critical 2D percolation
- Superlinearity of geodesic length in 2D critical first-passage percolation
- Mini-workshop: New horizons in motions in random media. Abstracts from the mini-workshop held February 26 -- March 4, 2023
This page was built for publication: Subdiffusivity of random walk on the 2D invasion percolation cluster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447724)
