Infinitary logics and very sparse random graphs
From MaRDI portal
Recommendations
- Probabilities of Sentences about Very Sparse Random Graphs
- scientific article; zbMATH DE number 1072414
- Monadic second-order properties of very sparse random graphs
- Failure of 0-1 law for sparse random graph in strong logics (Sh1062)
- 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\)
Cites work
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- An extension of 0‐1 laws
- Expected deadlock time in a multiprocessing system
- Infinitary logics and 0-1 laws
- Probabilities of Sentences about Very Sparse Random Graphs
- Random Resource Allocation Graphs and the Probability of Deadlock
- Strongly balanced graphs and random graphs
- Structure and complexity of relational queries
- The first cycles in an evolving graph
Cited in
(8)- On probabilistic elimination of generalized quantifiers
- Randomness and semigenericity
- scientific article; zbMATH DE number 426367 (Why is no real title available?)
- First-Order Definability of Trees and Sparse Random Graphs
- Random sparse unary predicates
- scientific article; zbMATH DE number 1072414 (Why is no real title available?)
- Convergence Laws for Very Sparse Random Structures with Generalized Quantifiers
- Logical properties of random graphs from small addable classes
This page was built for publication: Infinitary logics and very sparse random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4358057)
