On the bias of traceroute sampling
From MaRDI portal
Publication:5899511
DOI10.1145/1538902.1538905zbMath1325.68165OpenAlexW2017274979WikidataQ54242125 ScholiaQ54242125MaRDI QIDQ5899511
Moore, Cristopher, David Kempe, Demetrios Achlioptas, Aaron Clauset
Publication date: 11 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1538902.1538905
Related Items
Near-Linear Query Complexity for Graph Inference ⋮ Horvitz-Thompson estimator under partial information with an application to network degree distribution ⋮ Unnamed Item ⋮ Bootstrap estimators for the tail-index and for the count statistics of graphex processes ⋮ Shortest-path queries in static networks ⋮ A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence ⋮ Topology discovery of sparse random graphs with few participants
This page was built for publication: On the bias of traceroute sampling