Related papers: A Ray-Knight representation of up-down Chinese res…
We establish scaling limit theorems for the up-down ordered Chinese restaurant processes (oCRPs) of Rogers and Winkel as processes in a space of interval partitions. As previously conjectured, the limits are self-similar diffusions…
Recently there has been significant interest in constructing ordered analogues of Petrov's two-parameter extension of Ethier and Kurtz's infinitely-many-neutral-alleles diffusion model. One method for constructing these processes goes…
The Chinese restaurant process (CRP) and the stick-breaking process are the two most commonly used representations of the Dirichlet process. However, the usual proof of the connection between them is indirect, relying on abstract properties…
Given a growth rule which sequentially constructs random permutations of increasing degree, the stochastic process version of the rencontre problem asks what is the limiting proportion of time that the permutation has no fixed points…
We develop the distance dependent Chinese restaurant process (CRP), a flexible class of distributions over partitions that allows for non-exchangeability. This class can be used to model many kinds of dependencies between data in infinite…
We introduce flows of branching processes with competition, which describe the evolution of general continuous state branching populations in which interactions between individuals give rise to a negative density dependence term. This…
The Generalized Chinese Restaurant Process (GCRP) describes a sequence of exchangeable random partitions of the numbers $\{1,\dots,n\}$. This process is related to the Ewens sampling model in Genetics and to Bayesian nonparametric methods…
Tree structures are ubiquitous in data across many domains, and many datasets are naturally modelled by unobserved tree structures. In this paper, first we review the theory of random fragmentation processes [Bertoin, 2006], and a number of…
It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…
We present a simple stochastic integral representation for the local times of the height process of a spectrally positive Levy process stopped at a hitting time. From the representation we derive a strong stochastic equation for the local…
We propose a restricted collapsed draw (RCD) sampler, a general Markov chain Monte Carlo sampler of simultaneous draws from a hierarchical Chinese restaurant process (HCRP) with restriction. Models that require simultaneous draws from a…
In this paper, we first introduce the Ray-Knight identity and percolation Ray-Knight identity related to loop soup with intensity $\alpha (\ge 0)$ on trees. Then we present the inversions of the above identities, which are expressed in…
In this paper, we study the law of the local time processes $(L_T^x(X),x\in \mathbb{R})$ associated to a spectrally negative L\'evy process $X$, in the cases $T=\tau_a^+$, the first passage time of $X$ above $a>0$ and $T=\tau(c)$, the first…
Consider a spectrally positive Stable($1+\alpha$) process whose jumps we interpret as lifetimes of individuals. We mark the jumps by continuous excursions assigning "sizes" varying during the lifetime. As for Crump-Mode-Jagers processes…
The Recurrent Chinese Restaurant Process (RCRP) is a powerful statistical method for modeling evolving clusters in large scale social media data. With the RCRP, one can allow both the number of clusters and the cluster parameters in a model…
By studying an admissible family of branching mechanisms introduced in Li (2014), we obtain a pruning procedure on L\'evy trees. Then we could construct a decreasing L\'evy-CRT-valued process $\{{\mathcal T}_t\}$ by pruning L\'evy trees and…
The distance dependent Chinese Restaurant Process (ddCRP) provides a flexible prior distribution for clustering observations, incorporating covariate information through pairwise distances and accommodating a rich variety of cluster…
We use a natural ordered extension of the Chinese Restaurant Process to grow a two-parameter family of binary self-similar continuum fragmentation trees. We provide an explicit embedding of Ford's sequence of alpha model trees in the…
We consider the following Markovian dynamic on point processes: at constant rate and with equal probability, either the rightmost atom of the current configuration is removed, or a new atom is added at a random distance from the rightmost…
We study a Markov process constructed from the P\'olya sum process, which yields a kind of spatial version of the Chinese restaurant process, where each 'table' is assigned a 'location'. This construction firstly allows a definition of…