Random walks on discrete cylinders with large bases and random interlacements

DOI10.1214/09-AOP497zbMath1191.60062arXiv0907.1627MaRDI QIDQ964785

David Windisch

Publication date: 21 April 2010

Published in: The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

tree; excursions; percolation; discrete time; random walk; Sierpinski gasket; continuous time; random interlacements; discrete cylinder; connected weighted graphs; local times of a Brownian motion

Mathematics Subject Classification ID

60G50: Sums of independent random variables; random walks

60K35: Interacting random processes; statistical mechanics type models; percolation theory

82C41: Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics

Related Items

Decoupling inequalities and interlacement percolation on \(G\times \mathbb Z\), Connectivity bounds for the vacant set of random interlacements, A lower bound on the critical parameter of interlacement percolation in high dimension, Random interlacements and amenability, Painting a graph with competing random walks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On eigenvalue problems for the random walks on the Sierpinski pre- gaskets
• Random walks on discrete cylinders and random interlacements
• Vacant set of random interlacements and percolation
• Differential equation approximations for Markov chains
• Upper bound on the disconnection time of discrete cylinders and random interlacements
• Interlacement percolation on transient weighted graphs
• Transition probabilities for the simple random walk on the Sierpinski graph
• Slowdown and neutral pockets for a random walk in random environment
• The art of random walks.
• On Positive Solutions of the Equation $\mathfrak{A}U + Vu = 0$
• Percolation for the vacant set of random interlacements
• Markov Chains
• Random Walks on Infinite Graphs and Groups
• Characterization of sub‐Gaussian heat kernel estimates on strongly recurrent graphs