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 条
12345