AbstractWe consider families of Ehrenfest chains and provide a simple criterion on the Lp-cutoff and the Lp-precutoff with specified initial states for 1≤p<∞. For the family with an Lp-cutoff, a cutoff time is described and a possible window is given. For the family without an Lp-precutoff, the exact order of the Lp-mixing time is determined. The result is consistent with the well-known conjecture on cutoffs of Markov chains proposed by Peres in 2004, which says that a cutoff exists if and only if the multiplication of the spectral gap and the mixing time tends to infinity
Abstract. The cutoff phenomenon describes a sharp transition in the convergence of a family of ergod...
Una cadena de Markov es un proceso temporal aleatorio sin memoria. Es sabido que toda cadena de Mark...
Given a continuous time Markov Chain {q (x, y )} on a finite set S , the associated noisy voter mod...
AbstractWe consider families of Ehrenfest chains and provide a simple criterion on the Lp-cutoff and...
A card player may ask the following question: how many shuffles are needed to mix up a deck of cards...
AbstractWe consider the problem of proving the existence of an L2-cutoff for families of ergodic Mar...
In this paper we consider an example of a family of Markov chains with a spectral gap and show that ...
This paper gives a necessary and sufficient condition for a sequence of birth and death chains to co...
A sequence of Markov chains is said to exhibit (total variation) cutoff if the conver-gence to stati...
A card player may ask the following question: how many shuffles are needed to mix up a deck of cards...
Diaconis and others have shown that certain Markov chains exhibit a "cutoff phenomenon" in which, af...
In this paper we present, in the context of Diaconis’ paradigm, a general method to detect the cutof...
The aim of this thesis is to present several (co-authored) works of the author concerning applicatio...
Let $(X_t)_{t = 0 }^{\infty}$ be an irreducible reversible discrete-time Markov chain on a finite st...
In this paper we present, in the context of Diaconis' paradigm, a general method to detect the cutof...
Abstract. The cutoff phenomenon describes a sharp transition in the convergence of a family of ergod...
Una cadena de Markov es un proceso temporal aleatorio sin memoria. Es sabido que toda cadena de Mark...
Given a continuous time Markov Chain {q (x, y )} on a finite set S , the associated noisy voter mod...
AbstractWe consider families of Ehrenfest chains and provide a simple criterion on the Lp-cutoff and...
A card player may ask the following question: how many shuffles are needed to mix up a deck of cards...
AbstractWe consider the problem of proving the existence of an L2-cutoff for families of ergodic Mar...
In this paper we consider an example of a family of Markov chains with a spectral gap and show that ...
This paper gives a necessary and sufficient condition for a sequence of birth and death chains to co...
A sequence of Markov chains is said to exhibit (total variation) cutoff if the conver-gence to stati...
A card player may ask the following question: how many shuffles are needed to mix up a deck of cards...
Diaconis and others have shown that certain Markov chains exhibit a "cutoff phenomenon" in which, af...
In this paper we present, in the context of Diaconis’ paradigm, a general method to detect the cutof...
The aim of this thesis is to present several (co-authored) works of the author concerning applicatio...
Let $(X_t)_{t = 0 }^{\infty}$ be an irreducible reversible discrete-time Markov chain on a finite st...
In this paper we present, in the context of Diaconis' paradigm, a general method to detect the cutof...
Abstract. The cutoff phenomenon describes a sharp transition in the convergence of a family of ergod...
Una cadena de Markov es un proceso temporal aleatorio sin memoria. Es sabido que toda cadena de Mark...
Given a continuous time Markov Chain {q (x, y )} on a finite set S , the associated noisy voter mod...