Built on

Random partitions in population genetics
J. F. C. Kingman · 1978
Earlier work this paper cites.
Limits of dense graph sequences
L. Lovász and B. Szegedy · 2006
Earlier work this paper cites.

Similar

Edge exchangeable models for network data
Original
H. Crane and W. Dempsey · 2015
Cited alongside, same era.
La prévision: ses lois logiques, ses sources subjectives
B. de Finetti
Cited in the paper.

Then

A framework for statistical network modeling
Original
H. Crane and W. Dempsey · 2015
Later among the works it cites.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

Reading the bibliography…

2016

Relational exchangeability

Crane, Harry, Dempsey, Walter

Understand

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.