On the isolated vertices and connectivity in random intersection graphs (Q541188): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 5 users not shown) | |||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C80 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C40 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 5904372 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58655899 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966248090 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Random Intersection Graphs: The Subgraph Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2743189 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Connectivity of the uniform random intersection graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3286850 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The vertex degree distribution of random intersection graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Component evolution in random intersection graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Degree distributions in general random intersection graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the binary expansion of a random integer / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4779128 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:52, 4 July 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
0 references
