De Finetti’s classical result of  identifying the law of an exchangeable family of random variables as a mixture of i.i.d. laws was extended to structure theorems for more complex notions of exchangeability by Aldous [1, 2, 3], Hoover [41, 42], Kallenberg  and Kingman . On the other hand, such exchangeable laws were first related to questions from combinatorics in an independent analysis by Fremlin and Talagrand , and again more recently in Tao , where they appear as a natural proxy for the ‘leading order statistics’ of colourings of large graphs or hypergraphs. Moreover, this relation appears implicitly in the study of various more bespoke formalisms for handling ‘limit objects’ of sequences of dense graphs or hypergraphs in a number of recent works, including Lovász and Szegedy , Borgs, Chayes, Lovász, Sós, Szegedy and Vesztergombi , Elek and Szegedy  and Razborov [54, 55]. However, the connection between these works and the earlier probabilistic structural results seems to have gone largely unappreciated.
In this survey we recall the basic results of the theory of exchangeable laws, and then explain the probabilistic versions of various interesting questions from graph and hypergraph theory that their connection motivates (particularly extremal questions on the testability of properties for graphs and hypergraphs).
We also locate the notions of exchangeability of interest to us in the context of other classes of probability measures subject to various symmetries, in particular contrasting the methods employed to analyze exchangeable laws with related structural results in ergodic theory, particular the Furstenberg-Zimmer structure theorem for probability-preserving ℤ-systems, which underpins Furstenberg’s ergodic-theoretic proof of Szemerédi’s Theorem.
The forthcoming paper  will make a much more elaborate appeal to the link between exchangeable laws and dense (directed) hypergraphs to establish various results in property testing.
 D. J. Aldous. Representations for partially exchangeable arrays of random variables. J. Multivariate Anal., 11(4):581–598, 1981.
Mathematical Reviews (MathSciNet): MR637937
 D. J. Aldous. On exchangeability and conditional independence. In Exchangeability in probability and statistics (Rome, 1981), pages 165–170. North-Holland, Amsterdam, 1982.
Mathematical Reviews (MathSciNet): MR675972
 D. J. Aldous. Exchangeability and related topics. In École d’été de probabilités de Saint-Flour, XIII—1983, volume 1117 of Lecture Notes in Math., pages 1–198. Springer, Berlin, 1985.
Mathematical Reviews (MathSciNet): MR883646
 D. J. Aldous and R. Lyons. Processes on Unimodular Random Networks. Electronic J. Probab., 12:1454–1508, 2007.
 D. J. Aldous and J. M. Steele. The objective method: probabilistic combinatorial optimization and local weak convergence. In H. Kesten, editor, Probability on Discrete Structures, volume 110 of Enyclopaedia Math. Sci., pages 1–72. Springer, Berlin, 2004.
 N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy. Efficient testing of large graphs. Combinatorica, 20:451–476, 2000.
 N. Alon and A. Shapira. A Characterization of the (natural) Graph Properties Testable with One-Sided Error. preprint, available online at http://www.math.tau.ac.il/~nogaa/PDFS/heredit2.pdf.
 N. Alon and A. Shapira. Every monotone graph property is testable. In Proc. of the 37th ACM STOC, Baltimore. ACM Press, 2005. available online at http://www.math.tau.ac.il/~nogaa/PDFS/MonotoneSTOC.pdf.
 T. Austin. Razborov flag algebras as algebras of measurable functions. manuscript, available online at arXiv.org: 0801.1538, 2007.
 T. Austin and T. Tao. On the testability and repair of hereditary hypergraph properties. preprint, available online at arXiv.org: 0801.2179, 2008.
 H. Becker and A. S. Kechris. The Descriptive Set Theory of Polish Group Actions. Cambridge University Press, Cambridge, 1996.
 I. Benjamini and O. Schramm. Recurrence of distributional limits of finite planar graphs. Electron. J. Probab., 6:no. 23, 13 pp. (electronic), 2001.
 I. Benjamini, O. Schramm, and A. Shapira. Every Minor-Closed Property of Sparse Graphs is Testable.
 Y. Benyamini and J. Lindenstrauss. Geometric Nonlinear Functional Analysis. American Mathematical Society, Providence, 2000.
 V. Bergelson. Ergodic Ramsey Theory – an Update. In M. Pollicott and K. Schmidt, editors, Ergodic Theory of ℤd-actions: Proceedings of the Warwick Symposium 1993-4, pages 1–61. Cambridge University Press, Cambridge, 1996.
 B. Bollobás. Modern Graph Theory. Springer, Berlin, 1998.
 C. Borgs, J. Chayes, L. Lovász, V. T. Sós, B. Szegedy, and K. Vesztergombi. Graph limits and parameter testing. In STOC’06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pages 261–270, New York, 2006. ACM.
 B. de Finetti. Fuzione caratteristica di un fenomeno aleatorio. Mem. R. Acc. Lincei, 4(6):86–133, 1930.
 B. de Finetti. La prévision: ses lois logiques, ses sources subjectives. Ann. Inst. H. Poincaré, 7:1–68, 1937.
 P. Diaconis and S. Janson. Graph limits and exchangeable random graphs. Preprint; available online at arXiv.org: math.PR math.CO/0712.2749, 2007.
 E. B. Dynkin. Classes of equivalent random quantities. Uspehi Matem. Nauk (N.S.), 8(2(54)):125–130, 1953.
