DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS

DOI10.1017/jsl.2019.52zbMath1476.03038arXiv1502.01212OpenAlexW2969919292MaRDI QIDQ5207554

Caroline A. Terry, Dhruv Mubayi

Publication date: 10 January 2020

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic enumerationdiscrete metric spaces0-1 laws

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Zero-one laws (60F20) Model theory of finite structures (03C13)

Related Items (5)

Rectilinear approximation and volume estimates for hereditary bodies via [0, 1‐decorated containers] ⋮ The almost sure theory of finite metric spaces ⋮ Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination ⋮ A recent result about random metric spaces explains why all of us have similar learning potential ⋮ DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Almost all triangle-free triple systems are tripartite
• The logic of random regular graphs
• The fine structure of octahedron-free graphs
• Asymptotic probabilities of extension properties and random \(l\)-colourable structures
• Model theoretic properties of the Urysohn sphere
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• A logical approach to asymptotic combinatorics I. First order properties
• The asymptotic number of graphs not containing a fixed color-critical subgraph
• Forbidden induced partial orders
• The number of partial orders of fixed width
• Logical limit laws for minor-closed classes of graphs
• The number of graphs without forbidden subgraphs
• Equilateral triangles in finite metric spaces
• Toward classifying unstable theories
• On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
• Divisibility of countable metric spaces
• Almost all triple systems with independent neighborhoods are semi-bipartite
• Parametrized complexity theory.
• Acyclic orientations of graphs
• On the probability that finite spaces with random distances are metric spaces
• A logical approach to asymptotic combinatorics. II: Monadic second-order properties
• Sufficient conditions for zero-one laws
• A Limit Law of Almost l-partite Graphs
• Turán problems for integer-weighted graphs
• The typical structure of graphs without given excluded subgraphs
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• Asymptotic Enumeration of Partial Orders on a Finite Set
• Probabilities on finite models
• Extremal Graph Problems for Graphs with a Color-Critical Vertex
• Model Theory
• Random ℓ‐colourable structures with a pregeometry
• DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS
• Convergence law for random graphs with specified degree sequence
• The number of K _s,t -free graphs
• Regularity lemmas for stable graphs
• Random graphs with bounded maximum degree: asymptotic structure and a logical limit law

This page was built for publication: DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS