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

  • Authors:
  • Colin Cooper;Alan Frieze

  • Affiliations:
  • Department of Mathematical and Computing Sciences, Goldsmiths College, London SW14 6NW, UK (e-mail: cooper@dcs.kcl.ac.uk);Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA15213, USA (e-mail: alan@random.math.cmu.edu)

  • Venue:
  • Combinatorics, Probability and Computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.