Sharp threshold functions for random intersection graphs via a coupling method
From MaRDI portal
Publication:625409
zbMath1229.05250arXiv0910.0749MaRDI QIDQ625409
Publication date: 17 February 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.0749
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (max. 100)
The largest component in critical random intersection graphs ⋮ On the complexity of the herding attack and some related attacks on hash functions ⋮ Perfect matchings in random intersection graphs ⋮ Phase transitions for detecting latent geometry in random graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints ⋮ The coupling method for inhomogeneous random intersection graphs. ⋮ Size of the largest component in a critical graph
This page was built for publication: Sharp threshold functions for random intersection graphs via a coupling method