Exponential concentration of cover times
From MaRDI portal
Publication:1748936
DOI10.1214/18-EJP149zbMath1391.60177arXiv1407.7617WikidataQ115517769 ScholiaQ115517769MaRDI QIDQ1748936
Publication date: 15 May 2018
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.7617
Random fields (60G60) Gaussian processes (60G15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (17)
Avoided points of two-dimensional random walks ⋮ Exceptional points of two-dimensional random walks at multiples of the cover time ⋮ Level-set percolation for the Gaussian free field on a transient tree ⋮ On coupling and ``Vacant set level set percolation ⋮ Tightness for the cover time of the two dimensional sphere ⋮ Covariant Symanzik identities ⋮ On the Cover Time of the Emerging Giant ⋮ Thick points of random walk and the Gaussian free field ⋮ Exceptional points of discrete-time random walks in planar domains ⋮ A limit law for the most favorite point of simple random walk on a regular tree ⋮ A spectral characterization for concentration of the cover time ⋮ On the cover time of \(\lambda\)-biased walk on supercritical Galton-Watson trees ⋮ Extremes of local times for simple random walks on symmetric trees ⋮ Limit law for the cover time of a random walk on a binary tree ⋮ Second-order term of cover time for planar simple random walk ⋮ On the Cover Time of Dense Graphs ⋮ The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set
Cites Work
- Unnamed Item
- Unnamed Item
- Topics in occupation times and Gaussian free fields
- An isomorphism theorem for random interlacements
- Cover times, blanket times, and majorizing measures
- Markov paths, loops and fields. École d'Été de Probabilités de Saint-Flour XXXVIII -- 2008
- From loop clusters and random interlacements to the free field
- Covering problems for Markov chains
- Gaussian and non-Gaussian random fields associated with Markov processes
- Random walk covering of some special trees
- Disconnection and level-set percolation for the Gaussian free field
- Markov loops and renormalization
- Sample path properties of the local times of strongly symmetric Markov processes via Gaussian processes
- On the cover time of planar graphs
- Cover times for Brownian motion and random walks in two dimensions
- On the cover time of random walks on graphs
- A Ray-Knight theorem for symmetric Markov processes.
- Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees
- Sojourn times of diffusion processes
- Threshold limits for cover times
- Brownian motions on metric graphs
- The equivalence of diffusions on networks to Brownian motion
- A Technique for Lower Bounding the Cover Time
- Gaussian Hilbert Spaces
- Markov Processes, Gaussian Processes, and Local Times
- Functionals of Brownian motion, localization and metric graphs
- Random Walks and A Sojourn Density Process of Brownian Motion
This page was built for publication: Exponential concentration of cover times
