A probabilistic proof of Cooper and Frieze's "First Visit Time Lemma"
From MaRDI portal
Publication:5026456
zbMath1482.60099arXiv2101.10748MaRDI QIDQ5026456
Matteo Quattropani, Elisabetta Scoppola, Francesco Manzo
Publication date: 8 February 2022
Full work available at URL: https://arxiv.org/abs/2101.10748
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of continuous-time Markov processes on discrete state spaces (60J28)
Related Items
On the Cover Time of the Emerging Giant, On the Kemeny time for continuous-time reversible and irreversible Markov processes with applications to stochastic resetting and to conditioning towards forever-survival, On the meeting of random walks on random DFA
Cites Work
- Unnamed Item
- Unnamed Item
- Metastable states, quasi-stationary distributions and soft measures
- Conditioned, quasi-stationary, restricted measures and escape from metastable states
- The cover times of random walks on random uniform hypergraphs
- Stationary distribution and cover time of random walks on random digraphs
- Cover time of a random graph with given degree sequence
- Strong stationary times via a new form of duality
- On times to quasi-stationarity for birth and death processes
- The cover time of the preferential attachment graph
- Asymptotically exponential hitting times and metastability: a pathwise approach without reversibility
- Strong uniform times and finite random walks
- Markov chains with almost exponential hitting times
- Probability approximations via the Poisson clumping heuristic
- Inequalities for rare events in time-reversible Markov chains. II
- Markov chain models - rarity and exponentiality
- Inequalities for rare events in time-reversible Markov chains. I.
- Tree formulas, mean first passage times and Kemeny's constant of a Markov chain
- Stationary distribution and cover time of sparse directed configuration models
- Exact results on the first hitting via conditional strong quasi-stationary times and applications to metastability
- On soft capacities, quasi-stationary distributions and the pathwise approach to metastability
- Quasi-Stationary Distributions
- Multiple Random Walks in Random Regular Graphs
- On absorption times and Dirichlet eigenvalues
- The cover time of sparse random graphs
- The cover time of the giant component of a random graph
- Shuffling Cards and Stopping Times
- Cover time of a random graph with a degree sequence II: Allowing vertices of degree two
- The Cover Time of Random Regular Graphs
- On Quasi-Stationary distributions in absorbing discrete-time finite Markov chains
- On quantitative convergence to quasi-stationarity
