The coupling method for inhomogeneous random intersection graphs.

MaRDI QIDQ528984zbMATH OpenFDO

Authors 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, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i2p10

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

threshold functionrandom intersection graphmonotone property

Mathematics Subject Classification ID

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

Abstract: We present new results concerning threshold functions for a wide family of random intersection graphs. To this end we apply the coupling method used for establishing threshold functions for homogeneous random intersection graphs introduced by Karo'nski, Scheinerman, and Singer--Cohen. In the case of inhomogeneous random intersection graphs the method has to be considerably modified and extended. By means of the altered method we are able to establish threshold functions for a general random intersection graph for such properties as $k$-connectivity, matching containment or hamiltonicity. Moreover using the new approach we manage to sharpen the best known results concerning homogeneous random intersection graph.

Recommendations

• Publication:4729111
• Degree distribution of an inhomogeneous random intersection graph
• The degree distribution in random intersection graphs
• On Connectivity and Robustness in Random Intersection Graphs
• On Connectivity in a General Random Intersection Graph
• Sharp threshold functions for random intersection graphs via a coupling method
• Connectivity of inhomogeneous random graphs
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• The vertex degree distribution of random intersection graphs
• A guided tour in random intersection graphs

Cites work

• scientific article; zbMATH DE number 3167451 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• Component evolution in a secure wireless sensor network
• Component evolution in general random intersection graphs
• Degree and clustering coefficient in sparse random intersection graphs
• Degree distribution of an inhomogeneous random intersection graph
• Epidemics on Random Graphs with Tunable Clustering
• Equivalence of a random intersection graph and G (n ,p )
• Large independent sets in general random intersection graphs
• On Random Intersection Graphs: The Subgraph Problem
• Perfect matchings in random intersection graphs
• Poisson approximation of the number of cliques in random intersection graphs
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Sharp threshold functions for random intersection graphs via a coupling method
• The shortest distance in random multi-type intersection graphs

Cited in

(6)

• scientific article; zbMATH DE number 4113676 (Why is no real title available?)
• Strong couplings for static locally tree-like random graphs
• Hamilton cycles in the line graph of a random hypergraph
• A Note on the Conductance of the Binomial Random Intersection Graph
• Poisson approximation of induced subgraph counts in an inhomogeneous random intersection graph model
• Sharp threshold functions for random intersection graphs via a coupling method

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

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