Cutoff phenomenon for the simple exclusion process on the complete graph
Résumé
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<