The coupling method for inhomogeneous random intersection graphs.

zbMath1361.05118arXiv1301.0466MaRDI QIDQ528984

Katarzyna Rybarczyk

Publication date: 18 May 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

threshold functionrandom intersection graphmonotone property

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

A Note on the Conductance of the Binomial Random Intersection Graph ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Degree distribution of an inhomogeneous random intersection graph
• Sharp threshold functions for random intersection graphs via a coupling method
• Large independent sets in general random intersection graphs
• Degree and clustering coefficient in sparse random intersection graphs
• Perfect matchings in random intersection graphs
• Component Evolution in General Random Intersection Graphs
• Equivalence of a random intersection graph and G (n ,p )
• The shortest distance in random multi-type intersection graphs
• Epidemics on Random Graphs with Tunable Clustering
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• 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
• Component evolution in a secure wireless sensor network

This page was built for publication: The coupling method for inhomogeneous random intersection graphs.