### Exact mixing in an unknown Markov chain.

Lovász, László, Winkler, Peter (1995)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Lovász, László, Winkler, Peter (1995)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Fulman, Jason (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Dalal, Avinash, Schmutz, Eric (2002)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Palacios, José Luis (2009)

Journal of Probability and Statistics

Similarity:

Fill, James Allen, Schoolfield, Clyde H.jun. (2001)

Electronic Journal of Probability [electronic only]

Similarity:

Persi Diaconis (2005)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

David J. Aldous (1983)

Séminaire de probabilités de Strasbourg

Similarity:

Telecs, András (2000)

Electronic Communications in Probability [electronic only]

Similarity:

Stephen J. Kirkland (2016)

Czechoslovak Mathematical Journal

Similarity:

We consider an accessibility index for the states of a discrete-time, ergodic, homogeneous Markov chain on a finite state space; this index is naturally associated with the random walk centrality introduced by Noh and Reiger (2004) for a random walk on a connected graph. We observe that the vector of accessibility indices provides a partition of Kemeny's constant for the Markov chain. We provide three characterizations of this accessibility index: one in terms of the first return time...

Martínez, Conrado, Panholzer, Alois, Prodinger, Helmut (1998)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Fill, James Allen, Huber, Mark L. (2010)

Electronic Journal of Probability [electronic only]

Similarity: