TY - JOUR
T1 - Convergence in homogeneous random graphs
AU - Łuczak, Tomasz
AU - Shelah, Saharon
PY - 1995/7
Y1 - 1995/7
N2 - For a sequence p̄ = (p(1), p(2), ‥ .), let G(n, p̄) denote the random graph with vertex set {1, 2, ‥ ., n} in which two vertices i, j are adjacent with probability p(|i − j|), independently for each pair. We study how the convergence of probabilities of first order properties of G(n, p̄), can be affected by the behaviour of p̄ and the strength of the language we use.
AB - For a sequence p̄ = (p(1), p(2), ‥ .), let G(n, p̄) denote the random graph with vertex set {1, 2, ‥ ., n} in which two vertices i, j are adjacent with probability p(|i − j|), independently for each pair. We study how the convergence of probabilities of first order properties of G(n, p̄), can be affected by the behaviour of p̄ and the strength of the language we use.
UR - http://www.scopus.com/inward/record.url?scp=84990642076&partnerID=8YFLogxK
U2 - 10.1002/rsa.3240060402
DO - 10.1002/rsa.3240060402
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84990642076
SN - 1042-9832
VL - 6
SP - 371
EP - 391
JO - Random Structures and Algorithms
JF - Random Structures and Algorithms
IS - 4
ER -