The distribution of the maximum vertex degree in random planar maps

被引:31
|
作者
Gao, ZC [1 ]
Wormald, NC
机构
[1] Carleton Univ, Dept Math & Stat, Ottawa, ON K1S 5B6, Canada
[2] Univ Melbourne, Dept Math, Parkville, Vic 3052, Australia
基金
澳大利亚研究理事会;
关键词
D O I
10.1006/jcta.1999.3006
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We determine the limiting distribution of the maximum vertex degree Delta(n) in a random triangulation of an n-gon, and show that it is the same as that of the maximum of n independent identically distributed random variables G(2), where G(2) is the sum of two independent geometric(1/2) random variables. This answers affirmatively a question of Devroye. Flajolet, Hurtado, Noy and Steiger, who gave much weaker almost sure bounds on Delta(n). An interesting consequence of this is that the asymptotic probability that a random triangulation has a unique vertex with maximum degree is about 0.72. We also give an analogous result for random planar maps in general. (C) 2000 Academic Press.
引用
收藏
页码:201 / 230
页数:30
相关论文
共 50 条
  • [21] Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
    Yulin Chang
    Qiancheng Ouyang
    Guanghui Wang
    Journal of Combinatorial Optimization, 2019, 38 : 185 - 196
  • [22] The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
    Cheng, Xiaohan
    Wang, Bin
    Wang, Jihui
    DISCRETE APPLIED MATHEMATICS, 2022, 313 : 29 - 39
  • [23] The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
    Xiaohan Cheng
    Jianliang Wu
    Journal of Combinatorial Optimization, 2018, 35 : 1 - 13
  • [24] The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
    Cheng, Xiaohan
    Wu, Jianliang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (01) : 1 - 13
  • [25] Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
    Chang, Yulin
    Ouyang, Qiancheng
    Wang, Guanghui
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (01) : 185 - 196
  • [26] Minimum vertex cover in generalized random graphs with power law degree distribution
    Vignatti, Andre L.
    da Silva, Murilo V. G.
    THEORETICAL COMPUTER SCIENCE, 2016, 647 : 101 - 111
  • [27] Total vertex enumeration in rooted planar maps
    Koganov, LM
    Liskovets, VA
    Walsh, TRS
    ARS COMBINATORIA, 2000, 54 : 149 - 160
  • [28] Graph realizations: Maximum degree in vertex neighborhoods
    Bar-Noy, Amotz
    Choudhary, Keerti
    Peleg, David
    Rawitz, Dror
    DISCRETE MATHEMATICS, 2023, 346 (09)
  • [29] Groups with maximum vertex degree commuting graphs
    Bhunia, Sushil
    Arunkumar, G.
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2024, 55 (01): : 234 - 241
  • [30] Maximum vertex and face degree of oblique graphs
    Kardos, Frantisek
    Miskuf, Jozef
    DISCRETE MATHEMATICS, 2009, 309 (15) : 4942 - 4948