The random transposition dynamics on random regular graphs and the Gaussian free field

被引:1
|
作者
Ganguly, Shirshendu [1 ]
Pal, Soumik [2 ]
机构
[1] Univ Calif Berkeley, Dept Stat, Berkeley, CA 94720 USA
[2] Univ Washington, Dept Math, Seattle, WA 98195 USA
关键词
Random regular graphs; Chinese restaurant process; Random transpositions; Virtual permutations; Gaussian free field; Minor process; Dyson Brownian motion; STOCHASTIC-PROCESSES; WEAK-CONVERGENCE; 2ND EIGENVALUE; SPECTRA; CYCLES; PROOF;
D O I
10.1214/20-AIHP1063
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
A single permutation, seen as union of disjoint cycles, represents a regular graph of degree two. Consider d many independent random permutations and superimpose their graph structures. This is the well known permutation model of a random regular (multi-) graph of degree 2d. We consider a two dimensional field of d permutations indexed by size and time. The size of each permutation grows by coupled Chinese Restaurant Processes, while in time, each permutation evolves according to the random transposition chain. Via the permutation model, this projects to give a two parameter family of graphs growing in size ("dimension") and evolving over time. Asymptotically in this random graph ensemble 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 (Ann. Probab. 42 (2014) 1396-1437) 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 cycle process, for every d. As d grows to infinity, the fluctuation of the limiting cycle counts, converges to a Gaussian process indexed by dimension and time. The marginal along dimension turns out to be the Gaussian Free Field and the process is stationary in time. Similar covariance structure appears in eigenvalue fluctuations of the minor process of a real symmetric Wigner matrix whose coordinates evolve as i.i.d. stationary stochastic processes. Thus this article describes a Poisson analogue of a natural Markovian dynamics on the Gaussian free field and its path properties.
引用
收藏
页码:2935 / 2970
页数:36
相关论文
共 50 条
  • [41] Decycling numbers of random regular graphs
    Bau, S
    Wormald, NC
    Zhou, SM
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2002, 21 (3-4) : 397 - 413
  • [42] Random Cluster Model on Regular Graphs
    Bencs, Ferenc
    Borbenyi, Marton
    Csikvari, Peter
    [J]. COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2023, 399 (01) : 203 - 248
  • [43] The cover time of random regular graphs
    Cooper, C
    Frieze, A
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 18 (04) : 728 - 740
  • [44] Random Cluster Model on Regular Graphs
    Ferenc Bencs
    Márton Borbényi
    Péter Csikvári
    [J]. Communications in Mathematical Physics, 2023, 399 : 203 - 248
  • [45] Total domination of random regular graphs
    Duckworth, W.
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2005, 33 : 279 - 289
  • [46] CRITICAL PERCOLATION ON RANDOM REGULAR GRAPHS
    Joos, Felix
    Perarnau, Guillem
    [J]. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2018, 146 (08) : 3321 - 3332
  • [47] The chromatic number of random regular graphs
    Achlioptas, D
    Moore, C
    [J]. APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2004, 3122 : 219 - 228
  • [48] RAINBOW CONNECTION OF RANDOM REGULAR GRAPHS
    Dudek, Andrzej
    Frieze, Alan M.
    Tsourakakis, Charalampos E.
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (04) : 2255 - 2266
  • [49] Majority Model on Random Regular Graphs
    Gartner, Bernd
    Zehmakan, Ahad N.
    [J]. LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 572 - 583
  • [50] CONTACT PROCESSES ON RANDOM REGULAR GRAPHS
    Lalley, Steven
    Su, Wei
    [J]. ANNALS OF APPLIED PROBABILITY, 2017, 27 (04): : 2061 - 2097