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 条
  • [1] On the asymmetry of random regular graphs and random graphs
    Kim, JH
    Sudakov, B
    Vu, VH
    RANDOM STRUCTURES & ALGORITHMS, 2002, 21 (3-4) : 216 - 224
  • [2] MULTIPLE RANDOM WALKS IN RANDOM REGULAR GRAPHS
    Cooper, Colin
    Frieze, Alan
    Radzik, Tomasz
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (04) : 1738 - 1761
  • [3] Sandwiching random regular graphs between binomial random graphs
    Gao, Pu
    Isaev, Mikhail
    McKay, Brendan D.
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 690 - 701
  • [4] Sandwiching random regular graphs between binomial random graphs
    Gao, Pu
    Isaev, Mikhail
    McKay, Brendan D.
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 690 - 701
  • [5] Colouring random regular graphs
    Shi, Lingsheng
    Wormald, Nicholas
    COMBINATORICS PROBABILITY & COMPUTING, 2007, 16 (03): : 459 - 494
  • [6] Generating random regular graphs
    Kim, J. H.
    Vu, V. H.
    COMBINATORICA, 2006, 26 (06) : 683 - 708
  • [7] Minors in Random Regular Graphs
    Fountoulakis, Nikolaos
    Kuehn, Daniela
    Osthus, Deryk
    RANDOM STRUCTURES & ALGORITHMS, 2009, 35 (04) : 444 - 463
  • [8] Random Matchings in Regular Graphs
    Jeff Kahn
    Jeong Han Kim
    Combinatorica, 1998, 18 : 201 - 226
  • [9] Random strongly regular graphs?
    Cameron, PJ
    DISCRETE MATHEMATICS, 2003, 273 (1-3) : 103 - 114
  • [10] THE DIAMETER OF RANDOM REGULAR GRAPHS
    BOLLOBAS, B
    DELAVEGA, WF
    COMBINATORICA, 1982, 2 (02) : 125 - 134