Universality for the Distance in Finite Variance Random Graphs

被引：0
|
作者：
Henri van den Esker
Remco van der Hofstad
Gerard Hooghiemstra
机构：
[1] Delft University of Technology,Department of Mathematics and Computer Science
[2] Electrical Engineering,undefined
[3] Mathematics and Computer Science,undefined
[4] Eindhoven University of Technology,undefined
来源：
Journal of Statistical Physics | 2008年 / 133卷
关键词：
Random Graphs; Graph distances; Inhomogeneous random graphs; Coupling; Branching processes; Universality;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree random graph and the generalized random graph (including the classical Erdős-Rényi graph).
引用
收藏
页码：169 / 202
页数：33
相关论文
共 50 条
  • [1] Universality for the distance in finite variance random graphs
    van den Esker, Henri
    van der Hofstad, Remco
    Hooghiemstra, Gerard
    [J]. JOURNAL OF STATISTICAL PHYSICS, 2008, 133 (01) : 169 - 202
  • [2] Distances in random graphs with finite variance degrees
    van der Hofstad, R
    Hooghiemstra, G
    Van Mieghem, P
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2005, 27 (01) : 76 - 123
  • [3] UNIVERSALITY OF RANDOM GRAPHS
    Dellamonica, Domingos, Jr.
    Kohayakawa, Yoshiharu
    Roedl, Vojtech
    Rucinski, Andrzej
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (01) : 353 - 374
  • [4] Universality of Random Graphs
    Dellamonica, Domingos, Jr.
    Kohayakawa, Yoshiharu
    Roedl, Vojtech
    Rucinski, Andrzej
    [J]. PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 782 - 788
  • [5] Embeddability of finite distance graphs with a large chromatic number in random graphs
    S. V. Nagaeva
    [J]. Doklady Mathematics, 2008, 77 : 13 - 16
  • [6] Embeddability of finite distance graphs with a large chromatic number in random graphs
    Nagaeva, S. V.
    [J]. DOKLADY MATHEMATICS, 2008, 77 (01) : 13 - 16
  • [7] On embedding of finite distance graphs with large chromatic number in random graphs
    Nagaeva S.V.
    Raigorodskii A.M.
    [J]. Journal of Mathematical Sciences, 2009, 161 (5) : 648 - 667
  • [8] Embeddability of finite distance graphs with a large chromatic number in random graphs
    Department of Mathematical Statistics and Random Processes, Faculty of Mechanics and Mathematics, Moscow State University, Leninskie gory, Moscow 119992, Russia
    [J]. Dokl. Math., 2008, 1 (13-16):
  • [9] Distances in random graphs with finite mean and infinite variance degrees
    van der Hofstad, Remco
    Hooghiemstra, Gerard
    Znamenski, Dmitri
    [J]. ELECTRONIC JOURNAL OF PROBABILITY, 2007, 12 : 703 - 766
  • [10] Spanning universality in random graphs
    Ferber, Asaf
    Nenadov, Rajko
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2018, 53 (04) : 604 - 637
12345