# Mixing of fast random walks on dynamic random permutations

arxiv（2024）

摘要

We analyse the mixing profile of a random walk on a dynamic random
permutation, focusing on the regime where the walk evolves much faster than the
permutation. Two types of dynamics generated by random transpositions are
considered: one allows for coagulation of permutation cycles only, the other
allows for both coagulation and fragmentation. We show that for both types,
after scaling time by the length of the permutation and letting this length
tend to infinity, the total variation distance between the current distribution
and the uniform distribution converges to a limit process that drops down in a
single jump. This jump is similar to a one-sided cut-off, occurs after a random
time whose law we identify, and goes from the value 1 to a value that is a
strictly decreasing and deterministic function of the time of the jump, related
to the size of the largest component in Erdős-Rényi random graphs. After
the jump, the total variation distance follows this function down to 0.

更多查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要