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.
Caputo, P., Labbe, C., Lacoin, H. (2020). MIXING TIME OF THE ADJACENT WALK ON THE SIMPLEX. ANNALS OF PROBABILITY, 48(5), 2449-2493 [10.1214/20-AOP1428].
MIXING TIME OF THE ADJACENT WALK ON THE SIMPLEX
Caputo, P;Lacoin, H
2020-01-01
Abstract
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
