The giant component of the directed configuration model revisited

zbMath1468.60012arXiv2004.04998MaRDI QIDQ5009813

Guillem Perarnau, Xing Shi Cai

Publication date: 6 August 2021

Full work available at URL: https://arxiv.org/abs/2004.04998

zbMATH Keywords

random graphsconfiguration modelstrongly connected componentrandom directed graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15) Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Locality of random digraphs on expanders ⋮ The diameter of the directed configuration model ⋮ Rankings in directed configuration models with heavy tailed in-degrees

Cites Work

• Unnamed Item
• Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs
• Introduction to Random Graphs
• The transitive closure of a random digraph
• The Probability That a Random Multigraph is Simple
• The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
• Characterizing optimal sampling of binary contingency tables via the configuration model
• The graph structure of a deterministic automaton chosen at random
• Some limit theorems for the total progeny of a branching process
• Quantum Information Theory

This page was built for publication: The giant component of the directed configuration model revisited