Skip to main content
Log in

On the Convergence of Probabilities of First-Order Sentences for Recursive Random Graph Models

  • MATHEMATICS
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. Yu. V. Glebskii, D. I. Kogan, M. I. Legon’kii, and V. A. Talanov, Kibernetika 2, 17–26 (1969).

    Google Scholar 

  2. R. Fagin, J. Symbolic Logic 41, 50–58 (1976).

    Article  MathSciNet  Google Scholar 

  3. 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].

  4. L. Libkin, Elements of Finite Model Theory (Springer, Berlin, 2004).

    Book  Google Scholar 

  5. M. E. Zhukovskii and A. M. Raigorodskii, Russ. Math. Surv. 70 (1), 33–81 (2015).

    Article  Google Scholar 

  6. J. H. Spencer, The Strange Logic of Random Graphs (Springer, Berlin, 2001).

    Book  Google Scholar 

  7. B. Bollobás, O. Riordan, J. Spencer, and G. Tusnady, Random Struct. Algorithms 18 (3), 279–290 (2001).

    Article  Google Scholar 

  8. R. Hofstag, Random Graphs and Complex Networks (Cambridge University Press, Cambridge, 2016).

    Google Scholar 

  9. R. T. Smythe and H. M. Mahmoud, Theory Probab. Math. Stat. 51, 1–27 (1995).

    Google Scholar 

  10. A. Ehrenfeucht, Warszawa Fund. Math. 49, 121–149 (1960).

    Google Scholar 

  11. G. L. McColm, Discrete Math. 254 (1–3), 331–347 (2002).

    Article  MathSciNet  Google Scholar 

Download references

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

Authors

Corresponding author

Correspondence to M. E. Zhukovskii.

Additional information

Translated by I. Ruzanova

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064562420050464

Keywords:

Navigation