References
- D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs. Available online (http://stat-www.berkeley.edu/pub/users/aldous/RWG/book.html), 2002.
- K. Avrachenkov, N. Litvak, M. Sokol, and D. Towsley. “Quick Detection of Nodes with Large Degrees.” Internet Mathematics 10 (2014), 1–19.
- A. Barabasi and R. Albert. “Emergence of Scaling in Random Networks.” Science 5439:286 (1999), 509–512.
- M. Bawa, H. Garcia-Molina, A. Gionis, and R. Motwani. “Estimating aggregates on a peer-to-peer network.” Technical Report, CS Dept, Stanford University, 2003.
- A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. “Graph Structure in the Web.” Computer Networks 33 (2000), 309–320.
- C. Cooper and A. Frieze. “The Cover Time of Random Regular Graphs.” SIAM Journal of Discrete Mathematics 18:4 (2005), 728–740.
- C. Cooper, T. Radzik, and Y. Siantos. “Estimating Network Parameters Using Random Walks.” In Proceedings of 2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN 2012), pp. (2012)
- C. Cooper, T. Radzik, and Y. Siantos. “Fast Low-Cost Estimation of Network Properties Using Random Walks.” In Proceedings of Algorithms and Models for the Web Graph – WAW 2013, LNCS 8305, Springer, 2013.
- I. Dinwoodie. “A Probability Inequality for the Occupation Measure of a Reversible Markov Chain.” Ann. Appl. Probab. 5 (1995), 37–43.
- W. Feller. An Introduction to Probability Theory and Its Applications, Vol I. Wiley, 1970.
- A. Ganesh, A-M. Kermarrec, E. Le Merrer, and L. Massoulie. “Peer Counting and Sampling in Overlay Networks Based on Random Walks.” Distrib. Comput. 20 (2007), 267–278.
- S. Goel and M. Salganik. “Respondent Driven Sampling as Markov Chain Monte Carlo.” Statistics in Medicine 28:17 (2009), 2202–2229.
- L. Katzir, E. Liberty, and O. Somekh. “Estimating Sizes of Social Networks via Biased Sampling.” Proc. WWW 2011, 597–606, (2011).
- C. Léon and F. Perron. “Optimal Hoeffding Bounds for Discrete Reversible Markov Chains.” The Annals of Applied Probability 14:2 (2004), 958–970.
- J. Leskovec. “Stanford Network Analysis Package.” Available online (http://snap.stanford.edu/), 2009.
- D. Levin, Y. Peres, and E. Wilmer. Markov Chains and Mixing Times. AMS, 2009.
- P. Lezaud. “Chernoff-Type Bound for Finite Markov Chains.” The Annals of Applied Probability 8:3 (1998), 849–867.
- L. Lovasz. “Random Walks on Graphs: A Survey.” Bolyai Society Mathematical Studies (1996), 353-397.
- L. Massoulie, E. Le Merrer, A-M. Kermarrec, and A. Ganesh. “Peer Counting and Sampling in Overlay Networks: Random Walk Methods.” In PODC 2006, pp. 123–132. New York: AMC, 2006.
- R. Wagner. “Tail Estimates for Sums of Variables Sampled by a Random Walk.” Com-binatorics, Probability, and Computing 17:2 (2008).