Random walks in peer-to-peer networks
By Christos Gkantsidis, Milena Mihail, Amin Saberi. IEEE INFOCOM 2004, 2004
622 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/dd2fd1cea7f70ab3743e59da2c3cf32341668c7f
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Prateek Mittal
- Nikita Borisov
- Shishir Nagaraja
- Athina Markopoulou
- Matthew C. Caesar
- Minas Gjoka
- Maciej Kurant
- Carter T. Butts
In Computational Theory and Mathematics
In Computer Networks and Communications
- Prateek Mittal
- Nikita Borisov
- Shishir Nagaraja
- Matthew C. Caesar
- C. Hong
- Maciej Kurant
- Carter T. Butts
- Neil Zhenqiang Gong
Citations in the corpus
- Walking in Facebook: A Case Study of Unbiased Sampling of OSNs (2010, methodology): “They have been used for sampling the Web [15], P2P networks [8], [16], [17], and other large graphs [18].”
- BotGrep: Finding P2P Bots with Structured Graph Analysis (2010, methodology): “Our approach relies on the fast-mixing nature of the structured P2P botnet C&C graph [26, 11, 6, 79].”