When are random graphs connected

S. Kalikow*, B. Weiss

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

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 languageEnglish
Pages (from-to)257-268
Number of pages12
JournalIsrael Journal of Mathematics
Volume62
Issue number3
DOIs
StatePublished - Oct 1988

Fingerprint

Dive into the research topics of 'When are random graphs connected'. Together they form a unique fingerprint.

Cite this