The size of the largest strongly connected component of a random digraph with a given degree sequence

被引：52

作者：

Cooper, C ^{[1
]}

Frieze, A

机构：

[1] Univ London Goldsmiths Coll, Dept Math & Comp Sci, London SW14 6NW, England

[2] Carnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA

来源：

COMBINATORICS PROBABILITY & COMPUTING | 2004年 / 13卷 / 03期

关键词：

D O I：

10.1017/S096354830400611X

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We give results on the strong connectivity for spaces of sparse random digraphs specified by degree sequence. A full characterization is provided, in probability, of the fan-in and fan-out of all vertices including the number of vertices with small (o(n)) and large (cn) fan-in or fan-out. We also give the size of the giant strongly connected component, if any, and the structure of the bow-tie digraph induced by the vertices with large fan-in or fan-out. Our results follow a direct analogy of the extinction probabilities of classical branching processes.

引用

页码：319 / 337

页数：19

共 48 条

[21] Connected Components in Random Graphs with Given Expected Degree Sequences
Fan Chung
Linyuan Lu
Annals of Combinatorics, 2002, 6 (2) : 125 - 145
[22] Scaling Limit for the Random Walk on the Largest Connected Component of the Critical Random Graph
Croydon, David A.
PUBLICATIONS OF THE RESEARCH INSTITUTE FOR MATHEMATICAL SCIENCES, 2012, 48 (02) : 279 - 338
[23] On The Minimal ABC Index of Connected Graphs with Given Degree Sequence
Lin, Wenshui
Gao, Tianyi
Chen, Qi'an
Lin, Xin
MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2013, 69 (03) : 571 - 578
[24] Note on Sombor index of connected graphs with given degree sequence
Wei, Peichao
Liu, Muhuo
DISCRETE APPLIED MATHEMATICS, 2023, 330 : 51 - 55
[25] Size distribution of the largest component of a random A-mapping
Yakymiv, Arsen L.
DISCRETE MATHEMATICS AND APPLICATIONS, 2021, 31 (02): : 145 - 153
[26] Largest domination number and smallest independence number of forests with given degree sequence
Gentner, Michael
Henning, Michael A.
Rautenbach, Dieter
DISCRETE APPLIED MATHEMATICS, 2016, 206 : 181 - 187
[27] A CRITICAL-POINT FOR RANDOM GRAPHS WITH A GIVEN DEGREE SEQUENCE
MOLLOY, M
REED, B
RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (2-3) : 161 - 179
[28] A novel configuration model for random graphs with given degree sequence
Xu Xin-Ping
Liu Feng
CHINESE PHYSICS, 2007, 16 (02): : 282 - 286
[29] The largest component in a subcritical random graph with a power law degree distribution
Janson, Svante
ANNALS OF APPLIED PROBABILITY, 2008, 18 (04): : 1651 - 1668
[30] Degree sequence for k-arc strongly connected multiple digraphs
Hong, Yanmei
Liu, Qinghai
JOURNAL OF INEQUALITIES AND APPLICATIONS, 2017,

← 1 2 3 4 5 →