Related papers: A Cluster Limit Theorem for Infinitely Divisible P…
Asynchronous event sequence clustering aims to group similar event sequences in an unsupervised manner. Mixture models of temporal point processes have been proposed to solve this problem, but they often suffer from overfitting, leading to…
We prove a strong form of the equivalence of ensembles for the invariant measures of zero range processes conditioned to a supercritical density of particles. It is known that in this case there is a single site that accomodates a…
We consider one-dimensional branching Brownian motion in which particles are absorbed at the origin. We assume that when a particle branches, the offspring distribution is supercritical, but the particles are given a critical drift towards…
We consider a branching random walk with immigration in a random environment, where the environment is a stationary and ergodic sequence indexed by time. We focus on the asymptotic properties of the sequence of measures $(Z_n)$ that count…
Let $K_n$ denote the number of distinct values among the first $n$ terms of an infinite exchangeable sequence of random variables $(X_1,X_2,\ldots)$. We prove for $n=3$ that the extreme points of the convex set of all possible laws of $K_3$…
Temporal point processes offer a powerful framework for sampling from discrete distributions, yet they remain underutilized in existing literature. We show how to construct, for any target multivariate count distribution with…
This work concerns weakly confined particle systems in the plane, characterized by a large number of outliers away from a droplet where the bulk of the particles accumulate in the many-particle limit. We are interested in the asymptotic…
This article establishes a universal robust limit theorem under a sublinear expectation framework. Under moment and consistency conditions, we show that, for $\alpha \in(1,2)$, the i.i.d. sequence \[ \left \{ \left(…
In this paper, we establish some functional central limit theorems for a large class of general supercritical superprocesses with spatially dependent branching mechanisms satisfying a second moment condition. In the particular case when the…
We consider first-passage percolation on $\mathbb{Z}^2$ with i.i.d. weights, whose distribution function satisfies $F(0) = p_c = 1/2$. This is sometimes known as the "critical case" because large clusters of zero-weight edges force passage…
The convergence of a sequence of point processes with dependent points, defined by a symmetric function of iid high-dimensional random vectors, to a Poisson random measure is proved. This also implies the convergence of the joint…
Clustering is one of the most common unsupervised learning tasks in machine learning and data mining. Clustering algorithms have been used in a plethora of applications across several scientific fields. However, there has been limited…
Consider the set of all sequences of $n$ outcomes, each taking one of $m$ values, that satisfy a number of linear constraints. If $m$ is fixed while $n$ increases, most sequences that satisfy the constraints result in frequency vectors…
Let $X=\{X_n: n\in\mathbb{N}\}$ be a linear process in which the coefficients are of the form $a_i=i^{-1}\ell(i)$ with $\ell$ being a slowly varying function at the infinity and the innovations are independent and identically distributed…
Noncolliding diffusion processes reported in the present paper are $N$-particle systems of diffusion processes in one-dimension, which are conditioned so that all particles start from the origin and never collide with each other in a finite…
We present exact and asymptotic results for clusters in the one-dimensional totally asymmetric exclusion process (TASEP) with two different dynamics. The expected length of the largest cluster is shown to diverge logarithmically with…
We consider a random geometric graph with vertices sampled from a probability measure supported on $\mathbb R^d$, and study its connectivity. We show the graph is typically disconnected, unless the sampling density has superexponential…
We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…
The one-dimensional contact process is analyzed by a cluster approximation. In this approach, the hierarchy of rate equations for the densities of finite length empty intervals are truncated under the assumption that adjacent intervals are…
$\renewcommand{\Re}{\mathbb{R}}$Given a set $P$ of $n$ points in $\Re^d$, consider the problem of computing $k$ subsets of $P$ that form clusters that are well-separated from each other, and each of them is large (cardinality wise). We…