EXCHANGEABLE INTERVAL HYPERGRAPHS AND LIMITS OF ORDERED DISCRETE STRUCTURES

• 成果类型: Article
• 署名作者: Gerstenberg, Julian
• 署名单位: Leibniz University Hannover
• 刊物名称: ANNALS OF PROBABILITY
• ISSN/ISSBN: 0091-1798
• DOI: 10.1214/19-AOP1384
• 发表日期: 2020
• 页码: 1128-1167
• 关键词: representation; filtrations

摘要

A hypergraph (V, E) is called an interval hypergraph if there exists a linear order l on V such that every edge e is an element of E is an interval w.r.t. l; we also assume that {j} is an element of E for every j is an element of V. Our main result is a de Finetti-type representation of random exchangeable interval hypergraphs on N (EIHs): the law of every EIH can be obtained by sampling from some random compact subset K of the triangle {(x, y) : 0 <= x <= y <= 1} at i.i.d. uniform positions U-1, U-2, ...., in the sense that, restricted to the node set [n] := {1, ..., n} every nonsingleton edge is of the form e = {I is an element of [n] : x < U-i < y} for some (x, y) is an element of K. We obtain this result via the study of a related class of stochastic objects: erased-interval processes (EIPs). These are certain transient Markov chains (I-n, eta(n))(n is an element of N) such that I-n is an interval hypergraph on V = [n] w.r.t. the usual linear order (called interval system). We present an almost sure representation result for EIPs. Attached to each transient Markov chain is the notion of Martin boundary. The points in the boundary of EIPs can be seen as limits of growing interval systems. We obtain a one-to-one correspondence between these limits and compact subsets K of the triangle with (x, x) is an element of K for all x is an element of [0, 1]. Interval hypergraphs are a generalizations of hierarchies and as a consequence we obtain a representation result for exchangeable hierarchies, which is close to a result of Forman, Haulk and Pitman in (Probab. Theory Related Fields 172 (2018) 1-29). Several ordered discrete structures can be seen as interval systems with additional properties, that is, Schroder trees (rooted, ordered, no node has outdegree one) or even more special: binary trees. We describe limits of Schroder trees as certain tree-like compact sets. These can be seen as an ordered counterpart to real trees, which are widely used to describe limits of discrete unordered trees. Considering binary trees, we thus obtain a homeomorphic description of the Martin boundary of Remy's tree growth chain, which has been analyzed by Evans, Grfibel and Wakolbinger in (Ann. Probab. 45 (2017) 225-277).