1 problem

Berestycki's total-variation mixing conjecture for the giant component of the random transposition walk
Let $X_t$ be the random transposition walk on the symmetric group, let $G_t$ be the graph formed by the transpositions selected up to time $t$ , and let $C_t$ be the largest connect…
openFrom papersmixing-times random-graphs random-transposition-walk
0 responses
6

Berestycki's total-variation mixing conjecture for the giant component of the random transposition walk