Skip to main content Accessibility help

Relational exchangeability

  • Harry Crane (a1) and Walter Dempsey (a2)


A relationally exchangeable structure is a random combinatorial structure whose law is invariant with respect to relabeling its relations, as opposed to its elements. Historically, exchangeable random set partitions have been the best known examples of relationally exchangeable structures, but the concept now arises more broadly when modeling interaction data in modern network analysis. Aside from exchangeable random partitions, instances of relational exchangeability include edge exchangeable random graphs and hypergraphs, path exchangeable processes, and a range of other network-like structures. We motivate the general theory of relational exchangeability, with special emphasis on the alternative perspective it provides and its benefits in certain applied probability problems. We then prove a de Finetti-type structure theorem for the general class of relationally exchangeable structures.


Corresponding author

*Postal address: Department of Statistics & Biostatistics, Rutgers University, 110 Frelinghuysen Avenue, Piscataway, NJ 08854, USA. Email address: Partially supported by NSF grants CNS-1523785 and CAREER DMS-1554092.
**Postal address: Department of Statistics, Harvard University, One Oxford Street, Cambridge, MA 02138, USA. Email address:


Hide All
[1]Achlioptas, D., Clauset, A., Kempe, D. and Moore, C. (2005). On the bias of traceroute sampling or, power-law degree distributions in regular graphs. In Proc. 37th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, pp. 694703.
[2]Ackerman, N. (2015). Representations of Aut(ℳ)-invariant measures: part 1. Preprint. Available at
[3]Ackerman, N., Freer, C. and Patel, R. (2014) Invariant measures concentrated on countable structures. Preprint. Available at
[4]Ackerman, N., Freer, C., Kruckman, A. and Patel, R. (2017). Properly ergodic structures. Preprint. Available at
[5]Aldous, D. J. (1981). Representations for partially exchangeable arrays of random variables. J. Multivariate Anal. 11, 581598.
[6]Aldous, D. J. (1985). Exchangeability and related topics. In École d’été de Probabilités de Saint-Flour, XIII—1983 (Lecture Notes Math. 1117), Springer, Berlin, pp. 1198.
[7]Austin, T. and Panchenko, D. (2014). A hierarchical version of the de Finetti and Aldous-Hoover representations. Prob. Theory Relat. Fields 159, 809823.
[8]Bickel, P. J. and Chen, A. (2009). A nonparametric view of network models and Newman–Girvan and other modularities. Proc. Nat. Acad. Sci. USA 106, 2106821073.
[9]Cai, D. and Campbell, T. (2015). Edge-exchangeable graphs and sparsity. In NIPS 2015 Workshop on Networks in the Social and Information Sciences.
[10]Cai, D., Campbell, T. and Broderick, T. (2016). Edge-exchangeable graphs and sparsity. Neural Information Processing Systems.
[11]Crane, H. (2016). The ubiquitous Ewens sampling formula. Statist. Sci. 31, 119.
[12]Crane, H. (2018). Combinatorial Lévy processes. Ann. Appl. Prob. 28, 395–339.
[13]Crane, H. and Dempsey, W. (2016). A framework for statistical network modeling. Preprint. Available at
[14]Crane, H. and Dempsey, W. (2018). Edge exchangeable models for interaction networks. J. Amer. Statist. Assoc. 113, 13111326
[15]Crane, H. and Towsner, H. (2018). Relatively exchangeable structures. J. Symbolic Logic 83, 416442.
[16]De Finetti, B. (1937). La prévision: ses lois logiques, ses sources subjectives. Ann. Inst. H. Poincaré 7, 168.
[17]Ewens, W. J. (1972). The sampling theory of selectively neutral alleles. Theoret. Pop. Biol. 3, 87112.
[18]Hodges, W. (1993). Model Theory (Encyclopedia Math. Appl. 42). Cambridge University Press.
[19]Hoover, D. (1979). Relations on probability spaces and arrays of random variables. Preprint. Institute for Advanced Studies, Princeton, NJ.
[20]Kallenberg, O. (2005). Probabilistic Symmetries and Invariance Principles. Springer, New York.
[21]Kingman, J. F. C. (1978). Random partitions in population genetics. Proc. R. Soc. London A 361, 120.
[22]Klimt, B. and Yang, Y. (2004). Introducing the enron corpus. CEAS. In Proc. CEAS 2004 (Mountain View, CA, 2004).
[23]Lovász, L. and Szegedy, B. (2006). Limits of dense graph sequences. J. Combinatorial Theory B 96, 933957.
[24]McCullagh, P. and Yang, J. (2006). Stochastic classification models. In International Congress of Mathematicians. Vol. III, European Mathematical Society, Zürich, pp. 669686.


MSC classification

Related content

Powered by UNSILO

Relational exchangeability

  • Harry Crane (a1) and Walter Dempsey (a2)


Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.