On the Bias of Traceroute Sampling; or, Power-law Degree Distributions in Regular Graphs
| dc.creator | Achlioptas, Dimitris | |
| dc.creator | Clauset, Aaron | |
| dc.creator | Kempe, David | |
| dc.creator | Moore, Cristopher | |
| dc.date | 2005-03-04 | |
| dc.date | 2006-03-29 | |
| dc.date.accessioned | 2026-07-07T06:37:33Z | |
| dc.date.available | 2026-07-07T06:37:33Z | |
| dc.description | Understanding the structure of the Internet graph is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaining its graph structure is a surprisingly difficult task, as edges cannot be explicitly queried. Instead, empirical studies rely on traceroutes to build what are essentially single-source, all-destinations, shortest-path trees. These trees only sample a fraction of the network's edges, and a recent paper by Lakhina et al. found empirically that the resuting sample is intrinsically biased. For instance, the observed degree distribution under traceroute sampling exhibits a power law even when the underlying degree distribution is Poisson. In this paper, we study the bias of traceroute sampling systematically, and, for a very general class of underlying degree distributions, calculate the likely observed distributions explicitly. To do this, we use a continuous-time realization of the process of exposing the BFS tree of a random graph with a given degree distribution, calculate the expected degree distribution of the tree, and show that it is sharply concentrated. As example applications of our machinery, we show how traceroute sampling finds power-law degree distributions in both delta-regular and Poisson-distributed random graphs. Thus, our work puts the observations of Lakhina et al. on a rigorous footing, and extends them to nearly arbitrary degree distributions. | |
| dc.description | Long-format version (19 pages); includes small correction to section 6.1 | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0503087 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0503087 | |
| dc.identifier | Proc. 37th ACM Symposium on Theory of Computing (STOC) 2005 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/100431 | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.subject | Networking and Internet Architecture | |
| dc.subject | Combinatorics | |
| dc.subject | Probability | |
| dc.title | On the Bias of Traceroute Sampling; or, Power-law Degree Distributions in Regular Graphs | |
| dc.type | text |