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

DOI10.1016/J.DISC.2011.05.029MaRDI QIDQ2275460zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Connectivity of the uniform random intersection graph
• scientific article; zbMATH DE number 4055665
• Algorithms and Models for the Web-Graph
• On Connectivity in a General Random Intersection Graph
• The degree distribution in random intersection graphs
• On the diameter of a class of random graphs
• On Connectivity and Robustness in Random Intersection Graphs
• On the connectivity of a random interval graph
• The vertex degree distribution of random intersection graphs
• Diameters of random distance graphs

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 1380601 (Why is no real title available?)
• A note on the component structure in random intersection graphs with tunable clustering
• Automata, Languages and Programming
• Component evolution in a secure wireless sensor network
• Component evolution in general random intersection graphs
• Component evolution in random intersection graphs
• Connectivity of the uniform random intersection graph
• Equivalence of a random intersection graph and G (n ,p )
• On Random Intersection Graphs: The Subgraph Problem
• 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
• The Evolution of Random Graphs
• The diameter of sparse random graphs
• The largest component in an inhomogeneous random intersection graph with clustering
• The phase transition in inhomogeneous random graphs
• The vertex degree distribution of random intersection graphs
• Zero–One Laws for Connectivity in Random Key Graphs

Cited in

(17)

• The number of triangles in random intersection graphs
• Degree distribution of an inhomogeneous random intersection graph
• \(k\)-connectivity of uniform \(s\)-intersection 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
• Phase transition in random intersection graphs with communities
• First-Order Model-Checking in Random Graphs and Complex Networks
• Connectivity of Poissonian inhomogeneous random multigraphs
• Perfect matchings in random intersection graphs
• Degree and clustering coefficient in sparse random intersection graphs
• Constructions of independent sets in random intersection graphs
• Random subcube intersection graphs. I: Cliques and covering
• Connectivity of the uniform random intersection graph
• The random connection model on the torus
• Phase transitions for detecting latent geometry in random graphs
• Random intersection graphs with communities
• A new random graph model with self-optimizing nodes: connectivity and diameter

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275460)