REVIEW 3 cited by
Random walk on dynamical percolation in Euclidean lattices: separating critical and supercritical regimes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Random walk on dynamical percolation in Euclidean lattices: separating critical and supercritical regimes
abstract
We study the random walk on dynamical percolation of $\mathbb{Z}^d$ (resp., the two-dimensional triangular lattice $\mathcal{T}$), where each edge (resp., each site) can be either open or closed, refreshing its status at rate $\mu\in (0,1/e]$. The random walk moves along open edges in $\mathbb{Z}^d$ (resp., open sites in $\mathcal{T}$) at rate $1$. For the critical regime $p=p_c$, we prove the following two results: on $\mathcal{T}$, the mean squared displacement of the random walk from $0$ to $t$ is at most $O(t\mu^{5/132-\epsilon})$ for any $\epsilon>0$; on $\mathbb{Z}^d$ with $d\geq 11$, the corresponding upper bound for the mean squared displacement is $O(t \mu^{1/2}\log(1/\mu))$. For the supercritical regime $p>p_c$, we prove that the mean squared displacement on $\mathbb{Z}^d$ is at least $ct$ for some $c=c(d)>0$ that does not depend on $\mu$.
Forward citations
Cited by 3 Pith papers
-
Mixing times of spin systems on dynamical percolation
For nearest-neighbour spin systems on subcritical dynamical percolation, sufficiently slow edge dynamics force mixing time Θ(λ^{-1} log N), with cutoff as λ→0.
-
Mixing times of step-reinforced random walks
Step-reinforced random walks on finite groups converge exponentially to uniform; on cycles mixing time jumps from logarithmic to polynomial at alpha=1/2, while on hypercubes reinforcement slows mixing with cutoff at d...
-
Mixing times of spin systems on dynamical percolation
For p below the critical percolation probability and sufficiently small λ, the mixing time of nearest-neighbor Glauber dynamics on dynamical percolation is Θ(log N / λ) on the d-dimensional torus.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.