Indexed metadata
Sharp Threshold Functions for Random Intersection Graphs via a Coupling Method
Katarzyna Rybarczyk
Source abstract
We present a new method which enables us to find threshold functions for many properties in random intersection graphs. This method is used to establish sharp threshold functions in random intersection graphs for –connectivity, perfect matching containment and Hamilton cycle containment.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.