Distributed construction of random expander networks
- 1 March 2004
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 2133-2143
- https://doi.org/10.1109/infcom.2003.1209234
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Random GraphsPublished by Cambridge University Press (CUP) ,2001
- CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTSInternational Journal of Foundations of Computer Science, 2000
- A Chernoff Bound for Random Walks on Expander GraphsSIAM Journal on Computing, 1998
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed GraphJournal of Algorithms, 1998
- Algorithmic theory of random graphsRandom Structures & Algorithms, 1997
- A fast randomized LOGSPACE algorithm for graph connectivityTheoretical Computer Science, 1996
- Uniform generation of random regular graphs of moderate degreeJournal of Algorithms, 1990
- On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated AnnealingProbability in the Engineering and Informational Sciences, 1987
- Eigenvalues and expandersCombinatorica, 1986
- Random walks, universal traversal sequences, and the complexity of maze problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979