Fastest mixing Markov chain problem for the union of two cliques
Authors:
- 14 April 2011
- journal article
- research article
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 59 (7) , 801-823
Abstract
A symmetric, random walk on a graph G can be defined by prescribing weights to the edges in such a way that for each vertex the sum of the weights of the edges incident to the vertex is at most one. The fastest mixing, Markov chain (FMMC) problem for G is to determine the weighting that yields the fastest mixing random walk. We solve the FMMC problem in the case that G is the union of two complete graphs.Keywords
This publication has 8 references indexed in Scilit:
- Fastest Mixing Markov Chain on a PathThe American Mathematical Monthly, 2006
- Fastest Mixing Markov Chain on a PathThe American Mathematical Monthly, 2006
- Symmetry Analysis of Reversible Markov ChainsInternet Mathematics, 2005
- Fastest Mixing Markov Chain on a GraphSIAM Review, 2004
- Nonnegative Matrices in the Mathematical Sciences1994
- Algorithms for Random Generation and Counting: A Markov Chain Approach1993
- Geometric Bounds for Eigenvalues of Markov ChainsThe Annals of Applied Probability, 1991
- Matrix Analysis1985