Central limit theorem for the largest component of random intersection graph

DOI10.37236/10706zbMath1491.05167OpenAlexW4280606302WikidataQ113693647 ScholiaQ113693647MaRDI QIDQ2144313

Liang Dong, Zhishui Hu

Publication date: 13 June 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/10706

zbMATH Keywords

random bipartite graphErdős-Rényi random graph model

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Unnamed Item
• Component evolution in random intersection graphs
• A note on the component structure in random intersection graphs with tunable clustering
• Degree and clustering coefficient in sparse random intersection graphs
• Epidemics on random intersection graphs
• Random Graphs and Complex Networks
• The shortest distance in random multi-type intersection graphs
• On Random Intersection Graphs: The Subgraph Problem
• On the total variation distance between the binomial random graph and the random intersection graph
• The vertex degree distribution of random intersection graphs
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models

This page was built for publication: Central limit theorem for the largest component of random intersection graph