Bounds for the annealed return probability on large finite percolation graphs

DOI10.1214/EJP.V17-2329zbMATH Open1260.05149arXiv0812.0117OpenAlexW2030770752MaRDI QIDQ456233FDOQ456233

Authors: Florian Sobieczky 

Publication date: 23 October 2012

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Abstract: Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particularly suited for the case of critical Bernoulli percolation and the associated heavy-tailed cluster size distributions. The upper bound relies on the fact that cartesian products of finite graphs with cycles of a certain minimal size are Hamiltonian. For critical Bernoulli bond percolation on the homogeneous tree this bound is sharp. The asymptotic type of the expected return probability for large times t in this case is of order of the 3/4'th power of 1/t.

Full work available at URL: https://arxiv.org/abs/0812.0117

Recommendations

• Annealed limit theorems for the Ising model on random regular graphs
• Return probabilities of a simple random walk on percolation clusters
• Large‐deviations/thermodynamic approach to percolation on the complete graph
• Annealed central limit theorems for the Ising model on random graphs
• Return probabilities and hitting times of random walks on sparse Erdös-Rényi graphs
• Large deviations for the annealed Ising model on inhomogeneous random graphs: spins and degrees
• Large deviation analysis for layered percolation problems on the complete graph
• Mean-field conditions for percolation on finite graphs
• Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs
• Analytical results for the distribution of first return times of random walks on random regular graphs

zbMATH Keywords

random walksanomalous diffusionintegrated density of statesannealed return probabilitycritical invariant percolationnumber of open clusters per vertex

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks on graphs (05C81) Continuous-time Markov processes on discrete state spaces (60J27)

Cited In (5)

• Percolation Hamiltonians
• Monotonicity of average return probabilities for random walks in random environments
• Existence of graphs with sub exponential transitions probability decay and applications
• Return probabilities of a simple random walk on percolation clusters
• An interlacing technique for spectra of random walks and its application to finite percolation clusters

This page was built for publication: Bounds for the annealed return probability on large finite percolation graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456233)