Zero-One Laws for Sparse Random Graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Intersection Theorems for Systems of Sets
- Minimal models of theories of one function symbol
- On random models of finite power and monadic logic
- Probabilities on finite models
- Threshold functions
Cited in
(96)- On limit points of spectra of first-order sentences with quantifier depth 4
- 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\)
- Emergence of extended states at zero in the spectrum of sparse random graphs
- On limit points of spectra of the random graph first-order properties
- Bounded quantifier depth spectra for random graphs
- Determined theories and limit laws
- Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination
- When does the zero-one k-law fail?
- On the zero-one k-law extensions
- The complexity of random ordered structures
- Extension of the zero-one \(k\)-law
- Zero-one \(k\)-law
- Infinitary logics and 0-1 laws
- Random graphs: models and asymptotic characteristics
- Spectra of short monadic sentences about sparse random graphs
- \(\gamma\)-variable first-order logic of uniform attachment random graphs
- Zero-one laws for sentences with \(k\) variables
- The logic of random regular graphs
- Bounded quantifier depth spectrum for random uniform hypergraphs
- On the validity of 0-1 law for shallow first order properties of very sparse random graphs
- The Ehrenfeucht-Fraïssé method and the planted clique conjecture
- Finite-model theory -- A personal perspective
- MSO 0-1 law for recursive random trees
- The strange logic of random graphs
- Threshold spectra via the Ehrenfeucht game
- Infinite spectra in the first order theory of graphs
- Counting extensions revisited
- On the spectra of first-order language properties for random graphs
- Continuous phase transitions on Galton–Watson trees
- Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations
- Logical limit laws for minor-closed classes of graphs
- Existential monadic second order convergence law fails on sparse random graphs
- Strictly balanced uniform hypergraphs and generalizations of zero-one law
- Random expansions of trees with bounded height
- Keisler's order is not simple (and simple theories may not be either)
- Zero-one laws for random \(k\)-partite graphs
- A graph property not satisfying a ``zero-one law
- \( \gamma \)-variable first-order logic of preferential attachment random graphs
- The theories of Baldwin-Shi hypergraphs and their atomic models
- MSO zero-one laws on random labelled acyclic graphs
- On the zero-one 4-law for the Erdős-Rényi random graphs
- Zero-one laws for random distance graphs with vertices in \(\{0,1\}^n\)
- Monadic second-order properties of very sparse random graphs
- A logical limit law for \(231\)-avoiding permutations
- Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\)
- Stable generic structures
- On the relative asymptotic expressivity of inference frameworks
- Vapnik-Chervonenkis density in some theories without the independence property. I
- Logical limit laws for Mallows random permutations
- Ab initio generic structures which are superstable but not -stable
- Zero-one laws for binary random fields
- On the 4-spectrum of first-order properties of random graphs
- Universal zero-one k-law
- scientific article; zbMATH DE number 887782 (Why is no real title available?)
- Estimation of the number of maximal extensions in a random graph
- Modular statistics for subgraph counts in sparse random graphs
- The metamathematics of random graphs
- Infinite spectra of first-order properties for random hypergraphs
- Maximum number of symmetric extensions in random graphs
- Short monadic second order sentences about sparse random graphs
- Asymptotic elimination of partially continuous aggregation functions in directed graphical models
- Random expansions of finite structures with bounded degree
- Query evaluation on a database given by a random graph
- The first order convergence law fails for random perfect graphs
- Expansions of geometries
- Counting extensions
- Limit points of spectra for first-order properties of random hypergraphs
- On a sequence of random distance graphs subject to the zero-one law
- Zero-One Laws for Connectivity in Inhomogeneous Random Key Graphs
- Logical convergence laws via stochastic approximation and Markov processes
- Random graph orders do not satisfy a 0–1 law
- First-order properties of bounded quantifier depth of very sparse random graphs
- Convergence laws for expansions of linear preorders
- Universal elements and the complexity of certain classes of infinite graphs
- A zero‐one law for a random subset
- A convergence law for continuous logic and continuous structures with finite domains
- Undecidable statements and random graphs
- Spectrum of FO logic with quantifier depth 4 is finite
- First order sentences about random graphs: small number of alternations
- Quantifier alternation in first-order formulas with infinite spectra
- scientific article; zbMATH DE number 987639 (Why is no real title available?)
- First-order and monadic properties of highly sparse random graphs
- Evolving Shelah‐Spencer graphs
- First-order zero-one law for the uniform model of the random graph
- Zero-one laws for graphs with edge probabilities decaying with distance. Part I
- A simpler axiomatization of the Shelah-Spencer almost sure theories
- Zero-one laws for random graphs with vertices in a Boolean cube
- Disproof of the zero-one law for existential monadic properties of a sparse binomial random graph
- Quasi-Random Set Systems
- Randomness and semigenericity
- Probabilities of Sentences about Very Sparse Random Graphs
- Zero-one laws for \(k\)-variable first-order logic of sparse random graphs
- Convergence in homogeneous random graphs
- First order complexity of finite random structures
- The first order theory of \(G(n, c/n)\)
- First order distinguishability of sparse random graphs
This page was built for publication: Zero-One Laws for Sparse Random Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3791190)
