Asymptotic probabilities of extension properties and random l-colourable structures
From MaRDI portal
Publication:764265
Abstract: We consider a set of {em finite} structures such that all members of have the same universe, the cardinality of which approaches as . Each structure in may have a nontrivial underlying pregeometry and on each we consider a probability measure, either the uniform measure, or what we call the {em dimension conditional measure}. The main questions are: What conditions imply that for every extension axiom , compatible with the defining properties of , the probability that is true in a member of approaches 1 as ? And what conditions imply that this is not the case, possibly in the strong sense that the mentioned probability approaches 0 for some ? If each is the set of structures with universe , in a fixed relational language, in which certain "forbidden" structures cannot be weakly embedded and has the disjoint amalgamation property, then there is a condition (concerning the set of forbidden structures) which, if we consider the uniform measure, gives a dichotomy; i.e. the condition holds if and only if the answer to the first question is `yes'. In general, we do not obtain a dichotomy, but we do obtain a condition guaranteeing that the answer is `yes' for the first question, as well as a condition guaranteeing that the answer is `no'; and we give examples showing that in the gap between these conditions the answer may be either `yes' or `no'. This analysis is made for both the uniform measure and for the dimension conditional measure. The later measure has closer relation to random generation of structures and is more "generous" with respect to satisfiability of extension axioms.
Recommendations
- Random \(\ell\)-colourable structures with a pregeometry
- A logical approach to asymptotic combinatorics. II: Monadic second-order properties
- A logical approach to asymptotic combinatorics I. First order properties
- A geometric zero-one law
- On 0, 1-laws and asymptotics of definable sets in geometric Fraïssé classes
Cites work
- scientific article; zbMATH DE number 3813622 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 125198 (Why is no real title available?)
- scientific article; zbMATH DE number 3487492 (Why is no real title available?)
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- scientific article; zbMATH DE number 1557173 (Why is no real title available?)
- scientific article; zbMATH DE number 3014822 (Why is no real title available?)
- scientific article; zbMATH DE number 1912564 (Why is no real title available?)
- scientific article; zbMATH DE number 887782 (Why is no real title available?)
- scientific article; zbMATH DE number 3286662 (Why is no real title available?)
- 25 pretty graph colouring problems
- Approximation and Online Algorithms
- Asymptotic enumeration, global structure, and constrained evolution
- Combinatorial theory.
- Countable homogeneous relational structures and ℵ0-categorical theories
- Deux ou trois choses que je sais de Ln
- K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
- On first-order sentences without finite models
- Paths in graphs
- Probabilities on finite models
- Random I‐colorable graphs
- Sufficient conditions for labelled 0-1 laws
- The asymptotic number of graphs not containing a fixed color-critical subgraph
- The fine structure of octahedron-free graphs
- The finite submodel property and \(\omega\)-categorical expansions of pregeometries
- The structure of almost all graphs in a hereditary property
- The typical structure of graphs without given excluded subgraphs
- Upper and lower bounds for first order expressibility
- \(\aleph_0\)-categorical structures with a predimension
Cited in
(8)- A limit law of almost \(l\)-partite graphs
- scientific article; zbMATH DE number 2187692 (Why is no real title available?)
- On sets with rank one in simple homogeneous structures
- Discrete metric spaces: structure, enumeration, and 0-1 laws
- Simple structures axiomatized by almost sure theories
- Structure and enumeration theorems for hereditary properties in finite relational languages
- Random \(\ell\)-colourable structures with a pregeometry
- Limit laws and automorphism groups of random nonrigid structures
This page was built for publication: Asymptotic probabilities of extension properties and random \(l\)-colourable structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764265)