When are random graphs connected (Q1119947)

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.