Mixing of random walks and other diffusions on a graph
作者： Lászlo Lovász , Peter Winkler
DOI: 10.1017/CBO9780511662096.007
关键词:
摘要:
acm.org 
sci-hub.st 参考文章(38)
年男 坂田, Group Representations in Probability and Statistics/Persi Diaconis(1988) 日本統計学会誌. ,vol. 21, pp. 242- 244 ,(1991)
J. R. Baxter, R. V. Chacon, Stopping times for recurrent Markov processes Illinois Journal of Mathematics. ,vol. 20, pp. 467- 475 ,(1976) , 10.1215/IJM/1256049786
R. V. Chacon, D. S. Ornstein, A general ergodic theorem Illinois Journal of Mathematics. ,vol. 4, pp. 153- 160 ,(1960) , 10.1215/IJM/1255455860
Noga Alon, Eigen values and expanders Combinatorica. ,vol. 6, pp. 83- 96 ,(1986) , 10.1007/BF02579166
David Aldous, On Simulating a Markov Chain Stationary Distribution when Transition Probabilities are Unknown Institute for Mathematics and Its Applications. ,vol. 72, pp. 1- 9 ,(1995) , 10.1007/978-1-4612-0801-3_1
Laszlo Lovasz, Peter Winkler, Exact Mixing in an Unknown Markov Chain Electronic Journal of Combinatorics. ,vol. 2, pp. 15- ,(1995) , 10.37236/1209
Don Coppersmith, Prasad Tetali, Peter Winkler, Collisions among random walks on a graph SIAM Journal on Discrete Mathematics. ,vol. 6, pp. 363- 374 ,(1993) , 10.1137/0406029
Graham Brightwell, Peter Winkler, Maximum hitting time for random walks on graphs Random Structures and Algorithms. ,vol. 1, pp. 263- 276 ,(1990) , 10.1002/RSA.3240010303
A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, The electrical resistance of a graph captures its commute and cover times Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. pp. 574- 586 ,(1989) , 10.1145/73007.73062
Kimmo Eriksson, No polynomial bound for the chip firing game on directed graphs Proceedings of the American Mathematical Society. ,vol. 112, pp. 1203- 1205 ,(1991) , 10.1090/S0002-9939-1991-1065944-3