How universal are asymptotics of disconnection times in discrete cylinders?
From MaRDI portal
Publication:2468420
DOI10.1214/009117907000000114zbMath1134.60061arXiv0712.1497OpenAlexW1984364067MaRDI QIDQ2468420
Publication date: 22 January 2008
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0712.1497
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)
Related Items (8)
Random walks on discrete cylinders and random interlacements ⋮ Decoupling inequalities and interlacement percolation on \(G\times \mathbb Z\) ⋮ Random interlacements and amenability ⋮ Diffusion limited aggregation on a cylinder ⋮ On the disconnection of a discrete cylinder by a biased random walk ⋮ Vacant set of random interlacements and percolation ⋮ Percolation for the vacant set of random interlacements ⋮ Upper bound on the disconnection time of discrete cylinders and random interlacements
Cites Work
- Unnamed Item
- Unnamed Item
- Parabolic Harnack inequality and estimates of Markov chains on graphs
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- Cover times for Brownian motion and random walks in two dimensions
- Lower bounds for covering times for reversible Markov chains and random walks on graphs
- Sub-Gaussian estimates of heat kernels on infinite graphs
- Harnack inequalities and sub-Gaussian estimates for random walks
- Which values of the volume growth and escape time exponent are possible for a graph?
- On the disconnection of a discrete cylinder by a random walk
- On Positive Solutions of the Equation $\mathfrak{A}U + Vu = 0$
- On the time taken by random walks on finite groups to visit every state
- Characterization of sub‐Gaussian heat kernel estimates on strongly recurrent graphs
This page was built for publication: How universal are asymptotics of disconnection times in discrete cylinders?
