Lipschitz partition processes
From MaRDI portal
Abstract: We introduce a family of Markov processes on set partitions with a bounded number of blocks, called Lipschitz partition processes. We construct these processes explicitly by a Poisson point process on the space of Lipschitz continuous maps on partitions. By this construction, the Markovian consistency property is readily satisfied; that is, the finite restrictions of any Lipschitz partition process comprise a compatible collection of finite state space Markov chains. We further characterize the class of exchangeable Lipschitz partition processes by a novel set-valued matrix operation.
Recommendations
Cites work
- scientific article; zbMATH DE number 3718912 (Why is no real title available?)
- scientific article; zbMATH DE number 2070281 (Why is no real title available?)
- A Consistent Markov Partition Process Generated from the Paintbox Process
- Clustering Using Objective Functions and Stochastic Search
- Consistent ordered sampling distributions: characterization and convergence
- Convergence rates of Markov chains on spaces of partitions
- Exchangeable Markov processes on \([k]^{\mathbb N}\) with càdlàg sample paths
- Exchangeable and partially exchangeable random partitions
- Exchangeable fragmentation-coalescence processes and their equilibrium measures
- Homogeneous fragmentation processes
- How many clusters?
- Random Fragmentation and Coagulation Processes
- Random partitions in population genetics
- Self-similar fragmentations
- Stochastic flows associated to coalescent processes
- The Representation of Partition Structures
- The coalescent
- The cut-and-paste process
- The representation of composition structures
- The sampling theory of selectively neutral alleles
- The standard additive coalescent
Cited in
(2)
This page was built for publication: Lipschitz partition processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515503)