On the convergence of probabilities of first-order sentences for recursive random graph models

DOI10.1134/S1064562420050464zbMath1478.05139OpenAlexW3120592205MaRDI QIDQ2243792

Yanyan Li

Publication date: 11 November 2021

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562420050464

zbMATH Keywords

first-order logiczero-one lawspreferential attachmentrecursive random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Model theory of finite structures (03C13) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Elements of finite model theory.
• MSO zero-one laws on random labelled acyclic graphs
• The degree sequence of a scale-free random graph process
• Probabilities on finite models
• Random graphs: models and asymptotic characteristics
• The strange logic of random graphs

This page was built for publication: On the convergence of probabilities of first-order sentences for recursive random graph models