Cutoff for samples of Markov chains
Bernard Ycart (1999)
ESAIM: Probability and Statistics
Similarity:
Bernard Ycart (1999)
ESAIM: Probability and Statistics
Similarity:
Bandyopadhyay, Antar, Aldous, David J. (2001)
Electronic Communications in Probability [electronic only]
Similarity:
Faure, Mathieu (2002)
Electronic Journal of Probability [electronic only]
Similarity:
Cassandro, Marzio, Orlandi, Enza, Picco, Pierre, Eulalia Vares, Maria (2005)
Electronic Journal of Probability [electronic only]
Similarity:
Toninelli, Fabio Lucio (2007)
Electronic Journal of Probability [electronic only]
Similarity:
Dalal, Avinash, Schmutz, Eric (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Olivier Mejane (2004)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
Fill, James Allen, Schoolfield, Clyde H.jun. (2001)
Electronic Journal of Probability [electronic only]
Similarity:
Guan-Yu Chen, Wai-Wai Liu, Laurent Saloff-Coste (2008)
Annales de la faculté des sciences de Toulouse Mathématiques
Similarity:
The logarithmic Sobolev constant is always bounded above by half the spectral gap. It is natural to ask when this inequality is an equality. We consider this question in the context of reversible Markov chains on small finite state spaces. In particular, we prove that equality holds for simple random walk on the five cycle and we discuss assorted families of chains on three and four points.
Pak, Igor (1999)
Electronic Journal of Probability [electronic only]
Similarity: