Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs

DOI10.1002/rsa.20622zbMath1348.05196arXiv1405.4022OpenAlexW2101433188MaRDI QIDQ2818275

Boris G. Pittel, Daniel J. Poole

Publication date: 7 September 2016

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

central limit theoremcorerandom digraphgiant component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20) Density (toughness, etc.) (05C42)

Related Items (2)

The giant component of the directed configuration model revisited ⋮ Birth of a giant \((k_{1},k_{2})\)-core in the random digraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic normality of the size of the giant component via a random walk
• Asymptotic normality of the \(k\)-core in random graphs
• Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
• Normal convergence problem? Two moments and a recurrence may be the clues
• The phase transition in a random hypergraph
• Counting connected graphs inside-out
• Asymptotic enumeration of sparse graphs with a minimum degree constraint
• Sudden emergence of a giant \(k\)-core in a random graph
• On the Fluctuations of the Giant Component
• Counting strongly-connected, moderately sparse directed graphs
• Asymptotic enumeration of strongly connected digraphs by vertices and edges
• The phase transition in random graphs: A simple proof
• On the normality of giant components
• Random dense bipartite graphs and directed graphs with specified degrees
• The critical behavior of random digraphs
• The order of the giant component of random hypergraphs
• Anatomy of a young giant component in the random graph
• Asymptotic normality of the size of the giant component in a random hypergraph
• The transitive closure of a random digraph
• The phase transition in the evolution of random digraphs
• The Evolution of Random Graphs
• An urn model for cannibal behavior
• Component behavior near the critical point of the random graph process
• On tree census and the giant component in sparse random graphs
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• The random bipartite nearest neighbor graphs
• The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
• Local Limit Theorems for the Giant Component of Random Hypergraphs
• Large‐deviations/thermodynamic approach to percolation on the complete graph
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
• Stable husbands

This page was built for publication: Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs