The largest component in an inhomogeneous random intersection graph with clustering
From MaRDI portal
Publication:986718
zbMath1193.05144arXiv1002.4649MaRDI QIDQ986718
Publication date: 12 August 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.4649
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Applications of branching processes (60J85)
Related Items (6)
Degree distribution of an inhomogeneous random intersection graph ⋮ Phase transition in random intersection graphs with communities ⋮ Clustering and percolation on superpositions of Bernoulli random graphs ⋮ Degree and clustering coefficient in sparse random intersection graphs ⋮ Diameter, connectivity, and phase transition of the uniform random intersection graph ⋮ On local weak limit and subgraph counts for sparse random graphs
This page was built for publication: The largest component in an inhomogeneous random intersection graph with clustering
