Universal Zero-One $k$--Law
Aleksandr Matushkin

TL;DR
This paper investigates the probabilities of first-order properties in random graphs, establishing explicit intervals where the Zero-One $k$-Law applies, especially near rational points, and analyzing the asymptotic behavior of these intervals.
Contribution
It provides explicit intervals for the Zero-One $k$-Law near rational points and characterizes their asymptotic size relative to rational numbers.
Findings
Identified explicit intervals where Zero-One $k$-Law holds near rational points.
Proved asymptotic behavior of interval lengths related to rational numbers with numerator ≤ 2.
Established the relationship between interval size and rational points for large n.
Abstract
In this paper the limit probabilities of first-order properties are studied. The random graph {\it obeys Zero-One -Law} if for each first-order property with quantifier depth not greater than its probability tends to 0 or tends to 1. We found an explicit interval to the left of any rational point on which the Zero-One -Law holds. We also proved, that if is a rational number with numerator not greater than 2, then logarithm of our interval's length has the same asymptotics up to a constant factor (when ) as logarithm of the biggest interval with right end at on which Zero-One -Law holds.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Algorithms and Data Compression · Advanced Topology and Set Theory
