SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Random Structures and Algorithms

Volumn 20, Issue 1, 2002, Pages 59-70

An O(n2) Bound for the Relaxation Time of a Markov Chain on Cladograms

(1) Schweinsberg, Jason a

a UNIVERSITY OF CALIFORNIA (United States)

Author keywords

Cladograms; Continuum random tree; Distinguished paths; Markov chains; Mixing times; Poincar inequalities

Indexed keywords

EID: 0036104173 PISSN: 10429832 EISSN: None Source Type: Journal
DOI: 10.1002/rsa.1029 Document Type: Article

Times cited : (32)

References (15)

1
- 0003296611
- The continuum random tree III
- D. Aldous, The continuum random tree III. Ann. Probab. 21 (1993), 248-289.
- (1993) Ann. Probab. , vol.21 , pp. 248-289
- Aldous, D.¹

2
- 0034397615
- Mixing time for a Markov chain on cladograms
- D. Aldous, Mixing time for a Markov chain on cladograms. Combin. Probab. Comput. 9:191-204, 2000.
- (2000) Combin. Probab. Comput. , vol.9 , pp. 191-204
- Aldous, D.¹

3
- 0242305809
- Unpublished manuscript
- D. Aldous, My favorite 6 open problems. Unpublished manuscript. Available via http://www.stat.berkeley.edu/̃aldous, 2000.
- (2000) My Favorite 6 Open Problems
- Aldous, D.¹

4
- 0003514340
- Book in preparation
- D. Aldous and J. Fill, Reversible Markov chains and random walks on graphs. Book in preparation. Available via http://www.stat.berkeley.edu/̃aldous.
- Reversible Markov Chains and Random Walks on Graphs
- Aldous, D.¹ Fill, J.²

5
- 0002740591
- Geometric bounds for eigenvalues of Markov chains
- P. Diaconis and D. Stroock, Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1 (1991), 36-61.
- (1991) Ann. Appl. Probab. , vol.1 , pp. 36-61
- Diaconis, P.¹ Stroock, D.²

6
- 0003000289
- On Markov chains for independent sets
- M. Dyer and C. Greenhill, On Markov chains for independent sets. J. of Algorithms, 35 (2000), 17-49.
- (2000) J. of Algorithms , vol.35 , pp. 17-49
- Dyer, M.¹ Greenhill, C.²

7
- 0031476676
- Sampling contingency tables
- M. Dyer, R. Kannan, and J. Mount, Sampling contingency tables. Random Structures Algorithms 10 (1997), 487-506.
- (1997) Random Structures Algorithms , vol.10 , pp. 487-506
- Dyer, M.¹ Kannan, R.² Mount, J.³

8
- 0033449690
- Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger?
- J. Fulman and E. Wilmer, Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger? Ann. Appl. Probab. 9 (1999), 1-13.
- (1999) Ann. Appl. Probab. , vol.9 , pp. 1-13
- Fulman, J.¹ Wilmer, E.²

9
- 0024904712
- Approximating the permanent
- M. Jerrum and A. Sinclair, Approximating the permanent. Siam J. Comput. 18 (1989), 1149-1178.
- (1989) Siam J. Comput. , vol.18 , pp. 1149-1178
- Jerrum, M.¹ Sinclair, A.²

10
- 0031481570
- A semidefinite bound for the mixing rates of Markov chains
- N. Kahale, A semidefinite bound for the mixing rates of Markov chains. Random Structures Algorithms 11 (1997), 299-313.
- (1997) Random Structures Algorithms , vol.11 , pp. 299-313
- Kahale, N.¹

11
- 0242337473
- Mixing times, Microsurveys in Discrete Probability
- D. Aldous and J. Propp (Editors), American Mathematical Society
- L. Lovász and P. Winkler, Mixing times, Microsurveys in Discrete Probability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 41, D. Aldous and J. Propp (Editors), American Mathematical Society, 1988, pp. 85-134.
- (1988) DIMACS Series in Discrete Mathematics and Theoretical Computer Science , vol.41 , pp. 85-134
- Lovász, L.¹ Winkler, P.²

12
- 0033436481
- Fast convergence of the Glauber dynamics for sampling independent sets
- M. Luby and E. Vigoda, Fast convergence of the Glauber dynamics for sampling independent sets. Random Structures Algorithms 15 (1999), 229-241.
- (1999) Random Structures Algorithms , vol.15 , pp. 229-241
- Luby, M.¹ Vigoda, E.²

13
- 0007373306
- The law of the maximum of a Bessel bridge
- J. Pitman and M. Yor, The law of the maximum of a Bessel bridge. Electron. J. Probab., 4 (1999), 1-35.
- (1999) Electron. J. Probab. , vol.4 , pp. 1-35
- Pitman, J.¹ Yor, M.²

14
- 0034345469
- Analyzing Glauber dynamics by comparison of Markov chains
- D. Randall and P. Tetali, Analyzing Glauber dynamics by comparison of Markov chains. J. Math. Phys. 41 (2000), 1598-1615.
- (2000) J. Math. Phys. , vol.41 , pp. 1598-1615
- Randall, D.¹ Tetali, P.²

15
- 84971804758
- Improved bounds for mixing rates of Markov chains and multicommodity flow
- A. Sinclair, Improved bounds for mixing rates of Markov chains and multicommodity flow. Combin. Probab. Comput. 1 (1992), 351-370.
- (1992) Combin. Probab. Comput. , vol.1 , pp. 351-370
- Sinclair, A.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.