A Consistent Markov Partition Process Generated from the Paintbox Process
From MaRDI portal
Abstract: We study a family of Markov processes on , the space of partitions of the natural numbers with at most blocks. The process can be constructed from a Poisson point process on with intensity , where is the distribution of the paintbox based on the probability measure on , the set of ranked-mass partitions of 1, and is the product measure on . We show that these processes possess a unique stationary measure, and we discuss a particular set of reversible processes for which transition probabilities can be written down explicitly.
Recommendations
- Markov processes on partitions
- Partition Markov model for multiple processes
- Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities
- Partition-reversible Markov processes
- A class of piecewise deterministic Markov processes
- On Markov chains induced by partitioned transition probability matrices
- A copula-based partition Markov procedure
- A partitioning algorithm for computing limiting distributions of ill-conditioned Markov chains
- Piecewise deterministic Markov process -- recent results
Cites work
- scientific article; zbMATH DE number 3537134 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- 10.1162/jmlr.2003.3.4-5.993
- A Markovian Function of a Markov Chain
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
- Exchangeable fragmentation-coalescence processes and their equilibrium measures
- Gibbs fragmentation trees
- How many clusters?
- Random Fragmentation and Coagulation Processes
- Random partitions in population genetics
- The permanental process
- The sampling theory of selectively neutral alleles
- Two-Parameter Poisson–Dirichlet Measures and Reversible Exchangeable Fragmentation–Coalescence Processes
Cited in
(8)- Lipschitz partition processes
- Reversible Markov structures on divisible set partitions
- The cut-and-paste process
- Permanental partition models and Markovian Gibbs structures
- Generalized divide and color models
- The ubiquitous Ewens sampling formula
- Random partitions of the plane via Poissonian coloring and a self-similar process of coalescing planar partitions
- Some algebraic identities for the \({\alpha}\)-permanent
This page was built for publication: A Consistent Markov Partition Process Generated from the Paintbox Process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3094692)