Cover levels and random interlacements

DOI10.1214/11-AAP770zbMATH Open1271.60057arXiv1103.2072OpenAlexW3098219325MaRDI QIDQ417070FDOQ417070

Authors: David Belius 

Publication date: 13 May 2012

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

Abstract: This note investigates cover levels of finite sets in the random interlacements model introduced in [Ann. of Math. (2) 171 (2010) 2039-2087], that is, the least level such that the set is completely contained in the random interlacement at that level. It proves that as the cardinality of a set goes to infinity, the rescaled and recentered cover level tends in distribution to the Gumbel distribution with cumulative distribution function $operatornameexp(-operatornameexp(-z))$.

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

Recommendations

• Percolation for the vacant set of random interlacements
• An Introduction to Random Interlacements
• From random walk trajectories to random interlacements
• Russo's formula for random interlacements
• Vacant set of random interlacements and percolation
• On the uniqueness of the infinite cluster of the vacant set of random interlacements
• Random walks on discrete cylinders with large bases and random interlacements
• Two-dimensional random walk. From path counting to random interlacements
• Two-dimensional random interlacements and late points for random walks
• Random interlacements and the Gaussian free field

zbMATH Keywords

cover timerandom interlacementscover levelGumbel distributional limituncovered sets

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Sums of independent random variables; random walks (60G50) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Intersections of random walks.
• Vacant set of random interlacements and percolation
• Random walk on a discrete torus and random interlacements
• Interlacement percolation on transient weighted graphs
• On the domination of a random walk on a discrete cylinder by random interlacements
• Random walks on discrete cylinders and random interlacements
• Percolation for the vacant set of random interlacements
• Covering problems for Markov chains
• Upper bound on the disconnection time of discrete cylinders and random interlacements
• Title not available (Why is that?)
• Limiting crossing probabilities of random fields
• On the disconnection of a discrete cylinder by a random walk
• Random Walks in Multidimensional Spaces, Especially on Periodic Lattices
• THREE TRIPLE INTEGRALS
• Random walks on highly symmetric graphs

Cited In (8)

• Cover-time Gumbel fluctuations in finite-range, symmetric, irreducible random walks on torus
• Gumbel fluctuations for cover times in the discrete torus
• An Introduction to Random Interlacements
• Soft local times and decoupling of random interlacements
• Random cover times using the Poisson cylinder process
• Random interlacements and amenability
• An improved decoupling inequality for random interlacements
• Cover Times of the Massive Random Walk Loop Soup

This page was built for publication: Cover levels and random interlacements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417070)