Random intersection graphs are models of random graphs in which each vertex is assigned a subset of objects independently and two vertices are adjacent if their assigned subsets are adjacent. Let $n$ and $m=[\beta n^{\alpha}]$ denote the number of vertices and objects respectively. We get a central limit theorem for the largest component of the random intersection graph $G(n,m,p)$ in the supercritical regime and show that it changes between $\alpha>1$, $\alpha=1$ and $\alpha<1$.
@article{10_37236_10706,
author = {Liang Dong and Zhishui Hu},
title = {Central limit theorem for the largest component of random intersection graph},
journal = {The electronic journal of combinatorics},
year = {2022},
volume = {29},
number = {2},
doi = {10.37236/10706},
zbl = {1491.05167},
url = {http://geodesic.mathdoc.fr/articles/10.37236/10706/}
}
TY - JOUR
AU - Liang Dong
AU - Zhishui Hu
TI - Central limit theorem for the largest component of random intersection graph
JO - The electronic journal of combinatorics
PY - 2022
VL - 29
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/10706/
DO - 10.37236/10706
ID - 10_37236_10706
ER -
%0 Journal Article
%A Liang Dong
%A Zhishui Hu
%T Central limit theorem for the largest component of random intersection graph
%J The electronic journal of combinatorics
%D 2022
%V 29
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/10706/
%R 10.37236/10706
%F 10_37236_10706
Liang Dong; Zhishui Hu. Central limit theorem for the largest component of random intersection graph. The electronic journal of combinatorics, Tome 29 (2022) no. 2. doi: 10.37236/10706
