Diameter, connectivity, and phase transition of the uniform random intersection graph

DOI10.1016/J.DISC.2011.05.029zbMath1223.05283OpenAlexW2063090892MaRDI QIDQ2275460

Katarzyna Rybarczyk

Publication date: 9 August 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.05.029

zbMATH Keywords

phase transitiondiameterconnectivityuniform random intersection graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Connectivity (05C40)

Related Items (14)

Random subcube intersection graphs. I: Cliques and covering ⋮ Constructions of independent sets in random intersection graphs ⋮ Degree distribution of an inhomogeneous random intersection graph ⋮ \(k\)-connectivity of uniform \(s\)-intersection graphs ⋮ Phase transition in random intersection graphs with communities ⋮ The number of triangles in random intersection graphs ⋮ Connectivity of Poissonian inhomogeneous random multigraphs ⋮ Perfect matchings in random intersection graphs ⋮ Degree and clustering coefficient in sparse random intersection graphs ⋮ Phase transitions for detecting latent geometry in random graphs ⋮ Zero-one law for connectivity in superposition of random key graphs on random geometric graphs ⋮ Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints ⋮ First-Order Model-Checking in Random Graphs and Complex Networks ⋮ Random intersection graphs with communities

Cites Work

• Unnamed Item
• Unnamed Item
• Component evolution in random intersection graphs
• The largest component in an inhomogeneous random intersection graph with clustering
• A note on the component structure in random intersection graphs with tunable clustering
• Connectivity of the uniform random intersection graph
• Equivalence of a random intersection graph and G (n ,p )
• The Evolution of Random Graphs
• On Random Intersection Graphs: The Subgraph Problem
• The vertex degree distribution of random intersection graphs
• Poisson Approximation of the Number of Cliques in Random Intersection Graphs
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Component evolution in a secure wireless sensor network
• Zero–One Laws for Connectivity in Random Key Graphs
• The phase transition in inhomogeneous random graphs
• Component Evolution in General Random Intersection Graphs
• Automata, Languages and Programming
• The diameter of sparse random graphs

This page was built for publication: Diameter, connectivity, and phase transition of the uniform random intersection graph