Zero-one laws for graphs with edge probabilities decaying with distance. Part I
From MaRDI portal
Publication:4790195
DOI10.4064/fm175-3-1zbMath1013.03031arXivmath/9606226MaRDI QIDQ4790195
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
05C80: Random graphs (graph-theoretic aspects)
60C05: Combinatorial probability
60F20: Zero-one laws
03C13: Model theory of finite structures
03C10: Quantifier elimination, model completeness, and related topics
Related Items
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