{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:58Z","timestamp":1753893838266,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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&gt;1$, $\\alpha=1$ and $\\alpha&lt;1$.<\/jats:p>","DOI":"10.37236\/10706","type":"journal-article","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T07:45:51Z","timestamp":1652946351000},"source":"Crossref","is-referenced-by-count":0,"title":["Central Limit Theorem for the Largest Component of Random Intersection Graph"],"prefix":"10.37236","volume":"29","author":[{"given":"Liang","family":"Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhishui","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2022,5,20]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i2p30\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i2p30\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T07:45:52Z","timestamp":1652946352000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v29i2p30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,20]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2022,4,8]]}},"URL":"https:\/\/doi.org\/10.37236\/10706","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2022,5,20]]},"article-number":"P2.30"}}