Non-backtracking random walks mix faster

Communications in Contemporary Mathematics

Volumn 9, Issue 4, 2007, Pages 585-603

  Alon, Noga ^a   Benjamini, Itai ^b   Lubetzky, Eyal ^a   Sodin, Sasha ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Balls and bins; Expanders; Girth; Mixing rate; Non backtracking random walks

Indexed keywords

EID: 34547947639     PISSN: 02191997     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219199707002551     Document Type: Article

References (21)

1. N. Alon, Eigenvalues and expanders, Combinatorica 6 (1986) 83-96.
2. 1, isoperimetric inequalities for graphs and superconcentrators, J. Combin. Theory Ser. B 38 (1985) 73-88.
3. N. Alon and J. H. Spencer, The Probabilistic Method, 2nd edn. (Wiley, New York, 2000).
4. Y. Azar, A. Broder, A. Karlin and E. Upfal, Balanced allocation, in Proc. 26th Annual ACM Symp. Theory of Computing (STOC), Montreal, Canada (1994), pp. 593-602.
5. Y. Azar, A. Broder, A. Karlin and E. Upfal, Balanced allocation, SIAM J. Comput. 29 (1999) 180-200.
6. B. Bollobás, Random Graphs, Cambridge Studies in Advanced Mathematics, Vol. 73, 2nd edn. (Cambridge University Press, Cambridge, 2001).
7. W. Feller, An Introduction to Probability Theory and Its Applications, Vol. I (Wiley, 1968).
8. C. Godsil and G. Royle, Algebraic Graph Theory, Graduate Text in Mathematics, Vol. 27 (Springer, New York, 2001).
9. G. H. Gonnet, Expected length of the longest probe sequence in hash code searching, J. Assoc. Comput. Math. 28 (1981) 289-304.
10. N. L. Johnson and S. Kotz, Urn Models and Their Applications (Wiley, 1977).
11. J. Keilson, Markov Chain Models Rarity and Exponentiatity (Springer-Verlag, New York, 1979).
12. M. Krivelevich and B. Sudakov, Pseudo-random graphs, in More Sets, Graphs and Numbers, Bolyai Society Mathematical Studies, Vol. 15 (Springer, 2006), pp. 199-262.
13. W. W. Li and P. Solé, Spectra of regular graphs and hypergraphs and orthogonal polynomials, European J. Combin. 17(5) (1996) 461-477.
14. L. Lovász, Random walks on graphs: A survey, in Combinatorics, Paul Erdos is Eighty, eds. D. Miklós, V. T. Sós and T. Szonyi, Vol. 2 (János Bolyai Mathematical Society, Budapest, 1996), pp. 353-398.
15. L. Lovász and P. Winkler, Mixing of random walks and other diffusions on a graph, in Surveys in Combinatorics, ed. P. Rowlinson, London Math. Soc. Lecture Notes Series, No. 218 (Cambridge Univ. Press, 1995), pp. 119-154.
16. B. D. McKay, The expected eigenvalue distribution of a random labelled regular graph, Linear Algebra Appl. 40 (1981) 203-216.
17. M. D. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis (Cambridge University Press, Cambridge, 2005).
18. A. Nilli, On the second eigenvalue of a graph, Discrete Math. 91 (1991) 207-210.
19. J. R. Norris, Markov Chains, Statistical and Probabilistic Mathematics (Cambridge University Press, 1998).
20. A. Sinclair, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combin. Probab. Comput. 1 (1992) 351-370.
21. G. Szego, Orthogonal Polynomials, Vol. 23, 4th edn. (AMS Colloquium Publications, Providence, RI, 1975).