Poset limits and exchangeable random posets

DOI10.1007/S00493-011-2591-XMaRDI QIDQ2428630zbMATH OpenOpenAlexFDO

Authors Svante Janson

Publication date 26 April 2012

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0902.0306

zbMATH Keywords

kernelexchangeable arrayposet limit

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Partial orders, general (06A06) Combinatorial probability (60C05) Combinatorics of partially ordered sets (06A07)

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.

Recommendations

• Poset limits can be totally ordered
• Limits of \(k\)-dimensional poset sequences
• A note on random \(k\)-dimensional posets
• Random graphons and a weak positivstellensatz for graphs
• Random orders of dimension 2

Cites work

• scientific article; zbMATH DE number 1713116 (Why is no real title available?)
• scientific article; zbMATH DE number 3245885 (Why is no real title available?)
• A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
• A phase transition phenomenon in a random directed acyclic graph
• Continuum limits for classical sequential growth models
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Graph limits and exchangeable random graphs
• Interval graph limits
• Limits of dense graph sequences
• Metrics for sparse graphs
• Moments of two-variable functions and the uniqueness of graph limits
• On exchangeable random variables and the statistics of large graphs and hypergraphs
• Probabilistic Symmetries and Invariance Principles
• Quick approximation to matrices and applications
• Representations for partially exchangeable arrays of random variables
• Szemerédi's lemma for the analyst
• The cut metric, random graphs, and branching processes

Cited in

(27)

• LIMIT SETS OF RESTRICTED RANDOM SUBSTITUTIONS
• Limits of structures and the example of tree semi-lattices
• The Sperner property for posets: A probabilistic approach
• First order properties of random posets
• Multigraph limits and exchangeability
• Sorting probability for large Young diagrams
• Increasing subsequences of linear size in random permutations and the Robinson-Schensted tableaux of permutons
• INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES
• The cut metric for probability distributions
• Semantic limits of dense combinatorial objects
• Random posets, lattices, and lattices terms
• A representation of exchangeable hierarchies by sampling from random real trees
• Interval graph limits
• Limits of order types
• Limits of random trees. II
• Decomposition of tournament limits
• Poset limits can be totally ordered
• A note on random \(k\)-dimensional posets
• Monotone graph limits and quasimonotone graphs
• First order convergence of matroids
• On trees invariant under edge contraction
• Random graphons and a weak positivstellensatz for graphs
• Long-concave functions and poset probabilities
• Convergence and limits of finite trees
• Weak regularity and finitely forcible graph limits
• Limits of \(k\)-dimensional poset sequences
• Finitely forcible graphons and permutons

This page was built for publication: Poset limits and exchangeable random posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2428630)