Abstract
We study first-order zero–one law and the first-order convergence law for two recursive random graph models, namely, the uniform and preferential attachment models. In the uniform attachment model, a new vertex with \(m\) edges chosen uniformly is added at every moment, while, in the preferential attachment model, the distribution of second ends of these edges is not uniform, but rather the probabilities are proportional to the degrees of the respective vertices.
Similar content being viewed by others
REFERENCES
Yu. V. Glebskii, D. I. Kogan, M. I. Legon’kii, and V. A. Talanov, Kibernetika 2, 17–26 (1969).
R. Fagin, J. Symbolic Logic 41, 50–58 (1976).
N. K. Vereshchagin and A. Shen’, Lectures on Mathematical Logic and Theory of Algorithms, Part 2: Languages and Calculi, 4th ed. (MNTsMO, Moscow, 2012) [in Russian].
L. Libkin, Elements of Finite Model Theory (Springer, Berlin, 2004).
M. E. Zhukovskii and A. M. Raigorodskii, Russ. Math. Surv. 70 (1), 33–81 (2015).
J. H. Spencer, The Strange Logic of Random Graphs (Springer, Berlin, 2001).
B. Bollobás, O. Riordan, J. Spencer, and G. Tusnady, Random Struct. Algorithms 18 (3), 279–290 (2001).
R. Hofstag, Random Graphs and Complex Networks (Cambridge University Press, Cambridge, 2016).
R. T. Smythe and H. M. Mahmoud, Theory Probab. Math. Stat. 51, 1–27 (1995).
A. Ehrenfeucht, Warszawa Fund. Math. 49, 121–149 (1960).
G. L. McColm, Discrete Math. 254 (1–3), 331–347 (2002).
Funding
Zhukovskii acknowledges the support of the Ministry of Science and Higher Education of the Russian Federation, Goszadanie no. 075-00337-20-03, project no. 0714-2020-0005. Zhukovskii proved Theorem 2 and derived Theorem 3 from Lemma 1. The part of the study made by Malyshkin was funded by the Russian Foundation for Basic Research, project no. 19-31-60021. Malyshkin proved Theorem 4 and Lemma 1.
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated by I. Ruzanova
Rights and permissions
About this article
Cite this article
Zhukovskii, M.E., Malyshkin, Y.A. On the Convergence of Probabilities of First-Order Sentences for Recursive Random Graph Models. Dokl. Math. 102, 384–386 (2020). https://doi.org/10.1134/S1064562420050464
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064562420050464