Sharp threshold functions for random intersection graphs via a coupling method (Q625409)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sharp threshold functions for random intersection graphs via a coupling method |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sharp threshold functions for random intersection graphs via a coupling method |
scientific article |
Statements
Sharp threshold functions for random intersection graphs via a coupling method (English)
0 references
17 February 2011
0 references
Summary: 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 \(k\)-connectivity, perfect matching containment and Hamilton cycle containment.
0 references
random intersection graphs
0 references
threshold functions
0 references
connectivity
0 references
Hamilton cycle
0 references
perfect matching
0 references
coupling
0 references
0.9521000981330872
0 references
0.9214102625846864
0 references
0.8730700612068176
0 references
0.8194378018379211
0 references
0.8162732720375061
0 references
