The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Estimating and sampling graphs with multidimensional random walks
Open accessAbstract
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random walks are useful but have drawbacks. Random vertex sampling may require too many resources (time, bandwidth, or money). Random walks, which normally require fewer resources per sample, can suffer from large estimation errors in the presence of disconnected or loosely connected graphs. In this work we propose a new m-dimensional random walk that uses m dependent random walkers. We show that the proposed sampling method, which we call Frontier sampling, exhibits all of the nice sampling properties of a regular random walk. At the same time, our simulations over large real world graphs show that, in the presence of disconnected or loosely connected components, Frontier sampling exhibits lower estimation errors than regular random walks. We also show that Frontier sampling is more suitable than random vertex sampling to sample the tail of the degree distribution of the graph.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Monte Carlo Statistical Methods
Kim, H. (2000) · Technometrics · doi:10.1080/00401706.2000.10485722 · Cited by 5,508
Markov Chains and Stochastic Stability
Meyn, S. P., & Tweedie, R. L. (1993) · Springer eBooks · doi:10.1007/978-1-4471-3267-7 · Cited by 5,041
Assortative Mixing in Networks
Newman, M. E. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.208701 · Cited by 4,988
Monte Carlo Statistical Methods
Robert, C. P., & Casella, G. (2004) · Springer Texts in Statistics · doi:10.1007/978-1-4757-4145-2 · Cited by 4,271
Introduction to Discrete Event Systems
Cassandras, C. G., & Lafortune, S. (2021) · Springer eBooks · doi:10.1007/978-3-030-72274-6 · Cited by 3,342
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
Markov Chains and Mixing Times
Levin, D., Peres, Y., & Wilmer, E. (2008) · doi:10.1090/mbk/058 · Cited by 2,241
Practical markov chain monte carlo
Geyer, C. J. (1992) · Statistical Science · doi:10.1214/ss/1177011137 · Cited by 2,045
Inferring friendship network structure by using mobile phone data
Eagle, N., Pentland, A. (., & Lazer, D. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0900282106 · Cited by 1,856
Markov Chains and Stochastic Stability
Meyn, S., Tweedie, R. L., & Glynn, P. W. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511626630 · Cited by 1,680
Random Walks on Graphs: A Survey
Lovász, L. (2001) · Cited by 1,411
Leskovec, J., & Faloutsos, C. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150479 · Cited by 1,170
Monte Carlo Statistical Methods (Springer Texts in Statistics)
Robert, C. P., & Casella, G. (2005) · Springer eBooks · Cited by 1,002
Statistical properties of community structure in large social and information networks
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367591 · Cited by 860
Probability based estimation theory for respondent driven sampling
Volz, E., & Heckathorn, D. D. (2008) · Journal of Official Statistics · Cited by 667
Cho, J., & Garcia-Molina, H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511464 · Cited by 312
Approximating Clustering Coefficient and Transitivity
Schank, T., & Wagner, D. (2005) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00108 · Cited by 274
Henzinger, M. R., Heydon, A., Mitzenmacher, M., & Najork, M. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00055-4 · Cited by 269
Random walks in peer-to-peer networks: Algorithms and evaluation
Gkantsidis, C., Mihail, M., & Saberi, A. (2006) · Performance Evaluation · doi:10.1016/j.peva.2005.01.002 · Cited by 232
On Unbiased Sampling for Unstructured Peer-to-Peer Networks
Stutzbach, D., Rejaie, R., Duffield, N., Sen, S., & Willinger, W. (2009) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.2001730 · Cited by 205
Lifting Markov chains to speed up mixing
Chen, F., Lovász, L., & Pak, I. (1999) · Proceedings of the thirty-first annual ACM symposium on Theory of Computing · doi:10.1145/301250.301315 · Cited by 158
Random sampling from a search engine's index
Bar-Yossef, Z., & Gurevich, M. (2008) · Journal of the ACM · doi:10.1145/1411509.1411514 · Cited by 113
Methods for Sampling Pages Uniformly from the World Wide Web
Rusmevichientong, P., Pennock, D. M., Lawrence, S., & Giles, C. L. (2001) · Cited by 89
A Walk in Facebook: Uniform Sampling of Users in Online Social NetworksPreprint
Gjoka, M., Kurant, M., Butts, C. T., & Markopoulou, A. P. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0906.0060 · Cited by 83
Attacking a Swarm with a Band of Liars: evaluating the impact of attacks on BitTorrent
Konrath, M. A., Barcellos, M. P., & Mansilha, R. B. (2007) · IEEE International Conference on Peer-to-Peer Computing (P2P) · doi:10.1109/p2p.2007.14 · Cited by 38
Cited by
(2018) · IEEE Control Systems · doi:10.1109/mcs.2018.2810460 · Cited by 518
Understanding user behavior in online social networks: a survey
Jin, L., Chen, Y., Wang, T., Hui, P., & Vasilakos, A. V. (2013) · IEEE Communications Magazine · doi:10.1109/mcom.2013.6588663 · Cited by 316
GraphSAINT: Graph Sampling Based Inductive Learning Method
Zeng, H., Zhou, H., Srivastava, A., Kannan, R., & Prasanna, V. K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.04931 · Cited by 313
Metadata
- Authors
- Ribeiro, B., & Towsley, D.
- Venue
- Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
- Publisher
- ACM
- Published
- 2010-11
- Pages
- 390-403
- OpenAlex
- W2103799649
- Cited by
- 341
- References
- 30
- FWCI
- 17.59
- Type
- conference paper
- 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.