Bounding fastest mixing

Electronic Communications in Probability

Volumn 10, Issue , 2005, Pages 282-296

  Roch, Sébastien ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Canoni cal paths; Conductance; Fastest mixing; Rapidly mixing Markov chains; Semidefinite programming

Indexed keywords

EID: 29844431501     PISSN: None     EISSN: 1083589X     Source Type: Journal    
DOI: 10.1214/ECP.v10-1169     Document Type: Article

References (14)

1. Aldous, D. and Fill, J., Reversible Markov Chains and Random Walks on Graphs, monograph in preparation, 2004.
2. Berger, N., Kenyon, C., Mossel, E., and Peres, Y., Glauber dynamics on trees and hyperbolic graphs, Probab. Theory Related Fields 131 (2005), no. 3, 311-340.
3. Boyd, S., Diaconis, P., Parrilo, P., and Xiao, L., Symmetry analysis of reversible Markov chains, Internet Mathematics, 2 (2005), no. 1, 31-71.
4. Boyd, S., Diaconis, P., Sun, J., and Xiao, L., Fastest mixing Markov chain on a path. To appear in The American Mathematical Monthly, 2005.
5. Boyd, S., Diaconis, P., Sun, J., and Xiao, L., Fastest mixing Markov chain on a graph, SIAM Rev. 46 (2004), no. 4, 667-689 (electronic).
6. Boyd, S., Ghosh, A., Prabhakar, B., and Shah, D., Mixing Times for Random Walks on Geometric Random Graphs. To appear in SIAM ANALCO 2005.
7. Boyd, S. and Vandenberghe, L., Convex optimization, Cambridge Univ. Press, Cambridge, 2004.
8. Diaconis, P. and Stroock, D., Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab. 1 (1991), no. 1, 36-61.
9. Evans, W., Kenyon, C., Peres, Y., and Schulman, L. J., Broadcasting on trees and the Ising model, Ann. Appl. Probab. 10 (2000), no. 2, 410-433.
10. Horn, R. A. and Johnson, C. R., Matrix analysis, Cambridge Univ. Press, Cambridge, 1985.
11. Jerrum, M., Counting, sampling and integrating: algorithms and complexity, Birkhauser, Basel, 2003.
12. Jerrum, M. and Sinclair, A., Approximating the permanent, SIAM J. Comput. 18 (1989), no. 6, 1149-1178.
13. Sinclair, A., Improved bounds for mixing rates of Markov chains and multicommodity flow, Combin. Probab. Comput. 1 (1992), no. 4, 351-370.
14. Sun, J., Boyd, S., Xiao, L., and Diaconis, P., The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem. To appear in SIAM Review, 2005.