Random Walks on Randomly Evolving Graphs
From MaRDI portal
Publication:5100954
DOI10.1007/978-3-030-54921-3_7OpenAlexW3046744652MaRDI QIDQ5100954
Luca Zanetti, Leran Cai, Thomas Sauerwald
Publication date: 1 September 2022
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.10589
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random walks on dynamical percolation: mixing times, mean squared displacement and hitting times
- Merging for inhomogeneous finite Markov chains. II: Nash and log-Sobolev inequalities
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Merging for time inhomogeneous finite Markov chains. I: Singular values and stability
- Cutoff for random walk on dynamical Erdős-Rényi graph
- How many cooks spoil the soup?
- Mixing time for random walk on supercritical dynamical percolation
- A comparison principle for random walk on dynamical percolation
- Cover time in edge-uniform stochastically-evolving graphs
- Distributed computation in dynamic networks via random walks
- Rumor spreading in random evolving graphs
- Flooding Time of Edge-Markovian Evolving Graphs
- Mathematical Aspects of Mixing Times in Markov Chains
- Cover time and mixing time of random walks on dynamic graphs
- Bounds on the Voter Model in Dynamic Networks
- Randomized Rumor Spreading in Dynamic Graphs
- Information spreading in dynamic graphs
This page was built for publication: Random Walks on Randomly Evolving Graphs
