Emergence of the giant weak-component in directed random graphs with arbitrary degree distributions
Ivan Kryven

TL;DR
This paper derives an exact criterion for the emergence of a giant weak component in directed random graphs with arbitrary degree distributions, and analyzes the phase transition in evolving bounded-degree directed graphs.
Contribution
It provides a new exact criterion for the giant weak component in directed graphs with arbitrary degree distributions and links it to a generalized gelation theory.
Findings
Exact criterion for giant weak component existence
Analytic expression for phase transition time
Generalization of Flory-Stockmayer gelation theory
Abstract
The weak component generalizes the idea of connected components to directed graphs. In this paper, an exact criterion for existence of the giant weak component is derived for directed graphs with arbitrary bivariate degree distributions. In addition we consider a random process for evolving directed graphs with bounded degrees. The bounds are not the same for different vertices but satisfy a pre-defined distribution. The analytic expression obtained for the evolving degree distribution is then combined with the weak-component criterion to obtain the exact time of the phase transition. The phase-transition time is obtained as a function of the distribution that bounds the degrees. Remarkably, when viewed from the step polymerization formalism, the new results yield Flory-Stockmayer gelation theory and generalize it to a broader scope.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
