Abstract
AbstractFor 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.
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
