The strong giant in a random digraph

DOI10.1017/JPR.2015.8zbMath1335.05164arXiv1409.4371OpenAlexW1838920763MaRDI QIDQ2804412

Mathew D. Penrose

Publication date: 29 April 2016

Published in: Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

branching processgiant componentsemi-homogeneous random digraph

Mathematics Subject Classification ID

Epidemiology (92D30) Random graphs (graph-theoretic aspects) (05C80) Applications of branching processes (60J85)

Related Items (2)

Typical distances in the directed configuration model ⋮ The diameter of the directed configuration model

Cites Work

• Unnamed Item
• Unnamed Item
• On the connectivity of random m-orientable graphs and digraphs
• Information Transmission under Random Emission Constraints
• Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph
• The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence

This page was built for publication: The strong giant in a random digraph