Collaboration of random walks on graphs
From MaRDI portal
Cites work
- Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 12th international workshop, APPROX 2009, and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August 21--23, 2009. Proceedings
- Cover times, blanket times, and majorizing measures
- Expansion and the cover time of parallel random walks
- Fluctuation results for size of the vacant set for random walks on discrete torus
- scientific article; zbMATH DE number 3068096 (Why is no real title available?)
- Many Random Walks Are Faster Than One
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Multiple random walks on graphs: mixing few to cover many
- Multiple random walks on paths and grids
- On the fragmentation of a torus by random walk
- On the range of random walk
- Painting a graph with competing random walks
- Probability on trees and networks
- Propriétés d'intersection des marches aléatoires. I: Convergence vers le temps local d'intersection. (Properties of intersection of random walks. I: Convergence to local time intersection)
- Seeding a simple contagion
- The central limit theorem for the range of transient random walk
- The hitting time of multiple random walks
- Tight bounds for the cover time of multiple random walks
- Vacant set of random interlacements and percolation
This page was built for publication: Collaboration of random walks on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6917105)