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

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

C.M. da Fonseca. (2013) Remarks and open problems on the minimum permanent of acyclic doubly stochastic matrices. Linear and Multilinear Algebra 61:3, pages 281-293.
Read now

Articles from other publishers (3)

Sam Olesker-Taylor & Luca Zanetti. (2024) Geometric bounds on the fastest mixing Markov chain. Probability Theory and Related Fields 188:3-4, pages 1017-1062.
Crossref
Saber Jafarizadeh. (2020) Fastest Mixing Reversible Markov Chain: Clique Lifted Graphs and Subgraphs. IEEE Transactions on Signal and Information Processing over Networks 6, pages 88-104.
Crossref
Onur Cihan & Mehmet Akar. (2015) Fastest Mixing Reversible Markov Chains on Graphs With Degree Proportional Stationary Distributions. IEEE Transactions on Automatic Control 60:1, pages 227-232.
Crossref

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.