On the isolated vertices and connectivity in random intersection graphs (Q541188): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:34, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the isolated vertices and connectivity in random intersection graphs |
scientific article |
Statements
On the isolated vertices and connectivity in random intersection graphs (English)
0 references
6 June 2011
0 references
Summary: We study isolated vertices and connectivity in the random intersection graph \(G ( n,m,p)\) . A Poisson convergence for the number of isolated vertices is determined at the threshold for absence of isolated vertices, which is equivalent to the threshold for connectivity. When \(m = \lfloor n^a \rfloor \) and \(\alpha > 6\) , we give the asymptotic probability of connectivity at the threshold for connectivity. Analogous results are well known in Erdős-Rényi random graphs.
0 references