Mathematical Reviews (MathSciNet): MR55601
 G. Elek. On limits of finite graphs. preprint; available online at arXiv.org: math.CO/0505335, 2005.
 G. Elek. A Regularity Lemma for Bounded Degree Graphs and Its Applications: Parameter Testing and Infinite Volume Limits. preprint; available online at arXiv.org: math.CO/0711.2800, 2007.
 G. Elek and B. Szegedy. Limits of Hypergraphs, Removal and Regularity Lemmas. A Nonstandard Approach. preprint; available online at arXiv.org: math.CO/0705.2179, 2007.
 P. Erdős and A. Hajnal. Some remarks on set theory, IX. Combinatorial problems in measure theory and set theory. Michigan Math. J., 11:107–127, 1964.
Mathematical Reviews (MathSciNet): MR171713
 D. G. Fon-Der-Flaass. A method for constructing (3,4)-graphs. Mat. Zametki, 44(4):546–550, 559, 1988.
Mathematical Reviews (MathSciNet): MR975195
 D. H. Fremlin. list of problems. available online at http://www.essex.ac.uk/maths/staff/fremlin/problems.htm.
 D. H. Fremlin. Random equivalence relations. preprint, available online at http://www.essex.ac.uk/maths/staff/fremlin/preprints.htm, 2006.
 D. H. Fremlin and M. Talagrand. Subgraphs of random graphs. Trans. Amer. Math. Soc., 291(2):551–582, 1985.
Mathematical Reviews (MathSciNet): MR800252
 H. Furstenberg. Ergodic behaviour of diagonal measures and a theorem of Szemerédi on arithmetic progressions. J. d’Analyse Math., 31:204–256, 1977.
Mathematical Reviews (MathSciNet): MR498471
 H. Furstenberg. Recurrence in Ergodic Theory and Combinatorial Number Theory. Princeton University Press, Princeton, 1981.
Mathematical Reviews (MathSciNet): MR603625
 H. Furstenberg and Y. Katznelson. An ergodic Szemerédi Theorem for commuting transformations. J. d’Analyse Math., 34:275–291, 1978.
Mathematical Reviews (MathSciNet): MR531279
 H. Furstenberg and Y. Katznelson. An ergodic Szemerédi theorem for IP-systems and combinatorial theory. J. d’Analyse Math., 45:117–168, 1985.
Mathematical Reviews (MathSciNet): MR833409
 H. Gaifman. Concerning measures in first-order calculi. Israel J. Math., 2:1–18, 1964.
Mathematical Reviews (MathSciNet): MR175755
 E. Glasner. Ergodic Theory via Joinings. American Mathematical Society, Providence, 2003.
 W. T. Gowers. Hypergraph regularity and the multidimensional Szemerédi Theorem. preprint.
 W. T. Gowers. A new proof of Szemerédi’s theorem. Geom. Funct. Anal., 11(3):465–588, 2001.
 W. T. Gowers. Quasirandomness, counting and regularity for 3-uniform hypergraphs. Combin. Probab. Comput., 15(1-2):143–184, 2006.
 M. Gromov. Metric Structures for Riemannian and Non-Riemannian Spaces. Birkhäuser, Boston, 1999.
 E. Hewitt and L. J. Savage. Symmetric measures on Cartesian products. Trans. Amer. Math. Soc., 80:470–501, 1955.
