When are random graphs connected (Q1119947): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Steven Arthur Kalikow / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Benjamin Weiss / rank | |||
Normal rank |
Revision as of 05:55, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | When are random graphs connected |
scientific article |
Statements
When are random graphs connected (English)
0 references
1988
0 references
A random graph on the positive integers is formed by independently including each possible edge \(\{\) i,j\(\}\) with a probability \(p_{ij}\). Two models are considered, one with \(p_{ij}\) depending on \(| i- j|\) only, and one with \(p_{ij}=\max \{1,\lambda /\max \{i,j\}\}\) for some \(\lambda >0\). Necessary and sufficient conditions on the \(p_{ij}\) are given that imply that the random graph is connected with probability 1.
0 references
infinite random graphs
0 references
connectivity
0 references