Related papers: Exchangeable partitions derived from Markovian coa…
Bayesian supervised predictive classifiers, hypothesis testing, and parametric estimation under Partition Exchangeability are implemented. The two classifiers presented are the marginal classifier (that assumes test data is i.i.d.) next to…
We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing…
Various phenomenological models of particle multiplicity distributions are discussed using a general form of the grand canonical partition function. These phenomenological models include a wide range of varied processes such as coherent…
Let $\mathbb{T}^d_N$, $d\ge 2$, be the discrete $d$-dimensional torus with $N^d$ points. Place a particle at each site of $\mathbb{T}^d_N$ and let them evolve as independent, nearest-neighbor, symmetric, continuous-time random walks. Each…
We generalize the celebrated coagulation-fragmentation duality of Pitman (1999), originally established for the PD$(\alpha,\theta)$ laws of Pitman and Yor (1997), resolving a two-decade open problem. Our framework extends the duality to…
By resorting to sequential constructions of exchangeable random partitions (Pitman, 2006), and exploiting some known facts about generalized Stirling numbers, we derive a generalized Chinese restaurant process construction of exchangeable…
The hitting partitions are random partitions that arise from the investigation of so-called hitting scenarios of max-infinitely-divisible (max-i.d.)~distributions. We study a class of max-i.d.~laws with exchangeable hitting partitions…
There is currently a renewed interest in the Bayesian predictive approach to statistics. This paper offers a review on foundational concepts and focuses on predictive modeling, which by directly reasoning on prediction, bypasses inferential…
We consider shifts $\Pi_{n,m}$ of a partially exchangeable random partition $\Pi_\infty$ of $\mathbb{N}$ obtained by restricting $\Pi_\infty$ to $\{n+1,n+2,\dots, n+m\}$ and then subtracting $n$ from each element to get a partition of…
We introduce a Poissonization method to study the coalescent structure of uniform samples from branching processes. This method relies on the simple observation that a uniform sample of size $k$ taken from a random set with positive…
Using the standard Vicsek model, I show how the macroscopic transport equations can be systematically derived from microscopic collision rules. The approach starts with the exact evolution equation for the N-particle probability…
Exchangeable sequences of random probability measures (partitions of mass) and their corresponding exchangeable bridges play an important role in a variety of areas in probability, statistics and related areas, including Bayesian…
Widely used models in genetics include the Wright-Fisher diffusion and its moment dual, Kingman's coalescent. Each has a multilocus extension but under neither extension is the sampling distribution available in closed-form, and their…
Consider a random permutation of $\{1, \ldots, \lfloor n^{t_2}\rfloor\}$ drawn according to the Ewens measure with parameter $t_1$ and let $K(n, t)$ denote the number of its cycles, where $t\equiv (t_1, t_2)\in\mathbb [0, 1]^2$. Next,…
We consider a three dimensional system consisting of a large number of small spherical particles, distributed in a range of sizes and heights (with uniform distribution in the horizontal direction). Particles move vertically at a…
We consider a continuous population whose dynamics is described by the standard stationary Fleming-Viot process, so that the genealogy of $n$ uniformly sampled individuals is distributed as the Kingman $n$-coalescent. In this note, we study…
When an advantageous mutation occurs in a population, the favorable allele may spread to the entire population in a short time, an event known as a selective sweep. As a result, when we sample $n$ individuals from a population and trace…
Kingman's coalescent is a widely used process to model sample genealogies in population genetics. Recently there have been studies on the inference of quantities related to the genealogy of additional individuals given a known sample. This…
Coalescent processes, including mutation, are derived from Moran type population models admitting large offspring numbers. Including mutation in the coalescent process allows for quantifying the turnover of alleles by computing the…
We study the continuous-time evolution of the recombination equation of population genetics. This evolution is given by a differential equation that acts on a product probability space, and its solution can be described by a Markov chain on…