Mathematical Reviews (MathSciNet): MR76206
 D. N. Hoover. Relations on probability spaces and arrays of random variables. 1979.
 D. N. Hoover. Row-columns exchangeability and a generalized model for exchangeability. In Exchangeability in probability and statistics (Rome, 1981), pages 281–291, Amsterdam, 1982. North-Holland.
Mathematical Reviews (MathSciNet): MR675982
 B. Host and B. Kra. Nonconventional ergodic averages and nilmanifolds. Ann. Math., 161(1):397–488, 2005.
 O. Kallenberg. Symmetries on random arrays and set-indexed processes. J. Theoret. Probab., 5(4):727–765, 1992.
 O. Kallenberg. Foundations of modern probability. Probability and its Applications (New York). Springer-Verlag, New York, second edition, 2002.
 O. Kallenberg. Probabilistic symmetries and invariance principles. Probability and its Applications (New York). Springer, New York, 2005.
 J. F. C. Kingman. The representation of partition structures. J. London Math. Soc. (2), 18(2):374–380, 1978.
Mathematical Reviews (MathSciNet): MR509954
 J. F. C. Kingman. Uses of exchangeability. Ann. Probability, 6(2):183–197, 1978.
Mathematical Reviews (MathSciNet): MR494344
 R. Kopperman. Model Theory and its Applications. Allyn and Bacon, Boston, 1972.
Mathematical Reviews (MathSciNet): MR363873
 A. V. Kostochka. A class of constructions for Turán’s (3,4)-problem. Combinatorica, 2:187–192, 1982.
 P. H. Krauss. Representation of symmetric probability models. J. Symbolic Logic, 34:183–193, 1969.
Mathematical Reviews (MathSciNet): MR275482
 L. Lovász and B. Szegedy. Limits of dense graph sequences. J. Combin. Theory Ser. B, 96(6):933–957, 2006.
 B. Nagle, V. Rödl, and M. Schacht. The counting lemma for regular k-uniform hypergraphs. Random Structures and Algorithms, to appear.
 A. Razborov. Flag Algebras. J. Symbolic Logic, 72(4):1239–1282, 2007.
 A. Razborov. On the minimal density of triangles in graphs. preprint; available online at http://www.mi.ras.ru/~razborov/triangles.pdf, 2007.
 V. Rödl and M. Schacht. Generalizations of the removal lemma. preprint, available online at http://www.informatik.hu-berlin.de/~schacht/pub/preprints/gen_removal.pdf.
 R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252–271, 1996.
 C. Ryll-Nardzewski. On stationary sequences of random variables and the de finetti’s equivalence. Colloq. Math., 4:149–156, 1957.
Mathematical Reviews (MathSciNet): MR88823
 O. Schramm. Hyperfinite graph limits. preprint, available online at arXiv.org: math.CO/0711.3808, 2007.
 A. Sidorenko. What We Know and What We Do not Know about Turán Numbers. Graphs and Combinatorics, 11:179–199, 1995.
 E. Szemerédi. On sets of integers containing no k elements in arithmetic progression. Acta Arith., 27:199–245, 1975.
Mathematical Reviews (MathSciNet): MR369312
 T. Tao. A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma. J. d’Analyse Mathematique. to appear; available online at arXiv.org: math.CO/0602037.
 T. Tao. A quantitative ergodic theory proof of Szemerédi’s theorem. Electron. J. Combin., 13(1):Research Paper 99, 49 pp. (electronic), 2006.
 T. Tao and V. Vu. Additive combinatorics. Cambridge University Press, Cambridge, 2006.
 P. Wojtaszczyk. Banach spaces for analysts. Cambridge University Press, Cambridge, 1991.
 K. Yosida. Functional analysis. Classics in Mathematics. Springer-Verlag, Berlin, 1995. Reprint of the sixth (1980) edition.
 T. Ziegler. Universal characteristic factors and Furstenberg averages. J. Amer. Math. Soc., 20(1):53–97 (electronic), 2007.
 R. J. Zimmer. Ergodic actions with generalized discrete spectrum. Illinois J. Math., 20(4):555–588, 1976.
Mathematical Reviews (MathSciNet): MR414832
 R. J. Zimmer. Extensions of ergodic group actions. Illinois J. Math., 20(3):373–409, 1976.
Mathematical Reviews (MathSciNet): MR409770