Stationary distribution and cover time of sparse directed configuration models
From MaRDI portal
Publication:2210748
DOI10.1007/s00440-020-00995-6zbMath1451.05130arXiv1909.05752OpenAlexW3081031232MaRDI QIDQ2210748
Matteo Quattropani, Pietro Caputo
Publication date: 8 November 2020
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.05752
Martingales with discrete parameter (60G42) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81) Density (toughness, etc.) (05C42)
Related Items (5)
On the meeting of random walks on random DFA ⋮ A probabilistic proof of Cooper and Frieze's "First Visit Time Lemma" ⋮ The diameter of the directed configuration model ⋮ Rankings in directed configuration models with heavy tailed in-degrees ⋮ Mixing time trichotomy in regenerating dynamic digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Stationary distribution and cover time of random walks on random digraphs
- Cover time of a random graph with given degree sequence
- Diameter and stationary distribution of random \(r\)-out digraphs
- A fixed point theorem for distributions
- On generalized multiplicative cascades
- Cutoff at the ``entropic time for sparse Markov chains
- Asymptotic properties and absolute continuity of laws stable by random weighted mean.
- On the cover time of random walks on graphs
- An introduction to covering problems for random walks on graphs
- The diameter of random regular graphs
- Stein's method for concentration inequalities
- Random walk on sparse random digraphs
- The cover time of sparse random graphs
- The cover time of the giant component of a random graph
- On the time taken by random walks on finite groups to visit every state
- On the Cover Time for Random Walks on Random Graphs
- A tight upper bound on the cover time for random walks on graphs
- Sensitivity of Mixing Times in Eulerian Digraphs
- A tight lower bound on the cover time for random walks on graphs
- Mandelbrot Cascades and Related Topics
- The Cover Time of Random Regular Graphs
This page was built for publication: Stationary distribution and cover time of sparse directed configuration models
