Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
From MaRDI portal
Publication:4948019
DOI<156::AID-RSA3>3.0.CO;2-H 10.1002/(SICI)1098-2418(200003)16:2<156::AID-RSA3>3.0.CO;2-HzbMath0951.05096OpenAlexW2031211633MaRDI QIDQ4948019
James Allen Fill, Karen B. Singer-Cohen, Edward R. Scheinerman
Publication date: 13 December 2000
Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(200003)16:2<156::aid-rsa3>3.0.co;2-h
Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (33)
Poisson approximation of counts of induced subgraphs in random intersection graphs ⋮ Maximum cliques in graphs with small intersection number and random intersection graphs ⋮ Efficiently covering complex networks with cliques of similar vertices ⋮ 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 ⋮ Colouring Non-sparse Random Intersection Graphs ⋮ On Some Combinatorial Properties of Random Intersection Graphs ⋮ Edge Exchangeable Models for Interaction Networks ⋮ The largest component in critical random intersection graphs ⋮ MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems ⋮ Selected combinatorial problems through the prism of random intersection graphs models ⋮ The number of triangles in random intersection graphs ⋮ A spectral algorithm for finding maximum cliques in dense random intersection graphs ⋮ On the complexity of the herding attack and some related attacks on hash functions ⋮ Connectivity of Poissonian inhomogeneous random multigraphs ⋮ The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs ⋮ Phase transitions for detecting latent geometry in random graphs ⋮ A note on hamiltonicity of uniform random intersection graphs ⋮ Epidemics on Random Graphs with Tunable Clustering ⋮ 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. ⋮ On the isolated vertices and connectivity in random intersection graphs ⋮ Sharp thresholds for Hamiltonicity in random intersection graphs ⋮ Poisson Approximation of the Number of Cliques in Random Intersection Graphs ⋮ A random intersection digraph: indegree and outdegree distributions ⋮ Diameter, connectivity, and phase transition of the uniform random intersection graph ⋮ The degree of a typical vertex in generalized random intersection graph models ⋮ Selected Combinatorial Properties of Random Intersection Graphs ⋮ Expander properties and the cover time of random intersection graphs ⋮ Connectivity of the uniform random intersection graph ⋮ Random intersection graphs with communities
Cites Work
This page was built for publication: Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
