On the disconnection of a discrete cylinder by a random walk
From MaRDI portal
Publication:2503166
DOI10.1007/S00440-005-0485-9zbMATH Open1105.60029OpenAlexW2020110150MaRDI QIDQ2503166FDOQ2503166
Authors: Amir Dembo, Alain-Sol Sznitman 
Publication date: 14 September 2006
Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/36477
Recommendations
- A lower bound on the disconnection time of a discrete cylinder
- How universal are asymptotics of disconnection times in discrete cylinders?
- Upper bound on the disconnection time of discrete cylinders and random interlacements
- On the disconnection of a discrete cylinder by a biased random walk
- Random walks on discrete cylinders and random interlacements
Geometric probability and stochastic geometry (60D05) Sums of independent random variables; random walks (60G50)
Cites Work
- Title not available (Why is that?)
- Intersections of random walks.
- Cover times for Brownian motion and random walks in two dimensions
- Slowdown and neutral pockets for a random walk in random environment
- Late points for random walks in two dimensions
- Surface order large deviations for high-density percolation
- On new examples of ballistic random walks in random environment
- On the time taken by random walks on finite groups to visit every state
- On Positive Solutions of the Equation $\mathfrak{A}U + Vu = 0$
- Enlargement of obstacles for the simple random walk
- Title not available (Why is that?)
- Strong invariance for local times
Cited In (19)
- Decoupling inequalities and interlacement percolation on \(G\times \mathbb Z\)
- Upper bound on the disconnection time of discrete cylinders and random interlacements
- Giant vacant component left by a random walk in a random \(d\)-regular graph
- Vacant set of random interlacements and percolation
- Random walks on discrete cylinders and random interlacements
- On the domination of a random walk on a discrete cylinder by random interlacements
- A lower bound for disconnection by simple random walk
- On the uniqueness of the infinite cluster of the vacant set of random interlacements
- Percolation for the vacant set of random interlacements
- A lower bound on the disconnection time of a discrete cylinder
- Solidification of porous interfaces and disconnection
- How universal are asymptotics of disconnection times in discrete cylinders?
- Bernoulli line percolation
- On the size of a finite vacant cluster of random interlacements with small intensity
- Painting a graph with competing random walks
- On uniform closeness of local times of Markov chains and i.i.d. sequences
- Disconnection, random walks, and random interlacements
- On the disconnection of a discrete cylinder by a biased random walk
- Cover levels and random interlacements
This page was built for publication: On the disconnection of a discrete cylinder by a random walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503166)
