Improving random walk estimation accuracy with uniform restarts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6516 LNCS, Issue , 2010, Pages 98-109

  Avrachenkov, Konstantin ^a   Ribeiro, Bruno ^b   Towsley, Don ^b  

^a INRIA   (France)

^b University of Massachusetts Amherst   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEGREE DISTRIBUTIONS; NODE SAMPLING; PAGERANK; RANDOM WALK; SAMPLING METHOD; SAMPLING SCHEMES; SPECTRAL GAP; STATIONARY DISTRIBUTION; TIME REVERSIBILITIES;

ALGORITHMS; RANDOM PROCESSES; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

MATHEMATICAL MODELS; RANDOM PROCESSES;

EID: 78650922508     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18009-5_10     Document Type: Conference Paper

References (24)

1. Aldous, D., Fill, J.A.: Reversible Markov Chains and Random Walks on Graphs. Book in preparation (1995), http://www.stat.berkeley.edu/~aldous
2. Avrachenkov, K.: Analytic perturbation theory and its applications. PhD Thesis, University of South Australia (1999)
3. Avrachenkov, K., Ribeiro, B., Towsley, D.: Improving random walk search and estimation accuracy with uniform restarts. Tech. rep., INRIA Research Report no. 7394 (2010), http://hal.inria.fr
4. Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509-512 (1999)
5. Baumgartel, H.: Analytic perturbation theory for matrices and operators. Birkhauser, Basel (1985)
6. Bisnik, N., Abouzeid, A.A.: Optimizing random walk search algorithms in p2p networks. Computer Networks 51(6), 1499-1514 (2007) (Pubitemid 46228058)
7. Brauer, A.: Limits for the characteristic roots of a matrix, iv: Applications to stochastic matrices. Duke Math. J. 19, 75-91 (1952)
8. Bressan, M., Peserico, E.: Choose the damping, choose the ranking? In: Avrachenkov, K., Donato, D., Litvak, N. (eds.) WAW 2009. LNCS, vol. 5427, pp. 76-89. Springer, Heidelberg (2009)
9. Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30, 107-117 (1998)
10. Gauvin, W., Ribeiro, B., Liu, B., Towsley, D., Wang, J.: Measurement and gender-specific analysis of user publishing characteristics on myspace. IEEE Network Special Issue on Online Social Networks (2010)
11. Gkantsidis, C., Mihail, M.: Hybrid search schemes for unstructured peer-to-peer networks. In: Proceedings of IEEE INFOCOM, pp. 1526-1537 (2005)
12. Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks: algorithms and evaluation. Perform. Eval. 63(3), 241-263 (2006)
13. Haveliwala, T., Kamvar, S.: The second eigenvalue of the Google matrix. Tech. Rep. Stanford (2003), http://ilpubs.stanford.edu:8090/582/
14. Konrath, M.A., Barcellos, M.P., Mansilha, R.B.: Attacking a swarm with a band of liars: evaluating the impact of attacks on bittorrent. In: Proc. of the IEEE International Conference on Peer-to-Peer Computing, pp. 37-44 (2007)
15. Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: Proc. of the WWW, pp. 695-704 (2008)
16. Litvak, N., Scheinhardt, W., Volkovich, Y., Zwart, B.: Characterization of tail dependence for in-degree and pagerank. In: Avrachenkov, K., Donato, D., Litvak, N. (eds.) WAW 2009. LNCS, vol. 5427, pp. 90-103. Springer, Heidelberg (2009)
17. Lovász, L.: Random walks on graphs: a survey. Combinatorics 2, 1-46 (1993)
18. Lovász, L., Simonovits, M.: Random walks in a convex body and an improved volume algorithm. Random Struct. Alg. 4, 359-412 (1993)
19. Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proc. of the 16th International Conference on Supercomputing, pp. 84-95 (2002)
20. Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and Analysis of Online Social Networks. In: Proc. of the IMC (October 2007)
21. Ribeiro, B., Towsley, D.: Estimating and sampling graphs with multidimensional random walks. In: Proc. of the ACM SIGCOMM IMC (October 2010)
22. Sinclair, A.: Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability and Computing 1, 351-370 (1992)
23. Twitter (2010), http://twitter.com
24. Volz, E., Heckathorn, D.D.: Probability based estimation theory for Respondent-Driven Sampling. Journal of Official Statistics (2008)