Relatively exchangeable structures

DOI10.1017/JSL.2017.61zbMATH Open1496.03160arXiv1509.06733OpenAlexW2963775311WikidataQ129429008 ScholiaQ129429008MaRDI QIDQ4579800FDOQ4579800

Authors: Harry Crane, Henry Towsner 

Publication date: 10 August 2018

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

Abstract: We study random relational structures that are emph{relatively exchangeable}---that is, whose distributions are invariant under the automorphisms of a reference structure $mathfrakM$. When $mathfrakM$ has {em trivial definable closure}, every relatively exchangeable structure satisfies a general Aldous--Hoover-type representation. If $mathfrakM$ satisfies the stronger properties of {em ultrahomogeneity} and {em $n$-disjoint amalgamation property} ($n$-DAP) for every $ngeq1$, then relatively exchangeable structures have a more precise description whereby each component depends locally on $mathfrakM$.

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

Recommendations

• Relative exchangeability with equivalence relations
• Relational exchangeability
• More uses of exchangeability: representations of complex random structures
• On random relational structures
• A hierarchical version of the de Finetti and Aldous-Hoover representations

zbMATH Keywords

exchangeabilityamalgamationAldous-Hoover theoremrelational structureFraïsse limit

Mathematics Subject Classification ID

Basic properties of first-order languages and structures (03C07) Exchangeability for stochastic processes (60G09) Applications of model theory (03C98)

Cites Work

• Limits of dense graph sequences
• Representations for partially exchangeable arrays of random variables
• Graph limits and exchangeable random graphs
• INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES
• Random Fragmentation and Coagulation Processes
• Title not available (Why is that?)
• The cut-and-paste process
• A hierarchical version of the de Finetti and Aldous-Hoover representations
• Exchangeable graph-valued Feller processes
• Dynamic random networks and their graph limits
• Probabilistic Symmetries and Invariance Principles
• A survey of homogeneous structures
• Uncountable graphs and invariant measures on the set of universal countable graphs
• A classification of orbits admitting a unique invariant measure
• Random partitions in population genetics
• Invariant measures via inverse limits of finite structures
• Disjoint \(n\)-amalgamation and pseudofinite countably categorical theories

Cited In (12)

• Invariant measures on products and on the space of linear orders
• Relational exchangeability
• Bayesian consensus clustering in multiplex networks
• Exchangeable trait allocations
• More uses of exchangeability: representations of complex random structures
• A statistical framework for modern network science
• A hidden Markov model for latent temporal clustering with application to ideological alignment in the U.S. Supreme Court
• Relative exchangeability with equivalence relations
• Non-representative sampled networks: estimation of network structural properties by weighting
• Exchangeable graph-valued Feller processes
• A generalization of hierarchical exchangeability on trees to directed acyclic graphs
• A structure theorem of exchangeable and categorical theories

This page was built for publication: Relatively exchangeable structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579800)