The Aldous$\unicode{x2013}$Hoover Theorem in Categorical Probability
arXiv:2411.12840 · doi:10.2140/astat.2025.16.131
Abstract
The Aldous-Hoover Theorem concerns an infinite matrix of random variables whose distribution is invariant under finite permutations of rows and columns. It states that, up to equality in distribution, each random variable in the matrix can be expressed as a function only depending on four key variables: one common to the entire matrix, one that encodes information about its row, one that encodes information about its column, and a fourth one specific to the matrix entry. We state and prove the theorem within a category-theoretic approach to probability, namely the theory of Markov categories. This makes the proof more transparent and intuitive when compared to measure-theoretic ones. A key role is played by a newly identified categorical property, the Cauchy--Schwarz axiom, which also facilitates a new synthetic de Finetti Theorem. We further provide a variant of our proof using the ordered Markov property and the d-separation criterion, both generalized from Bayesian networks to Markov categories. We expect that this approach will facilitate a systematic development of more complex results in the future, such as categorical approaches to hierarchical exchangeability.
39 pages, v2: minor changes per referees' suggestions
References in corpus (11)
- A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
- Disintegration and Bayesian Inversion via String Diagrams
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- Representable Markov Categories and Comparison of Statistical Experiments in Categorical Probability
- Infinite products and zero-one laws in categorical probability
- Free gs-monoidal categories and free Markov categories
- A category-theoretic proof of the ergodic decomposition theorem
- Dilations and information flow axioms in categorical probability
- Markov Categories and Entropy
- Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets
- Hidden Markov Models and the Bayes Filter in Categorical Probability