Sharp threshold functions for the random intersection graph via coupling method?

Abstract

We will present a new method, which enables us to find threshold functions for many properties in random intersection graphs. This method will be used to establish sharp threshold functions in random intersection graphs for k-connectivity, perfect matching containment and Hamilton cycle containment.

Cited by in corpus (10)

• Connectivity in Secure Wireless Sensor Networks under Transmission Constraints
• On $k$-connectivity and minimum vertex degree in random $s$-intersection graphs
• Probabilistic key predistribution in mobile networks resilient to node-capture attacks
• Designing Securely and Reliably Connected Wireless Sensor Networks
• Exact Analysis of k-Connectivity in Secure Sensor Networks with Unreliable Links
• Monotone Increasing Properties and Their Phase Transitions in Uniform Random Intersection Graphs
• On connectivity in a general random intersection graph
• k-Connectivity of Random Key Graphs
• Threshold Functions in Random s-Intersection Graphs
• Secure Connectivity of Wireless Sensor Networks Under Key Predistribution with on/off Channels