Beyond random walk and metropolis-hastings samplers: Why you should not backtrack for unbiased graph sampling

Performance Evaluation Review

Volumn 40, Issue 1 SPEC. ISS., 2012, Pages 319-330

  Lee, Chul Ho ^a   Xu, Xin ^a   Eun, Do Young ^a  

^a North Carolina State University   (United States)

Author keywords

asymptotic variance; non reversible markov chains; random walks; unbiased graph sampling

Indexed keywords

ADDITIONAL COSTS; ASYMPTOTIC VARIANCE; COMPLEX NETWORKS; HIGHER EFFICIENCY; NODE SAMPLING; RANDOM WALK; SAMPLING EFFICIENCY; SIMPLE RANDOM WALK; SLOW DIFFUSION; UNBIASED ESTIMATOR;

ALGORITHMS; ASYMPTOTIC ANALYSIS; COMPUTER SYSTEMS; ESTIMATION; MARKOV PROCESSES;

IMPORTANCE SAMPLING;

EID: 84864716103     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2254756.2254795     Document Type: Conference Paper

References (35)

1. Stanford Large Network Dataset Collection. http://snap.stanford.edu/data/ .
2. D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs. monograph in preparation.
3. N. Alon, I. Benjamini, E. Lubetzky, and S. Sodin. Non-backtracking random walks mix faster. Communications in Contemporary Mathematics, 9(4):585-603, 2007.
4. R. B. Ash and C. A. Doléans-Dade. Probability and measure theory. Academic Press, second edition, 2000.
5. K. Avrachenkov, B. Ribeiro, and D. Towsley. Improving random walk estimation accuracy with uniform restarts. In WAW, 2010.
6. F. Bassetti and P. Diaconis. Examples comparing importance sampling and the Metropolis algorithm. Illinois Journal of Mathematics, 50(1):67-91, 2006.
7. P. Berenbrink, C. Cooper, T. R. R. Elsässer, and T. Sauerwald. Speeding up random walks with neighborhood exploration. In ACM SODA, 2010.
8. S. Boyd, P. Diaconis, and L. Xiao. Fastest mixing markov chain on a graph. SIAM Review, 46(4):667-689, 2004.
9. F. Chen, L. Lovász, and I. Pak. Lifiting markov chains to speed up mixing. In ACM STOC, 1999.
10. P. Diaconis, S. Holmes, and R. M. Neal. Analysis of a nonreversible markov chain sampler. Annals of Applied Probability, 10(3):726-752, 2000.
11. R. Douc and C. P. Robert. A vanilla Rao-Blackwellization of Metropolis-Hastings algorithms. Annals of Statistics, 39(1):261-277, 2011.
12. M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou. Practical recommendations on crawling online social networks. IEEE JSAC, 2011.
13. S. Goel and M. J. Salganik. Respondent-driven sampling as Markov chain Monte Carlo. Statistics in Medicine, 28(17):2202-2229, 2009.
14. P. J. Green and A. Mira. Delayed rejection in reversible jump metropolis-hastings. Biometrika, 88(4):1035-1053, 2001.
15. M. A. Hasan and M. J. Zaki. Output space sampling for graph patterns. In VLDB, 2009.
16. W. K. Hastings. Monte carlo sampling methods using markov chains and their applications. Biometrika, 57(1):97-109, 1970.
17. S. Ikeda, I. Kubo, and M. Yamashita. The hitting and cover times of random walks on finite graphs using local degree information. Theoretical Computer Science, 410(1):94-100, January 2009.
18. G. L. Jones. On the Markov chain central limit theorem. Probability Surveys, 1:299-320, 2004.
19. K. Jung and D. Shah. Fast gossip via nonreversible random walk. In IEEE ITW, 2006.
20. M. Kurant, M. Gjoka, C. T. Butts, and A. Markopoulou. Walking on a graph with a magnifying glass: stratified sampling via weighted random walks. In ACM SIGMETRICS, 2011.
21. C.-H. Lee, X. Xu, and D. Y. Eun. Beyond random walk and Metropolis-Hastings samplers: Why you should not backtrack for unbiased graph sampling. Technical report, Dept. of ECE, North Carolina State University, April 2012.
22. D. A. Levin, Y. Peres, and E. L. Wilmer. Markov chains and mixing times. American Mathematical Society, 2009.
23. W. Li and H. Dai. Accelerating distributed consensus via lifting markov chains. In IEEE ISIT, 2007.
24. S. Malefaki and G. Iliopoulos. On convergence of properly weighted samples to the target distribution. Journal of Statistical Planning and Inference, 138(4):1210-1225, 2008.
25. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21(6):1087-1092, 1953.
26. A. Mira. Ordering and improving the performance of monte carlo markov chains. Statistical Science, 16(4):340-350, 2001.
27. R. M. Neal. Improving asymptotic variance of MCMC estimators: non-reversible chains are better. Technical report, No. 0406, Dept. of Statistics, University of Toronto, July 2004.
28. P. H. Peskun. Optimum monte-carlo sampling using markov chains. Biometrika, 60:607-612, 1973.
29. A. H. Rasti, M. Torkjazi, R. Rejaie, N. Duffield, W. Willinger, and D. Stutzbach. Respondent-driven sampling for characterizing unstructured overlays. In INFOCOM, 2009.
30. B. Ribeiro and D. Towsley. Estimating and sampling graphs with multidimensional random walks. In IMC, 2010.
31. G. O. Roberts and J. S. Rosenthal. General state space Markov chains and MCMC algorithms. Probability Surveys, 1:20-71, 2004.
32. S. M. Ross. Stochastic processes. John Wiley & Son, second edition, 1996.
33. M. J. Salganik and D. D. Heckathorn. Sampling and estimation in hidden populations using respondent-driven sampling. Sociological Methodology, 34:193-239, 2004.
34. D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, and W. Willinger. On unbiased sampling for unstructured peer-to-peer networks. IEEE/ACM Transactions on Networking, 17(2):377-390, 2009.
35. S. S. Wu and M. T. Wells. An extension of the metropolis algorithm. Communications in Statistics - Theory and Methods, 34(3):585-596, 2005.