143
Views
4
CrossRef citations to date
0
Altmetric
Original Articles

Fastest mixing Markov chain problem for the union of two cliques

&
Pages 801-823 | Received 27 Jan 2010, Accepted 05 Nov 2010, Published online: 14 Apr 2011

References

  • Berman , A and Plemmons , R . 1994 . Nonnegative Matrices in the Mathematical Sciences , Philadelphia : SIAM .
  • Boyd , S , Diaconis , P , Parrilo , P and Xiao , L . 2005 . Symmetry analysis of reversible Markov chains . Internet Math. , 2 : 31 – 71 .
  • Boyd , S , Diaconis , P , Sun , J and Xiao , L . 2006 . Fastest mixing Markov chain on a path . Am. Math. Monthly , 113 : 70 – 74 .
  • Boyd , S , Diaconis , P and Xiao , L . 2004 . Fastest mixing Markov chain on a graph . SIAM Rev. , 46 : 667 – 689 .
  • Diaconis , P and Stroock , D . 1991 . Geometric bounds for eigenvalues of Markov chains . Ann. Appl. Probab. , 1 : 36 – 61 .
  • Horn , RA and Johnson , CR . 1985 . Matrix Analysis , Cambridge : Cambridge University Press .
  • Sinclair , A . 1993 . Algorithms for Random Generations and Counting; A Markov Chain Approach , Boston : Birhäuser .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.