Exchangeable interval hypergraphs and limits of ordered discrete structures
From MaRDI portal
Publication:784163
DOI10.1214/19-AOP1384zbMath1464.60030arXiv1802.09015MaRDI QIDQ784163
Publication date: 31 July 2020
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.09015
Martin boundarybinary treeexchangeabilitysimplexhierarchyHausdorff distanceSchröder treeinterval hypergraphlimits of discrete structurespoly-adic filtration
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Boundary theory for Markov processes (60J50) Exchangeability for stochastic processes (60G09)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniform generation of a Schröder tree
- Doob-Martin boundary of Rémy's tree growth chain
- Equipped graded graphs, projective limits of simplices, and their boundaries
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- Interval hypergraphs and D-interval hypergraphs
- The representation of composition structures
- The depth first processes of Galton-Watson trees converge to the same Brownian excursion
- A representation of exchangeable hierarchies by sampling from random real trees
- Radix sort trees in the large
- Limits of permutation sequences
- Interval graph limits
- General erased-word processes: product-type filtrations, ergodic laws and Martin boundaries
- Doob-Martin compactification of a Markov chain for growing random words sequentially
- Poly-adic filtrations, standardness, complementability and maximality
- The Representation of Partition Structures
- Graph limits and exchangeable random graphs
- Filtrations of the Erased-Word Processes
- Probabilistic Symmetries and Invariance Principles
- Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations
- Lectures on Choquet's theorem
This page was built for publication: Exchangeable interval hypergraphs and limits of ordered discrete structures