Critical window for the vacant set left by random walk on random regular graphs

DOI10.1002/rsa.20425zbMath1273.05209arXiv1101.1978OpenAlexW2013694754MaRDI QIDQ2856577

Jiří Černý, Augusto Q. Teixeira

Publication date: 29 October 2013

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

random walkrandom graphcritical window

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks on graphs (05C81)

Related Items

Unnamed Item ⋮ Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk ⋮ Level-set percolation of the Gaussian free field on regular graphs II: finite expanders ⋮ Phase transition for the vacant set left by random walk on the giant component of a random graph

Cites Work

• Unnamed Item
• Edge percolation on a random regular graph of low degree
• Vacant set of random interlacements and percolation
• Interlacement percolation on transient weighted graphs
• On the second eigenvalue and random walks in random \(d\)-regular graphs
• Inequalities for rare events in time-reversible Markov chains. II
• Probabilistic methods for algorithmic discrete mathematics
• The diameter of random regular graphs
• Percolation on finite graphs and isoperimetric inequalities.
• Interlacing eigenvalues and graphs
• Giant vacant component left by a random walk in a random \(d\)-regular graph
• Giant component and vacant set for random walk on a discrete torus
• Critical percolation on random regular graphs
• On the fragmentation of a torus by random walk
• A new approach to the giant component problem
• A critical point for random graphs with a given degree sequence