More Uses of Exchangeability: Representations of Complex Random Structures
classification
🧮 math.PR
keywords
randomusescomplexexchangeabilitygraphslimitsrepresentationsstructures
read the original abstract
We review old and new uses of exchangeability, emphasizing the general theme of exchangeable representations of complex random structures. Illustrations of this theme include processes of stochastic coalescence and fragmentation; continuum random trees; second-order limits of distances in random graphs; isometry classes of metric spaces with probability measures; limits of dense random graphs; and more sophisticated uses in finitary combinatorics.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.