Zero one laws for graphs with edge probabilities decaying with distance. Part I
Abstract
Let Gn be the random graph on [n]= 1, ...,n with the possible edge i,j having probability being p|i-j|= 1/|i-j|alpha, alpha in (0,1) irrational. We prove that the zero one law (for first order logic) holds. The paper is continued in [Sh:517]
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.