Mixing time of the adjacent walk on the simplex - CEntre de REcherches en MAthématiques de la DEcision Accéder directement au contenu
Article Dans Une Revue Annals of Probability Année : 2020

Mixing time of the adjacent walk on the simplex

Résumé

By viewing the $N$-simplex as the set of positions of $N-1$ ordered particles on the unit interval, the adjacent walk is the continuous time Markov chain obtained by updating independently at rate 1 the position of each particle with a sample from the uniform distribution over the interval given by the two particles adjacent to it. We determine its spectral gap and prove that both the total variation distance and the separation distance to the uniform distribution exhibit a cutoff phenomenon, with mixing times that differ by a factor $2$. The results are extended to the family of log-concave distributions obtained by replacing the uniform sampling by a symmetric log-concave Beta distribution.

Dates et versions

hal-02292734 , version 1 (20-09-2019)

Identifiants

Citer

Pietro Caputo, Cyril Labbé, Hubert Lacoin. Mixing time of the adjacent walk on the simplex. Annals of Probability, 2020, 48 (5), ⟨10.1214/20-AOP1428⟩. ⟨hal-02292734⟩
33 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More