1 Introduction 1 . 1 Fastest mixing Markov chain problem


We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition between the two adjacent vertices. The associated Markov chain has a uniform equilibrium distribution; the rate of convergence to this distribution, i.e., the mixing rate of the Markov chain, is determined by the second largest (in… (More)

7 Figures and Tables


  • Presentations referencing similar topics