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

DOI10.1017/S096354830400611XzbMath1065.05085OpenAlexW1987070596WikidataQ57401519 ScholiaQ57401519MaRDI QIDQ4819245

Colin Cooper, Alan M. Frieze

Publication date: 24 September 2004

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096354830400611x

zbMATH Keywords

characterizationstrong connectivitygiant componentfan-infan-outbow-tie digraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Related Items (27)

Markov chains on finite fields with deterministic jumps ⋮ Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph ⋮ The scaling window for a random graph with a given degree sequence ⋮ Typical distances in the directed configuration model ⋮ Bootstrap percolation in living neural networks ⋮ The giant component of the directed configuration model revisited ⋮ Random walk on sparse random digraphs ⋮ The Role of Directionality, Heterogeneity, and Correlations in Epidemic Risk and Spread ⋮ Mixing time of PageRank surfers on sparse random digraphs ⋮ A scaling limit for the length of the longest cycle in a sparse random digraph ⋮ Locality of random digraphs on expanders ⋮ The birth of the strong components ⋮ On the meeting of random walks on random DFA ⋮ The diameter of the directed configuration model ⋮ Rankings in directed configuration models with heavy tailed in-degrees ⋮ The Probability That a Random Multigraph is Simple ⋮ On the Chromatic Number of Random Graphs with a Fixed Degree Sequence ⋮ Mixing time trichotomy in regenerating dynamic digraphs ⋮ RESILIENCE TO CONTAGION IN FINANCIAL NETWORKS ⋮ The largest strongly connected component in the cyclical pedigree model of Wakeley et al. ⋮ The strong giant in a random digraph ⋮ The spectral gap of sparse random digraphs ⋮ Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs ⋮ A Theoretical Analysis of the Structure of HC-128 ⋮ Bootstrap percolation in directed inhomogeneous random graphs ⋮ Asymptotic enumeration of strongly connected digraphs by vertices and edges ⋮ Limit laws for self-loops and multiple edges in the configuration model

This page was built for publication: The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence