arXiv · 1607.06762
Relational exchangeability
Abstract
A relationally exchangeable structure is a random combinatorial structure whose law is invariant with respect to relabeling its relations, as opposed to its elements. Aside from exchangeable random partitions, examples include edge exchangeable random graphs and hypergraphs, path exchangeable processes, and a range of other network-like structures that arise in statistical applications. We prove a de Finetti-type structure theorem for the general class of relationally exchangeable structures.
Explore related subjects
Keep this discovery
Harry Crane, Walter Dempsey. 2016-07-22. Relational exchangeability. https://doi.org/10.1017/jpr.2019.13
Cite the original work for its findings. Save a collection to share your selection of sources.