Rumor spreading on random regular graphs and expanders
- 28 May 2012
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 43 (2) , 201-220
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Concentration of Measure for the Analysis of Randomized Algorithms2009
- Expander graphs and their applicationsBulletin of the American Mathematical Society, 2006
- Concentration for Independent PermutationsCombinatorics, Probability and Computing, 2002
- Random Graphs2000
- On the second eigenvalue of a graphDiscrete Mathematics, 1991
- Randomized broadcast in networksRandom Structures & Algorithms, 1990
- Quasi-random graphsCombinatorica, 1989
- The shortest-path problem for graphs with random arc-lengthsDiscrete Applied Mathematics, 1985
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsEuropean Journal of Combinatorics, 1980
- The asymptotic number of labeled graphs with given degree sequencesJournal of Combinatorial Theory, Series A, 1978