Related papers: Stick-breaking PG(\alpha,\zeta)-Generalized Gamma …

We give a pathwise construction of a two-parameter family of purely-atomic-measure-valued diffusions in which ranked masses of atoms are stationary with the Poisson-Dirichlet$(\alpha,\theta)$ distributions, for $\alpha\in (0,1)$ and…

When $S=(S_t)_{t\ge 0}$ is an $\alpha$-stable subordinator, the sequence of ordered jumps of $S$, up till time $1$, omitting the $r$ largest of them, and taken as proportions of their sum $^{(r)}S_t$, defines a 2-parameter distribution on…

A graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of…

The two parameter Poisson-Dirichlet Process (PDP), a generalisation of the Dirichlet Process, is increasingly being used for probabilistic modelling in discrete areas such as language technology, bioinformatics, and image analysis. There is…

We introduce an algorithm for the segmentation of a class of regime switching processes. The segmentation algorithm is a non parametric statistical method able to identify the regimes (patches) of the time series. The process is composed of…

The nonparametric view of Bayesian inference has transformed statistics and many of its applications. The canonical Dirichlet process and other more general families of nonparametric priors have served as a gateway to solve frontier…

In this work, we consider rather general and broad class of Markov chains, Ito chains, that look like Euler-Maryama discretization of some Stochastic Differential Equation. The chain we study is a unified framework for theoretical analysis.…

We study the model $G_\alpha\cup G(n,p)$ of randomly perturbed dense graphs, where $G_\alpha$ is any $n$-vertex graph with minimum degree at least $\alpha n$ and $G(n,p)$ is the binomial random graph. We introduce a general approach for…

We introduce a family of multiscale stick-breaking mixture models for Bayesian nonparametric density estimation. The Bayesian nonparametric literature is dominated by single scale methods, exception made for P\`olya trees and allied…

A graph $G=(V,E)$ with a vertex set $V$ and an edge set $E$ is called a pairwise compatibility graph (PCG, for short) if there are a tree $T$ whose leaf set is $V$, a non-negative edge weight $w$ in $T$, and two non-negative reals…

Network dynamics with point-process-based interactions are of paramount modeling interest. Unfortunately, most relevant dynamics involve complex graphs of interactions for which an exact computational treatment is impossible. To circumvent…

We study the general fragmentation process starting from one element of size unity (E=1). At each elementary step, each existing element of size $E$ can be fragmented into $k\,(\ge 2)$ elements with probability $p_k$. From the continuous…

Gibbs partitions of the integers generated by stable subordinators of index $\alpha\in(0,1)$ form remarkable classes of random partitions where in principle much is known about their properties, including practically effortless obtainment…

We consider the connections among `clumped' residual allocation models (RAMs), a general class of stick-breaking processes including Dirichlet processes, and the occupation laws of certain discrete space time-inhomogeneous Markov chains…

The Hierarchical Dirichlet Process (HDP) provides a flexible Bayesian nonparametric framework for modeling grouped data with a shared yet unbounded collection of mixture components. While existing applications of the HDP predominantly focus…

Parity-time ($\mathcal{PT}$) symmetric systems are classical, gain-loss systems whose dynamics are governed by non-Hermitian Hamiltonians with exceptional-point (EP) degeneracies. The eigenvalues of a $\mathcal{PT}$-symmetric Hamiltonian…

Pairwise Compatibility Graphs (PCGs) form a tree-metric graph class that originated in phylogeny and has since attracted sustained interest in graph theory. Several natural generalizations have been proposed in order to overcome the…

Inspired by the basic stick fragmentation model proposed by Becker et al. in arXiv:1309.5603v4, we consider three new versions of such fragmentation models, namely, continuous with random number of parts, continuous with probabilistic…

We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…

Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on $n$ labelled vertices. In particular, they showed that, after proper rescaling, the above…