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 条
  • [21] CUTOFF PHENOMENA FOR RANDOM WALKS ON RANDOM REGULAR GRAPHS
    Lubetzky, Eyal
    Sly, Allan
    DUKE MATHEMATICAL JOURNAL, 2010, 153 (03) : 475 - 510
  • [22] VIRAL PROCESSES BY RANDOM WALKS ON RANDOM REGULAR GRAPHS
    Abdullah, Mohammed
    Cooper, Colin
    Draief, Moez
    ANNALS OF APPLIED PROBABILITY, 2015, 25 (02): : 477 - 522
  • [23] Branching annihilating random walk on random regular graphs
    Szabó, G
    PHYSICAL REVIEW E, 2000, 62 (05): : 7474 - 7477
  • [24] k-planar crossing number of random graphs and random regular graphs
    Asplund, John
    Do, Thao
    Hamm, Arran
    Szekely, Laszlo
    Taylor, Libby
    Wang, Zhiyu
    DISCRETE APPLIED MATHEMATICS, 2018, 247 : 419 - 422
  • [25] Correction: Sandwiching dense random regular graphs between binomial random graphs
    Pu Gao
    Mikhail Isaev
    Brendan D. McKay
    Probability Theory and Related Fields, 2023, 187 : 517 - 517
  • [26] Modular Orientations of Random and Quasi-Random Regular Graphs
    Alon, Noga
    Pralat, Pawel
    COMBINATORICS PROBABILITY & COMPUTING, 2011, 20 (03): : 321 - 329
  • [27] Random-link matching problems on random regular graphs
    Parisi, Giorgio
    Perrupato, Gianmarco
    Sicuro, Gabriele
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2020, 2020 (03):
  • [28] Random railways modeled as random 3-regular graphs
    Garmo, H
    RANDOM STRUCTURES & ALGORITHMS, 1996, 9 (1-2) : 113 - 136
  • [29] Distribution of subgraphs of random regular graphs
    Gao, Zhicheng
    Wormald, N. C.
    RANDOM STRUCTURES & ALGORITHMS, 2008, 32 (01) : 38 - 48
  • [30] Random walks on regular and irregular graphs
    Coppersmith, D
    Feige, U
    Shearer, J
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1996, 9 (02) : 301 - 308