Abstract
We develop a theory of limits of finite posets in close analogy to the recent theory of graph limits. In particular, we study representations of the limits by functions of two variables on a probability space, and connections to exchangeable random infinite posets.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Aldous: Representations for partially exchangeable arrays of random variables, J. Multivar. Anal. 11 (1981), 581–598.
T. Austin: On exchangeable random variables and the statistics of large graphs and hypergraphs, Probab. Surv. 5 (2008), 80–145.
B. Bollobás, S. Janson and O. Riordan: The cut metric, random graphs, and branching processes, Journal of Statistical Physics 140(2) (2010), 289–335
B. Bollobás and O. Riordan: Metrics for sparse graphs, Surveys in Combinatorics 2009, LMS Lecture Notes Series 365, Cambidge Univ. Press, 2009, 211–287.
C. Borgs, J. T. Chayes and L. Lovász: Moments of two-variable functions and the uniqueness of graph limits, Geom. Funct. Anal. 19 (2010), no. 6, 1597–1619.
C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós and K. Vesztergombi: Convergent sequences of dense graphs, I. Subgraph frequencies, metric properties and testing, Adv. Math. 219 (2008), no. 6, 1801–1851.
C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós and K. Vesztergombi: Convergent sequences of dense graphs II: Multiway cuts and statistical physics, Preprint, 2007, http://research.microsoft.com/borgs/
G. Brightwell and N. Georgiou: Continuum limits for classical sequential growth models, Random Structures Algorithms 36 (2010), no. 2, 218–250.
P. Diaconis, S. Holmes and S. Janson: Interval graph limits, Preprint, 2011, arXiv:1102.2841v1.
P. Diaconis and S. Janson: Graph limits and exchangeable random graphs, Rendiconti di Matematica 28 (2008), 33–61.
G. Elek and B. Szegedy: Limits of hypergraphs, removal and regularity lemmas. A non-standard approach, arXiv:0705.2179v1.
A. Frieze and R. Kannan: Quick approximation to matrices and applications, Combinatorica 19 (1999), 175–220.
D. Hoover: Relations on Probability Spaces and Arrays of Random Variables, Preprint, Institute for Advanced Study, Princeton, NJ, 1979.
S. Janson: Poset limits and exchangeable random posets, preprint version of the present paper, arXiv:0902.0306v1.
S. Janson: Graphons, cut norm and distance, couplings and rearrangements, preprint, 2010–2011. arXiv:1009.2376v3.
S. Janson: Limits of interval orders and semiorders, preprint, 2011, arXiv:1104.1264v1.
O. Kallenberg: Foundations of Modern Probability, 2nd ed., Springer, New York, 2002.
O. Kallenberg: Probabilistic Symmetries and Invariance Principles, Springer, New York, 2005.
L. Lovász and B. Szegedy: Limits of dense graph sequences, J. Comb. Theory B 96 (2006), 933–957.
L. Lovász and B. Szegedy: Szemerédi’s lemma for the analyst, Geom. Funct. Anal. 17 (2007), no. 1, 252–270.
K. R. Parthasarathy: Probability Measures on Metric Spaces, Academic Press, New York, 1967.
B. Pittel and R. Tungol: A phase transition phenomenon in a random directed acyclic graph, Random Struct. Alg. 18 (2001), no. 2, 164–184.
E. M. Stein: Singular Integrals and Differentiability Properties of Functions, Princeton University Press, Princeton, N.J., 1970.
T. Tao: A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma, J. Anal. Math. 103 (2007), 1–45.