Limiting shape of the depth first search tree in an Erdos-Renyi graph

被引：7

作者：

Enriquez, Nathanael ^{[1
]}

Faraud, Gabriel ^{[1
]}

Menard, Laurent ^{[1
]}

机构：

[1] Univ Paris Nanterre, UPL, Modal X, F-92000 Nanterre, France

来源：

RANDOM STRUCTURES & ALGORITHMS | 2020年 / 56卷 / 02期

关键词：

depth first search algorithm; Erdos-Renyi graphs;

D O I：

10.1002/rsa.20878

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We show that the profile of the tree constructed by the depth first search algorithm in the giant component of an Erdos-Renyi graph with N vertices and connection probability c/N with c > 1 converges to an explicit deterministic shape. This makes it possible to exhibit a long nonintersecting path of length rho c-Li2(rho c)cxN, where rho(c) is the density of the giant component and Li-2 denotes the dilogarithm function.

引用

页码：501 / 516

页数：16

共 50 条

[21] The genus of the Erdos-Renyi random graph and the fragile genus property
Dowden, Chris
Kang, Mihyun
Krivelevich, Michael
RANDOM STRUCTURES & ALGORITHMS, 2020, 56 (01) : 97 - 121
[22] Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching
Cullina, Daniel
Kiyavash, Negar
SIGMETRICS/PERFORMANCE 2016: PROCEEDINGS OF THE SIGMETRICS/PERFORMANCE JOINT INTERNATIONAL CONFERENCE ON MEASUREMENT AND MODELING OF COMPUTER SCIENCE, 2016, : 63 - 72
[23] The distribution of first hitting times of randomwalks on Erdos-Renyi networks
Tishby, Ido
Biham, Ofer
Katzav, Eytan
JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2017, 50 (11)
[24] Approximating the Cumulant Generating Function of Triangles in the Erdos-Renyi Random Graph
Giardina, Cristian
Giberti, Claudio
Magnanini, Elena
JOURNAL OF STATISTICAL PHYSICS, 2021, 182 (02)
[25] Convergence towards an Erdos-Renyi graph structure in network contraction processes
Tishby, Ido
Biham, Ofer
Katzav, Eytan
PHYSICAL REVIEW E, 2019, 100 (03)
[26] The critical point of k-clique percolation in the Erdos-Renyi graph
Palla, Gergely
Derenyi, Irnre
Vicsek, Tamas
JOURNAL OF STATISTICAL PHYSICS, 2007, 128 (1-2) : 219 - 227
[27] COMPONENT SIZES FOR LARGE QUANTUM ERDOS-RENYI GRAPH NEAR CRITICALITY
Dembo, Amir
Levit, Anna
Vadlamani, Sreekar
ANNALS OF PROBABILITY, 2019, 47 (02): : 1185 - 1219
[28] Delocalization and limiting spectral distribution of Erdos-Renyi graphs with constant expected degree
Jung, Paul
Lee, Jaehun
ELECTRONIC COMMUNICATIONS IN PROBABILITY, 2018, 23 : 1 - 13
[29] THE PROBABILITY OF UNUSUALLY LARGE COMPONENTS IN THE NEAR-CRITICAL ERDOS-RENYI GRAPH
Roberts, Matthew I.
ADVANCES IN APPLIED PROBABILITY, 2018, 50 (01) : 245 - 271
[30] Graph matching beyond perfectly-overlapping Erdos-Renyi random graphs
Hu, Yaofang
Wang, Wanjie
Yu, Yi
STATISTICS AND COMPUTING, 2022, 32 (01)

← 1 2 3 4 5 →