Fast Low-Cost Estimation of Network Properties Using Random Walks-Reference-Cited by-同舟云学术

Fast Low-Cost Estimation of Network Properties Using Random Walks

Published:2013 Issue: Volume: Page:130-143
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cooper Colin,Radzik Tomasz,Siantos Yiannis

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-03536-9_11

Reference13 articles.

1. Aldous, D., Fill, J.: Reversible Markov chains and random walks on graphs, http://stat-www.berkeley.edu/pub/users/aldous/RWG/book.html

2. Barabasi, A., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

3. Bawa, M., Garcia-Molina, H., Gionis, A., Motwani, R.: Estimating aggregates on a peer-to-peer network. Technical Report, CS Dept, Stanford University (2003)

4. Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the web. Computer Networks 33, 309–320 (2000)

5. Cooper, C., Frieze, A.: The cover time of random regular graphs. SIAM Journal of Discrete Mathematics 18(4), 728–740 (2005)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Revisiting random walk based sampling in networks: evasion of burn-in period and frequent regenerations;Computational Social Networks;2018-03-19

2. Inference in OSNs via Lightweight Partial Crawls;ACM SIGMETRICS Performance Evaluation Review;2016-06-30

3. Inference in OSNs via Lightweight Partial Crawls;Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science;2016-06-14

4. Fast Low-Cost Estimation of Network Properties Using Random Walks;Internet Mathematics;2016-03-24