Component evolution in random intersection graphs

zbMath1114.05093MaRDI QIDQ870077

Michael Behrisch

Publication date: 12 March 2007

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

Full work available at URL: https://eudml.org/doc/127570

zbMATH Keywords

clusteringgiant component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (17)

Efficiently covering complex networks with cliques of similar vertices ⋮ An elementary approach to component sizes in critical random graphs ⋮ Random subcube intersection graphs. I: Cliques and covering ⋮ Central limit theorem for the largest component of random intersection graph ⋮ Constructions of independent sets in random intersection graphs ⋮ The largest component in critical random intersection graphs ⋮ Degree distribution of an inhomogeneous random intersection graph ⋮ The number of triangles in random intersection graphs ⋮ Unnamed Item ⋮ Epidemics on Random Graphs with Tunable Clustering ⋮ The chromatic number of random intersection graphs ⋮ On the isolated vertices and connectivity in random intersection graphs ⋮ Poisson Approximation of the Number of Cliques in Random Intersection Graphs ⋮ Component evolution in a secure wireless sensor network ⋮ Diameter, connectivity, and phase transition of the uniform random intersection graph ⋮ Size of the largest component in a critical graph ⋮ Collapse of random triangular groups: a closer look

This page was built for publication: Component evolution in random intersection graphs