On the convergence of probabilities of the random graphs' properties expressed by first-order formulae with a bounded quantifier depth
classification
🧮 math.CO
keywords
boundeddepthfirst-orderformulaeprobabilitiespropertiesquantifierrandom
read the original abstract
An asymptotic behavior of the probabilities of first-order properties of Erdos-Renyi random graph G(N,p), lnp=-alnN, is studied in the article. We prove the covergence law for formulae with quantifier depth bounded by k when a=1/(k-2).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.