Related papers: A Cluster Limit Theorem for Infinitely Divisible P…

Linked cluster expansions are generalized from an infinite to a finite volume. They are performed to 20th order in the expansion parameter to approach the critical region from the symmetric phase. A new criterion is proposed to distinguish…

We study the asymptotics of the survival probability for the critical and decomposable branching processes in random environment and prove Yaglom type limit theorems for these processes. It is shown that such processes possess some…

When the parameters are independently and identically distributed (initialized) neural networks exhibit undesirable properties that emerge as the number of layers increases, e.g. a vanishing dependency on the input and a concentration on…

This paper is devoted to the study of the following problem. We have set of diffusion processes with absorption on boundaries in some region at initial time $t=0$. It is required to estimate of number of the unabsorbed processes for the…

A multi-type branching process is defined as a random tree with labeled vertices, where each vertex produces offspring independently according to the same multivariate probability distribution. We demonstrate that in realizations of the…

We study the cluster size distribution of particles for a two-species exclusion process which involves totally asymmetric transport process of two oppositely directed species with stochastic directional switching of the species on a 1D…

Consider a continuous-time binary branching process conditioned to have population size n at some time t, and with a chance p for recording each extinct individual in the process. Within the family tree of this process, we consider the…

We consider a subcritical branching process in an i.i.d. random environment, in which one immigrant arrives at each generation. We consider the event $% \mathcal{A}_{i}(n)$ that all individuals alive at time $n$ are offspring of the…

For an arbitrary diffusion process $X$ with time-homogeneous drift and variance parameters $\mu(x)$ and $\sigma^2(x)$, let $V_\varepsilon$ be $1/\varepsilon$ times the total time $X(t)$ spends in the strip…

In this paper, we analyze the asymptotic behavior of the point process of exceedances in a spatio-temporal setting whose points are given by the rescaled occurrence times, the sites and the rescaled values of exceedances. Here, the…

For a sequence of i.i.d. random variables $\{\xi_x : x\in \bb Z\}$ bounded above and below by strictly positive finite constants, consider the nearest-neighbor one-dimensional simple exclusion process in which a particle at $x$ (resp.…

Let $(Z_n)$ be a supercritical branching process with immigration in a random environment. The small positive values and some lower deviation inequalities for $Z$ are investigated. Based on these results, the central limit theorem of $\log…

We consider the point process \begin{align*} \frac{1}{Z_{n}}\prod_{1 \leq j < k \leq n} |e^{i\theta_{j}}-e^{-i\theta_{k}}|^{\beta}\prod_{j=1}^{n} d\theta_{j}, \qquad \theta_{1},\ldots,\theta_{n} \in (-\pi,\pi], \quad \beta > 0, \end{align*}…

We formulate and establish the central limit theorem for products of i.i.d. random variables on arbitrary simply connected nilpotent Lie groups, allowing a possible bias. Two new phenomena arise in the presence of a bias: (a) the walk…

Let $\left\{ Z_{n},n=0,1,2,...\right\} $ be a critical branching process in random environment and let $\left\{ S_{n},n=0,1,2,...\right\} $ be its associated random walk. It is known that if the increments of this random walk belong…

Nonparametric Bayesian approaches provide a flexible framework for clustering without pre-specifying the number of groups, yet they are well known to overestimate the number of clusters, especially for functional data. We show that a…

We provide a sufficient condition for the uniqueness in distribution of Gibbs point processes with non-negative pairwise interaction, together with convergent expansions of the log-Laplace functional, factorial moment densities and…

Let $\{X_{i,j}:(i,j)\in\mathbb N^2\}$ be a two-dimensional array of independent copies of a random variable $X$, and let $\{N_n\}_{n\in\mathbb N}$ be a sequence of natural numbers such that $\lim_{n\to\infty}e^{-cn}N_n=1$ for some $c>0$.…

We present two limit theorems, a mean ergodic and a central limit theorem, for a specific class of one-dimensional diffusion processes that depend on a small-scale parameter $\varepsilon$ and converge weakly to a homogenized diffusion…

In this paper we propose a graph-based data clustering algorithm which is based on exact clustering of a minimum spanning tree in terms of a minimum isoperimetry criteria. We show that our basic clustering algorithm runs in $O(n \log n)$…