Random walks in peer-to-peer networks: Algorithms and evaluation
Authors:
Top Cited Papers
- 1 March 2006
- journal article
- Published by Elsevier in Performance Evaluation
- Vol. 63 (3) , 241-263
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Hybrid search schemes for unstructured peer-to-peer networks2005
- Fastest Mixing Markov Chain on a GraphSIAM Review, 2004
- Peer-to-peer research at StanfordACM SIGMOD Record, 2003
- Making gnutella-like P2P systems scalable2003
- Spectra of random graphs with given expected degreesProceedings of the National Academy of Sciences, 2003
- Emergence of Scaling in Random NetworksScience, 1999
- A Chernoff Bound for Random Walks on Expander GraphsSIAM Journal on Computing, 1998
- Bounds on the cover timeJournal of Theoretical Probability, 1989
- On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated AnnealingProbability in the Engineering and Informational Sciences, 1987
- Explicit constructions of linear-sized superconcentratorsJournal of Computer and System Sciences, 1981