More Uses of Exchangeability: Representations of Complex Random Structures

2009/09/24 by David J. Aldous, Aldous, David J.
Mathematics · #60C05 #60G09 #FOS: Mathematics #Probability (math.PR) #math.PR #msc:60C05 #msc:60G09

paper · pdf · doi:10.48550/arxiv.0909.4339

Final version, to appear in "Probability and Mathematical Genetics: Papers in Honour of Sir John Kingman". Cambridge University Press, 2010. 31 pages

arxiv created 2010/02/21 · arxiv updated 2010/02/26

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.

Related

• Edge-exchangeable graphs and sparsity
• Graph limits and exchangeable random graphs
• The Class of Random Graphs Arising from Exchangeable Random Measures
• On Exchangeability in Network Models
• Restricted exchangeable partitions and embedding of associated hierarchies in continuum random trees