Towards Unbiased BFS Sampling
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Breadth First Search (BFS) is a widely used approach for sampling large graphs. However, it has been empirically observed that BFS sampling is biased toward high-degree nodes, which may strongly affect the measurement results. In this paper, we quantify and correct the degree bias of BFS. First, we consider a random graph RG(pk) with an arbitrary degree distribution pk. For this model, we calculate the node degree distribution expected to be observed by BFS as a function of the fraction f of covered nodes. We also show that, for RG(pk), all commonly used graph traversal techniques (BFS, DFS, Forest Fire, Snowball Sampling, RDS) have exactly the same bias. Next, we propose a practical BFS-bias correction procedure that takes as input a collected BFS sample together with the fraction f. Our correction technique is exact (i.e., leads to unbiased estimation) for RG(pk). Furthermore, it performs well when applied to a broad range of Internet topologies and to two large BFS samples of Facebook and Orkut networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A generalization of sampling without replacement from a finite universe
Horvitz, D. G., & Thompson, D. J. (1952) · Journal of the American Statistical Association · doi:10.1080/01621459.1952.10483446 · Cited by 4,293 · cited 1×
“Consequently, an application of the Horvitz-Thompson estimator [56], designed typically for sampling without replacement, leads to”
MethodGoodman, L. A. (1961) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177705148 · Cited by 3,606
Measurement and analysis of online social networks
Mislove, A., Marcon, M., Gummadi, K. P., Druschel, P., & Bhattacharjee, B. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298311 · Cited by 3,057
Specificity and Stability in Topology of Protein Networks
Maslov, S., & Sneppen, K. (2002) · Science · doi:10.1126/science.1065103 · Cited by 3,051
Graphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
On the evolution of user interaction in facebook
Viswanath, B., Mislove, A., Cha, M., & Gummadi, K. P. (2009) · Proceedings of the 2nd ACM workshop on Online social networks · doi:10.1145/1592665.1592675 · Cited by 1,461 · cited 3×
“1 Facebook New Orleans network [33] wiki-Talk 2 388 953 4 656 681 3.”
BackgroundUser interactions in social networks and their implications
Wilson, C., Boe, B., Sala, A., Puttaswamy, K. P. N., & Zhao, B. Y. (2009) · Proceedings of the 4th ACM European conference on Computer systems · doi:10.1145/1519065.1519089 · Cited by 879 · cited 1×
“For example, [20,33] collected full sample s of several Facebook regional networks, and [63,65] completel y covered the WWW graph restricted to one or few domains.”
BackgroundKrishnamurthy, B., Gill, P., & Arlitt, M. (2008) · Proceedings of the first workshop on Online social networks · doi:10.1145/1397735.1397741 · Cited by 697 · cited 2×
“of node v. Essentially, MHRW reduces the transitions to high-degree nodes and thus eliminates the degree bias of RW. This property of MHRW was recently exploited in various network sampling contexts [2,8,10,11]. B. Graph traversals In contrast, graph traversals never revisits the same node. At the end of the process,…”
Background
Cited by
A Review of Facebook Research in the Social Sciences
Wilson, R. E., Gosling, S. D., & Graham, L. T. (2012) · Perspectives on Psychological Science · doi:10.1177/1745691612442904 · Cited by 1,226
Kosinski, M., Matz, S. C., Gosling, S. D., Popov, V., & Stillwell, D. (2015) · American Psychologist · doi:10.1037/a0039210 · Cited by 925
Temporal dynamics and network analysis
Blonder, B., Wey, T. W., Dornhaus, A., James, R., & Sih, A. (2012) · Methods in Ecology and Evolution · doi:10.1111/j.2041-210x.2012.00236.x · Cited by 254
Ayeb-Karlsson, S., Kniveton, D., & Cannon, T. (2020) · Palgrave Communications · doi:10.1057/s41599-020-0443-2 · Cited by 129
Making friends and communicating on Facebook: Implications for the access to social capital
Bohn, A., Buchta, C., Hornik, K., & Mair, P. (2014) · Social Networks · doi:10.1016/j.socnet.2013.11.003 · Cited by 106
Metadata
- Authors
- Kurant, M., Markopoulou, A., & Thiran, P.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2011-10
- Volume
- 29
- Issue
- 9
- Pages
- 1799-1809
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2106315062
- Cited by
- 150
- References
- 8
- FWCI
- 10.21
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.