The representation of composition structures
From MaRDI portal
Publication:1370233
DOI10.1214/aop/1024404519zbMath0895.60037OpenAlexW2037774713MaRDI QIDQ1370233
Publication date: 26 October 1997
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1024404519
Combinatorial probability (60C05) Boundary theory for Markov processes (60J50) Exchangeability for stochastic processes (60G09)
Related Items
A representation of exchangeable hierarchies by sampling from random real trees, Spinal partitions and invariance under re-rooting of continuum random trees, Ordered and size-biased frequencies in GEM and Gibbs' models for species sampling, Random orderings of the integers and card shuffling, Diffusive limits of two-parameter ordered Chinese restaurant process up-down chains, Diffusions on a space of interval partitions: the two-parameter model, Running minimum in the best-choice problem, The two-sided infinite extension of the Mallows model for random permutations, The absolute of the comb graph, Excheangable partitions derived from Markovian coalescents, Exchangeable coalescents, ultrametric spaces, nested interval-partitions: a unifying approach, Distinguished exchangeable coalescents and generalized Fleming-Viot processes with immigration, Poisson calculus for spatial neutral to the right processes, Regenerative composition structures, Asymptotic laws for compositions derived from transformed subordinators, Asymptotic laws for regenerative compositions: gamma subordinators and the like, Exchangeable hierarchies and mass-structure of weighted real trees, Diffusions on a space of interval partitions: construction from marked Lévy processes, Semifinite harmonic functions on the Gnedin-Kingman graph, Lipschitz partition processes, Zigzag diagrams and Martin boundary, The boundary of the refined Kingman graph, On the Poisson-Dirichlet limit, Metrics on sets of interval partitions with diversity, Exchangeable interval hypergraphs and limits of ordered discrete structures, Random assignment processes: strong law of large numbers and de Finetti theorem
Cites Work
- Combinatorial examples in the theory of AF-algebras
- The coalescent
- Partition structures derived from Brownian motion and stable subordinators
- Asymptotic theory of characters of the symmetric group
- A necessary and sufficient condition for the existence of the limiting probability of a tie for first place
- Exchangeable and partially exchangeable random partitions
- The Representation of Partition Structures
- Consistent ordered sampling distributions: characterization and convergence
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item