Fastest mixing Markov chain problem for the union of two cliques

ISSN： 0308-1087

Source： Linear and Multilinear Algebra, Vol.59, Iss.7, 2011-07, pp. : 801-823

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Waiting Time Problems in a Two-State Markov Chain

By Han Q. Aki S.

Annals of the Institute of Statistical Mathematics, Vol. 52, Iss. 4, 2000-12 ,pp. : 778-789

Springer Publishing Company

Access to resources Recommend Favorite

On Number of Occurrences of Success Runs of Specified Length in a Higher-Order Two-State Markov Chain

By Uchida M.

Annals of the Institute of Statistical Mathematics, Vol. 50, Iss. 3, 1998-09 ,pp. : 587-601

Springer Publishing Company

Access to resources Recommend Favorite

Joint Distributions of Numbers of Success-runs Until the First Consecutive k Successes in a Higher-Order Two-State Markov Chain

By Uchida M.

Annals of the Institute of Statistical Mathematics, Vol. 50, Iss. 2, 1998-06 ,pp. : 203-222

Springer Publishing Company

Access to resources Recommend Favorite

Asymptotics of Markov Kernels and the Tail Chain

Advances in Applied Probability, Vol. 45, Iss. 1, 2013-03 ,pp. : 186-213

Cambridge University Press

Access to resources Recommend Favorite

On some mixing times for nonreversible finite Markov chains

Journal of Applied Probability, Vol. 54, Iss. 2, 2017-06 ,pp. : 627-637

Cambridge University Press

Access to resources Recommend Favorite