Zero-one laws for graphs with edge probabilities decaying with distance. Part I

DOI10.4064/fm175-3-1zbMath1013.03031arXivmath/9606226OpenAlexW4236465179MaRDI QIDQ4790195

Saharon Shelah

Publication date: 28 January 2003

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9606226

zbMATH Keywords

first-order logicrandom graphzero-one law

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Zero-one laws (60F20) Model theory of finite structures (03C13) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (2)

In the random graph \(G(n,p), p=n^{-a}\): If \(\psi\) has probability \(O(n^{-\varepsilon})\) for every \(\varepsilon >0\) then it has probability \(O(e^{-n^ \varepsilon})\) for some \(\varepsilon >0\) ⋮ Randomness and semigenericity

This page was built for publication: Zero-one laws for graphs with edge probabilities decaying with distance. Part I