Abstract
Several results concerning the connectivity of infinite random graphs are considered. A necessary sufficient condition for a zero-one law to hold is given when the edges are chosen independently. Some specific examples are treated including one where the vertex set is N and the probability that an edge joining i to j is present depends only on |i-j|.
| Original language | English |
|---|---|
| Pages (from-to) | 257-268 |
| Number of pages | 12 |
| Journal | Israel Journal of Mathematics |
| Volume | 62 |
| Issue number | 3 |
| DOIs | |
| State | Published - Oct 1988 |