Lipschitz partition processes

DOI10.3150/14-BEJ607MaRDI QIDQ2515503zbMATH OpenFDO

Authors Harry Crane

Publication date 5 August 2015

Published in Bernoulli (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.01495, https://projecteuclid.org/euclid.bj/1432732024

zbMATH Keywords

coalescent processde Finetti's theoremexchangeable random partitioniterated random functionsLipschitz partition processesMarkov processespaintbox processPoisson random measure

Mathematics Subject Classification ID

Exchangeability for stochastic processes (60G09) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Random measures (60G57) Continuous-time Markov processes on general state spaces (60J25) Genetics and epigenetics (92D10)

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.

Review text

The author deals with a family of Markov processes on labeled partitions with a finite number of classes. Partition-valued Markov processes arise as mathematical models in population genetics and mathematical biology. \textit{W. J. Ewens} [Theor. Population Biology 3, 87--112 (1972; Zbl 0245.92009)], \textit{J. F. C. Kingman} [Proc. R. Soc. Lond., Ser. A 361, 1--20 (1978; Zbl 0393.92011)] and others have studied such processes with applications in phylogenetics and other domains. To describe a broader class of processes, the author incorporates ideas from the coagulation-fragmentation literature. These processes are called Lipschitz partition processes. The construction of the previous processes from Coag and Frag operators is provided. These operators are Lipschitz continuous and associative. A family of processes is defined by a repeated application of random Lipschitz continuous maps that act on the space of partitions.

Recommendations

• A Consistent Markov Partition Process Generated from the Paintbox Process
• Markov processes on partitions
• Lipschitz continuous processes for given marginals.
• Reversible Markov structures on divisible set partitions
• An Iterated Random Function with Lipschitz Number One

Cites work

• 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 and partially exchangeable random partitions
• Exchangeable fragmentation-coalescence processes and their equilibrium measures
• Exchangeable Markov processes on \([k]^{\mathbb N}\) with càdlàg sample paths
• Homogeneous fragmentation processes
• How many clusters?
• scientific article; zbMATH DE number 3718912 (Why is no real title available?)
• scientific article; zbMATH DE number 2070281 (Why is no real title available?)
• Random Fragmentation and Coagulation Processes
• Random partitions in population genetics
• Self-similar fragmentations
• Stochastic flows associated to coalescent processes
• The coalescent
• The cut-and-paste process
• The representation of composition structures
• The Representation of Partition Structures
• The sampling theory of selectively neutral alleles
• The standard additive coalescent

Cited in

(3)

• Coalescing Markov labelled partitions and a continuous sites genetics model with infinitely many types
• scientific article; zbMATH DE number 5509960 (Why is no real title available?)
• The cut-and-paste process

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)