A note on the component structure in random intersection graphs with tunable clustering (Q1010663)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5540872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the component structure in random intersection graphs with tunable clustering |
scientific article; zbMATH DE number 5540872 |
Statements
A note on the component structure in random intersection graphs with tunable clustering (English)
0 references
7 April 2009
0 references
Summary: We study the component structure in random intersection graphs with tunable clustering, and show that the average degree works as a threshold for a phase transition for the size of the largest component. That is, if the expected degree is less than one, the size of the largest component is a.a.s.\ of logarithmic order, but if the average degree is greater than one, a.a.s.\ a single large component of linear order emerges, and the size of the second largest component is at most of logarithmic order.
0 references
component structure
0 references
random intersection graphs
0 references
tunable clustering
0 references
phase transition
0 references
largest component
0 references
logarithmic order
0 references
0.8283261656761169
0 references
0.8191885352134705
0 references
0.8132461905479431
0 references
0.8042353391647339
0 references
0.7973569631576538
0 references
