# Sh:435

• Shelah, S., & Łuczak, T. (1995). Convergence in homogeneous random graphs. Random Structures Algorithms, 6(4), 371–391.
• Abstract:
For a sequence \bar{p}=(p(1),p(2),\dots) let G(n,\bar{p}) denote the random graph with vertex set \{1,2,\dots,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,\bar{p}), can be affected by the behaviour of \bar{p} and the strength of the language we use.
• published version (21p)
Bib entry
@article{Sh:435,
author = {Shelah, Saharon and {\L}uczak, Tomasz},
title = {{Convergence in homogeneous random graphs}},
journal = {Random Structures Algorithms},
fjournal = {Random Structures \& Algorithms},
volume = {6},
number = {4},
year = {1995},
pages = {371--391},
issn = {1042-9832},
doi = {10.1002/rsa.3240060402},
mrclass = {05C80},
mrnumber = {1368840},
mrreviewer = {J. Spencer},
doi = {10.1002/rsa.3240060402},
note = {\href{https://arxiv.org/abs/math/9501221}{arXiv: math/9501221}},
arxiv_number = {math/9501221}
}