Cutoff phenomenon for the simple exclusion process on the complete graph

2010/10/23 by Lacoin, Hubert, Leblond, Remi
#37A25 #60B10 #82C22 #FOS: Mathematics #Probability (math.PR)

paper · doi:10.48550/arxiv.1010.4866

Abstract

We study the time that the simple exclusion process on the complete graph needs to reach equilibrium in terms of total variation distance. For the graph with n vertices and 1<

Related

• Cutoffs for exclusion processes on graphs with open boundaries
• The cutoff profile for exclusion processes in any dimension
• Mixing time and cutoff phenomenon for the interchange process on dumbbell graphs and the labelled exclusion process on the complete graph
• Cutoff of the simple exclusion process with inhomogeneous conductances
• Mixing time and cutoff for one dimensional particle systems