The giant component of the directed configuration model revisited

Xing Shi Cai, Guillem Perarnau

英文摘要：

We prove a law of large numbers for the order and size of the largest strongly connected component in the directed configuration model. Our result extends previous work by Cooper and Frieze.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

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

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 phas…

2016-07-13math.COmath.PR

Percolation of a strongly connected component in simple directed random graphs with a given degree distribution

We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probability above which the giant strongly connected component emerges and the fraction of vertices in this component.

2021-03-04math.COmath.PR

Counting strongly connected $(k_1,k_2)$-directed cores

Consider the set of all digraphs on $[N]$ with $M$ edges, whose minimum in-degree and minimum out-degree are at least $k_1$ and $k_2$ respectively. For $k:=\min\{k_1,k_2\}\ge 2$ and $M/N>\max\{k_1,k_2\}$, $M=Θ(N)$, we show that, among those digraphs, the fraction of $k$-strongly connected digraphs is $1-O\bigl(N^{-(k-1)})$. Earlier with Dan Poole we identified a sharp edge-density threshold $c^*(k_1,k_2)$ for birth of a giant $(k_1,k_2)$-core in the random digraph $D(n,m=[cn])$. Combining the claims, for $c>c^*(k_1,k_2)$ with probability $1-O\bigl(N^{-(k-1)})$ the giant $(k_1,k_2)$-core exists…

2016-09-01math.COmath.PR

The scaling limit of a critical random directed graph

We consider the random directed graph $\vec{G}(n,p)$ with vertex set $\{1,2,\ldots,n\}$ in which each of the $n(n-1)$ possible directed edges is present independently with probability $p$. We are interested in the strongly connected components of this directed graph. A phase transition for the emergence of a giant strongly connected component is known to occur at $p = 1/n$, with critical window $p= 1/n + λn^{-4/3}$ for $λ\in \mathcal{R}$. We show that, within this critical window, the strongly connected components of $\vec{G}(n,p)$, ranked in decreasing order of size and rescaled by $n^{-1/3}$…

2021-08-04math.COmath.PR

Universality for the directed configuration model: metric space convergence of the strongly connected components at criticality

We consider the strongly connected components (SCCs) of a uniform directed graph on $n$ vertices with i.i.d. in- and out-degree pairs distributed as $(D^-,D^+)$, with $\mathbb E[D^+]=\mathbb E[D^-]=μ$. We condition on equal total in- and out-degree. A phase transition for the emergence of a giant SCC is known to occur at the critical value $\mathbb E[D^-D^+] = μ$. We study the model at this critical value and, additionally, require that $\mathbb E[(D^-)^i(D^+)^j]<\infty$ for all $i+j\leq 3$, and for $(i,j)=(1,3)$ and $(i,j)=(3,1)$. We show that, under these conditions, the SCCs ranked by decre…

2021-11-02math.COmath.PR

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

Two models of a random digraph on $n$ vertices, $D(n,\text{Prob}(\text{arc})=p)$ and $D(n,\text{number of arcs}=m)$ are studied. In 1990, Karp for $D(n,p)$ and independently T. Łuczak for $D(n,m=cn)$ proved that for $c>1$, with probability tending to 1, there is an unique strong component of size of order $n$. Karp showed, in fact, that the giant component has likely size asymptotic to $nθ^2$, where $θ=θ(c)$ is the unique positive root of $1-θ=e^{-c θ}$. In this paper we prove that, for both random digraphs, the joint distribution of the number of vertices and number of arcs in the giant stron…

2015-05-20math.COmath.PR