Exchangeable random arrays
نویسنده
چکیده
These notes were written to accompany a sequence of workshop lectures at the Indian Institute of Science, Bangalore in January 2013. My lectures had two purposes. The first was to introduce some of the main ideas of exchangeability theory at a level suitable for graduate students (assuming familiarity with measure-theoretic probability). The second was to show the key rôle exchangeability has played in recent work on mean-field spin glass models, particularly Panchenko’s proof of a version of the Ultrametricity Conjecture. To my taste this may be the single most exciting reason to learn about exchangeability. Of course, these dual purposes constrained the choice of material: I had to focus on those varieties of exchangeability that arise in spin glass theory. Also, the spin glass results were far too complicated to cover in depth, so in those lecture I omitted almost all detail, and the notes are the same. A much more complete treatment of similar material will appear in Panchenko’s monograph [Panar]. These notes are certainly not intended to compete with that, but offer a more basic overview that may benefit the newcomer to the field.
منابع مشابه
On the Dovbysh-sudakov Representation Result
We present a detailed proof of the Dovbysh-Sudakov representation for symmetric positive definite weakly exchangeable infinite random arrays, called Gram-de Finetti matrices, which is based on the representation result of Aldous and Hoover for arbitrary (not necessarily positive definite) symmetric weakly exchangeable arrays.
متن کاملRandom function priors for exchangeable arrays with applications to graphs and relational data
A fundamental problem in the analysis of structured relational data like graphs, networks, databases, and matrices is to extract a summary of the common structure underlying relations between individual entities. Relational data are typically encoded in the form of arrays; invariance to the ordering of rows and columns corresponds to exchangeable arrays. Results in probability theory due to Ald...
متن کاملGraph Limits and Exchangeable Random Graphs
We develop a clear connection between deFinetti’s theorem for exchangeable arrays (work of Aldous–Hoover–Kallenberg) and the emerging area of graph limits (work of Lovász and many coauthors). Along the way, we translate the graph theory into more classical prob-
متن کاملExchangeable Markov Processes on Graphs: Feller Case
The transition law of every exchangeable Feller process on the space of countable graphs is determined by a σ-finite measure on the space of {0, 1} × {0, 1}-valued arrays. In discrete-time, this characterization amounts to a construction from an independent, identically distributed sequence of exchangeable random functions. In continuous-time, the behavior is enriched by a Lévy–Itô-type decompo...
متن کاملSome highlights from the theory of multivariate symmetries
We explain how invariance in distribution under separate or joint contractions, permutations, or rotations can be defined in a natural way for d-dimensional arrays of random variables. In each case, the distribution is characterized by a general representation formula, often easy to state but surprisingly complicated to prove. Comparing the representations in the first two cases, one sees that ...
متن کاملExchangeability and continuum limits of discrete random structures
Exchangeable representations of complex random structures are useful in several ways, in particular providing a moderately general way to derive continuum limits of discrete random structures. I shall describe an old example (continuum random trees) and a more recent example (dense graph limits). Thinking this way about road routes suggests challenging new problems in the plane. Mathematics Sub...
متن کامل