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 条
  • [41] RAINBOW CONNECTION OF RANDOM REGULAR GRAPHS
    Dudek, Andrzej
    Frieze, Alan M.
    Tsourakakis, Charalampos E.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (04) : 2255 - 2266
  • [42] Majority Model on Random Regular Graphs
    Gartner, Bernd
    Zehmakan, Ahad N.
    LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 572 - 583
  • [43] The chromatic number of random regular graphs
    Achlioptas, D
    Moore, C
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2004, 3122 : 219 - 228
  • [44] On the chromatic number of random regular graphs
    Coja-Oghlan, Amin
    Efthymiou, Charilaos
    Hetterich, Samuel
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 116 : 367 - 439
  • [45] THE ISOPERIMETRIC NUMBER OF RANDOM REGULAR GRAPHS
    BOLLOBAS, B
    EUROPEAN JOURNAL OF COMBINATORICS, 1988, 9 (03) : 241 - 244
  • [46] CONTACT PROCESSES ON RANDOM REGULAR GRAPHS
    Lalley, Steven
    Su, Wei
    ANNALS OF APPLIED PROBABILITY, 2017, 27 (04): : 2061 - 2097
  • [47] Small subgraphs of random regular graphs
    Kim, Jeong Han
    Sudakov, Benny
    Vu, Van
    DISCRETE MATHEMATICS, 2007, 307 (15) : 1961 - 1967
  • [48] Packing edges in random regular graphs
    Beis, M
    Duckworth, W
    Zito, M
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 : 118 - 130
  • [49] Critical Percolation on Random Regular Graphs
    Nachmias, Asaf
    Peres, Yuval
    RANDOM STRUCTURES & ALGORITHMS, 2010, 36 (02) : 111 - 148
  • [50] Short cycles in random regular graphs
    McKay, BD
    Wormald, NC
    Wysocka, B
    ELECTRONIC JOURNAL OF COMBINATORICS, 2004, 11 (01):