On the bias of traceroute sampling

DOI10.1145/1060590.1060693zbMath1192.68065arXivcond-mat/0503087OpenAlexW2120511087WikidataQ54242181 ScholiaQ54242181MaRDI QIDQ5901111

Moore, Cristopher, Demetrios Achlioptas, Aaron Clauset, David Kempe

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0503087

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Internet topics (68M11)

Related Items

Exploring networks with traceroute-like probes: Theory and simulations ⋮ Consistency under sampling of exponential random graph models ⋮ Impact of spatially constrained sampling of temporal contact networks on the evaluation of the epidemic risk ⋮ Misleading stars: what cannot be measured in the internet? ⋮ Recovering the long-range links in augmented graphs ⋮ A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership ⋮ Condition numbers and scale free graphs ⋮ A statistical framework for modern network science ⋮ The degree distribution of random \(k\)-trees ⋮ Relational exchangeability ⋮ Using the bootstrap for statistical inference on random graphs ⋮ Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks ⋮ Adversarial topology discovery in network virtualization environments: a threat for ISPs? ⋮ Degree distribution of shortest path trees and bias of network sampling algorithms