Painting a graph with competing random walks
From MaRDI portal
Publication:1951684
DOI10.1214/11-AOP713zbMath1271.05091arXiv1003.2168MaRDI QIDQ1951684
Publication date: 24 May 2013
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.2168
Sums of independent random variables; random walks (60G50) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Limit theorems in probability theory (60F99) Random walks on graphs (05C81)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniformity of the uncovered set of random walk and cutoff for lamplighter chains
- Covering problems for Markov chains
- Random walks on discrete cylinders with large bases and random interlacements
- Vacant set of random interlacements and percolation
- Random walk on a discrete torus and random interlacements
- Cover times for Brownian motion and random walks in two dimensions
- Late points for random walks in two dimensions
- On the disconnection of a discrete cylinder by a random walk
- On the range of random walk
- Generating a random permutation with random transpositions
- The central limit theorem for the range of transient random walk
- Thick points for planar Brownian motion and the Erdős-Taylor conjecture on random walk
This page was built for publication: Painting a graph with competing random walks