The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence

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.

[1]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[2]  Colin Cooper,et al.  The cores of random hypergraphs with a given degree sequence , 2004, Random Struct. Algorithms.

[3]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[4]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[5]  Toshihide Ibaraki,et al.  Reachability Problems of Random Digraphs , 1998 .

[6]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[7]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[8]  B. Pittel,et al.  The structure of a random graph at the point of the phase transition , 1994 .

[9]  Svante Janson,et al.  The Birth of the Giant Component , 1993, Random Struct. Algorithms.

[10]  Richard M. Karp,et al.  The Transitive Closure of a Random Digraph , 1990, Random Struct. Algorithms.

[11]  Tomasz Luczak,et al.  Component Behavior Near the Critical Point of the Random Graph Process , 1990, Random Struct. Algorithms.

[12]  Andrzej Rucinski,et al.  Random Graphs , 2018, Foundations of Data Science.

[13]  L. Gordon,et al.  Two moments su ce for Poisson approx-imations: the Chen-Stein method , 1989 .

[14]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[15]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..