Component evolution in random intersection graphs
From MaRDI portal
Publication:870077
zbMath1114.05093MaRDI QIDQ870077
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
05C80: Random graphs (graph-theoretic aspects)
Related Items
Poisson Approximation of the Number of Cliques in Random Intersection Graphs, Component evolution in a secure wireless sensor network, Collapse of random triangular groups: a closer look, Random subcube intersection graphs. I: Cliques and covering, Degree distribution of an inhomogeneous random intersection graph, The chromatic number of random intersection graphs, On the isolated vertices and connectivity in random intersection graphs, The largest component in critical random intersection graphs, Central limit theorem for the largest component of random intersection graph, Diameter, connectivity, and phase transition of the uniform random intersection graph, Size of the largest component in a critical graph, Efficiently covering complex networks with cliques of similar vertices, Constructions of independent sets in random intersection graphs, Epidemics on Random Graphs with Tunable Clustering