English

The Random Transposition Dynamics on Random Regular Graphs and the Gaussian Free Field

Probability 2014-12-30 v2 Combinatorics

Abstract

A single permutation, seen as union of disjoint cycles, represents a regular graph of degree two. Consider dd many independent random permutations and superimpose their graph structures. It is a common model of a random regular (multi-) graph of degree 2d2d. We consider the following dynamics. The dimension (i.e. size) of each permutation grows by coupled Chinese Restaurant Processes, while in time each permutation evolves according to the random transposition chain. Asymptotically in the size of the graph one observes a remarkable evolution of short cycles and linear eigenvalue statistics in dimension and time. In dimension, it was shown by Johnson and Pal (2014) that cycle counts are described by a Poisson field of Yule processes. Here, we give a Poisson random surface description in dimension and time of the limiting cycle counts for every dd. As dd grows to infinity, the fluctuation of the limiting cycle counts, across dimension, converges to the Gaussian Free Field. In time this field is preserved by a stationary Gaussian dynamics. The laws of these processes are similar to eigenvalue fluctuations of the minor process of a real symmetric Wigner matrix whose coordinates evolve as i.i.d. stationary stochastic processes.

Keywords

Cite

@article{arxiv.1409.7766,
  title  = {The Random Transposition Dynamics on Random Regular Graphs and the Gaussian Free Field},
  author = {Shirshendu Ganguly and Soumik Pal},
  journal= {arXiv preprint arXiv:1409.7766},
  year   = {2014}
}

Comments

43 pages, 6 figures. arXiv admin note: text overlap with arXiv:1406.7043 by other authors

R2 v1 2026-06-22T06:07:19.952Z