Random regular graphs and the systole of a random surface

被引:8
|
作者
Petri, Bram [1 ]
机构
[1] Max Planck Inst Math, Vivatsgasse 7, D-53111 Bonn, Germany
基金
瑞士国家科学基金会;
关键词
D O I
10.1112/topo.12005
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We study the systole of a random surface, where by a random surface we mean a surface constructed by randomly gluing together an even number of triangles. We study two types of metrics on these surfaces, the first one coming from using ideal hyperbolic triangles and the second one using triangles that carry a given Riemannian metric. In the hyperbolic case, we compute the limit of the expected value of the systole when the number of triangles tends to infinity (approximately 2.484). We also determine the asymptotic probability distribution of the number of curves of any finite length. This turns out to be a Poisson distribution. In the Riemannian case, we give an upper bound to the limit supremum and a lower bound to the limit infimum of the expected value of the systole depending only on the metric on the triangle. We also show that this upper bound is sharp in the sense that there is a sequence of metrics for which the limit infimum comes arbitrarily close to the upper bound. The main tool we use is random regular graphs. One of the difficulties in the proof of the limits is controlling the probability that short closed curves are separating. To do this, we first prove that the probability that a random cubic graph has a short separating circuit tends to 0 as the number of vertices tends to infinity and show that this holds for circuits of a length up to log(2) of the number of vertices.
引用
收藏
页码:211 / 267
页数:57
相关论文
共 50 条
  • [31] UNIFORM GENERATION OF RANDOM REGULAR GRAPHS
    Gao, Pu
    Wormald, Nicholas
    SIAM JOURNAL ON COMPUTING, 2017, 46 (04) : 1395 - 1427
  • [32] The spectral gap of random regular graphs
    Sarid, Amir
    RANDOM STRUCTURES & ALGORITHMS, 2023, 63 (02) : 557 - 587
  • [33] HAMILTONIAN CYCLES IN RANDOM REGULAR GRAPHS
    FENNER, TI
    FRIEZE, AM
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 37 (02) : 103 - 112
  • [34] Decycling numbers of random regular graphs
    Bau, S
    Wormald, NC
    Zhou, SM
    RANDOM STRUCTURES & ALGORITHMS, 2002, 21 (3-4) : 397 - 413
  • [35] The Diameter of Dense Random Regular Graphs
    Shimizu, Nobutaka
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 1934 - 1944
  • [36] Random Cluster Model on Regular Graphs
    Bencs, Ferenc
    Borbenyi, Marton
    Csikvari, Peter
    COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2023, 399 (01) : 203 - 248
  • [37] The cover time of random regular graphs
    Cooper, C
    Frieze, A
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 18 (04) : 728 - 740
  • [38] Random Cluster Model on Regular Graphs
    Ferenc Bencs
    Márton Borbényi
    Péter Csikvári
    Communications in Mathematical Physics, 2023, 399 : 203 - 248
  • [39] CRITICAL PERCOLATION ON RANDOM REGULAR GRAPHS
    Joos, Felix
    Perarnau, Guillem
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2018, 146 (08) : 3321 - 3332
  • [40] Total domination of random regular graphs
    Duckworth, W.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2005, 33 : 279 - 289