Exchangeable interval hypergraphs and limits of ordered discrete structures (1802.09015v1)

Abstract: A hypergraph $(V,E)$ is called an interval hypergraph if there exists a linear order $l$ on $V$ such that every edge $e\in E$ is an interval w.r.t. $l$; we also assume that ${j}\in E$ for every $j\in V$. Our main result is a de Finetti-type representation of random exchangeable interval hypergraphs on $\mathbb{N}$ (EIHs): the law of every EIH can be obtained by sampling from some random compact subset $K$ of the triangle ${(x,y):0\leq x\leq y\leq 1}$ at iid uniform positions $U_1,U_2,\dots$, in the sense that, restricted to the node set $[n]:={1,\dots,n}$ every non-singleton edge is of the form $e={i\in[n]:x<U_i<y}$ for some $(x,y)\in 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\in\mathbb{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 attached to 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)\in K$ for all $x\in[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. Several ordered discrete structures can be seen as interval systems with additional properties, i.e. Schr\"oder trees and binary trees. We describe limits of Schr\"oder trees as certain tree-like compact sets. Considering binary trees we thus obtain a homeomorphic description of the Martin boundary of R\'emy's tree growth chain, which has been analyzed by Evans, Gr\"ubel and Wakolbinger.