scientific article; zbMATH DE number 7561586
From MaRDI portal
Publication:5091254
DOI10.4230/LIPIcs.ICALP.2019.93MaRDI QIDQ5091254
Luca Zanetti, Thomas Sauerwald
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1903.01342
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Random Walks on Randomly Evolving Graphs ⋮ Reversible random walks on dynamic graphs ⋮ Mixing time trichotomy in regenerating dynamic digraphs ⋮ Linking the mixing times of random walks on static and dynamic random graphs ⋮ Distributed detection of clusters of arbitrary size
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
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Mixing time bounds via the spectral profile
- Merging for time inhomogeneous finite Markov chains. I: Singular values and stability
- The electrical resistance of a graph captures its commute and cover times
- Cover time in edge-uniform stochastically-evolving graphs
- A resistance bound via an isoperimetric inequality
- Rumor spreading in random evolving graphs
- Faster mixing via average conductance
- Distributed computation in dynamic networks
- Tight bounds on information dissemination in sparse mobile networks
- Flooding Time of Edge-Markovian Evolving Graphs
- Tight Analyses of Two Local Load Balancing Algorithms
- A tight upper bound on the cover time for random walks on graphs
- Cover time and mixing time of random walks on dynamic graphs
- Bounds on the Voter Model in Dynamic Networks
- A tight lower bound on the cover time for random walks on graphs
- Randomized Rumor Spreading in Dynamic Graphs
- On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract
- Information Dissemination via Random Walks in d-Dimensional Space
- Information spreading in dynamic graphs
This page was built for publication:
