The coupling method for inhomogeneous random intersection graphs. (Q528984)
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: The coupling method for inhomogeneous random intersection graphs. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The coupling method for inhomogeneous random intersection graphs. |
scientific article |
Statements
The coupling method for inhomogeneous random intersection graphs. (English)
0 references
18 May 2017
0 references
Summary: We present new results concerning threshold functions for a wide family of random intersection graphs. To this end we improve and generalize the coupling method introduced for random intersection graphs so that it may be used for a wider range of parameters. Using the new approach we are able to tighten the best known results concerning random intersection graphs and establish threshold functions for some monotone properties of inhomogeneous random intersection graphs. Considered properties are: \(k\)-connectivity, matching containment and Hamiltonicity.
0 references
random intersection graph
0 references
threshold function
0 references
monotone property
0 references
0 references
0.89551264
0 references
0.8931895
0 references
0.88924044
0 references
0.8875237
0 references
0.88727576
0 references
0 references
0.8835334
0 references
0.88351405
0 references
0.8811203
0 references
