Equivalence of a random intersection graph and G (n ,p )

DOI10.1002/rsa.20356zbMath1223.05282arXiv0910.5311MaRDI QIDQ3068767

Katarzyna Rybarczyk

Publication date: 17 January 2011

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.5311

zbMATH Keywords

equivalence; graph properties; random intersection graph

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C75: Structural characterization of families of graphs

Related Items

Random subcube intersection graphs. I: Cliques and covering, On the chromatic number of non-sparse random intersection graphs, The chromatic number of random intersection graphs, The coupling method for inhomogeneous random intersection graphs., Maximum cliques in graphs with small intersection number and random intersection graphs, The largest component in critical random intersection graphs, Phase transitions for detecting latent geometry in random graphs, Diameter, connectivity, and phase transition of the uniform random intersection graph, Poisson approximation of counts of induced subgraphs in random intersection graphs, Constructions of independent sets in random intersection graphs, On Some Combinatorial Properties of Random Intersection Graphs

Cites Work

• Degree distribution of a typical vertex in a general random intersection graph
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• Perfect matchings in random uniform hypergraphs
• Poisson Approximation of the Number of Cliques in Random Intersection Graphs
• Component evolution in a secure wireless sensor network