Related papers: Asymptotic Results of a Multiple-entry Reinforceme…

This work deals with a system of interacting reinforced stochastic processes, where each process $X^j=(X_{n,j})_n$ is located at a vertex $j$ of a finite weighted direct graph, and it can be interpreted as the sequence of "actions" adopted…

Representation theory of finite groups portrays a marvelous crossroad of group theory, algebraic combinatorics, and probability. In particular the Plancherel measure is a probability that arises naturally from representation theory, and in…

Although consistency is a minimum requirement of any estimator, little is known about consistency of the mean partition approach in consensus clustering. This contribution studies the asymptotic behavior of mean partitions. We show that…

We extend a general result showing that the asymptotic behavior of high moments, factorial or standard, of random variables, determines the asymptotically normality, from the one dimensional to the multidimensional setting. This approach…

In earlier work (arXiv:1707.04927) the authors obtained formulas for the probability in the asymmetric simple exclusion process that at time $t$ a particle is at site $x$ and is the beginning of a block of $L$ consecutive particles. Here we…

This paper develops asymptotic theory of integrals of empirical quantile functions with respect to random weight functions, which is an extension of classical $L$-statistics. They appear when sample trimming or Winsorization is applied to…

Let $\alpha>1$ be an irrational number. We establish asymptotic formulas for the number of partitions of $n$ into summands and distinct summands, chosen from the Beatty sequence $(\lfloor\alpha m\rfloor)_{m\in\mathbb{N}}$. This improves…

This work deals with systems of interacting reinforced stochastic processes, where each process $X^j=(X_{n,j})_n$ is located at a vertex $j$ of a finite weighted direct graph, and it can be interpreted as the sequence of "actions" adopted…

For any partition of $\{1, 2, ..., n\}$ we define its {\it increments} $X_i, 1 \le i \le n$ by $X_i = 1$ if $i$ is the smallest element in the partition block that contains it, $X_i = 0$ otherwise. We prove that for partially exchangeable…

The standard approach to analyzing the asymptotic complexity of probabilistic programs is based on studying the asymptotic growth of certain expected values (such as the expected termination time) for increasing input size. We argue that…

In the last decade, sequential Monte-Carlo methods (SMC) emerged as a key tool in computational statistics. These algorithms approximate a sequence of distributions by a sequence of weighted empirical measures associated to a weighted…

A classical fact of the theory of almost periodic functions is the existence of their asymptotic distributions. In probabilistic terms, this means that if $f$ is a Besicovitch almost periodic function and $V$ is a random variable uniformly…

Specimens are collected from $N$ different sources. Each specimen has probability $p$ of being contaminated, independently of the other specimens. We assume group testing is applicable, namely one can take small portions from several…

We conjecture that the asymptotic behavior of the numbers of solid (three-dimensional) partitions is identical to the asymptotics of the three-dimensional MacMahon numbers. Evidence is provided by an exact enumeration of solid partitions of…

In this paper, we study a class of self-exciting point processes. The intensity of the point process has a nonlinear dependence on the past history and time. When a new jump occurs, the intensity increases and we expect more jumps to come.…

We consider a two-round election model involving $m$ voters and $n$ candidates. Each voter is endowed with a strict preference list ranking the candidates. In the first round, the candidates are partitioned into two subsets, $A$ and $B$,…

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…

We consider a linear mixed-effects model with a clustered structure, where the parameters are estimated using maximum likelihood (ML) based on possibly unbalanced data. Inference with this model is typically done based on asymptotic theory,…

In this paper we strongly improve asymptotics for $s_1(n)$ (respectively $s_2(n)$) which sums reciprocals (respectively squares of reciprocals) of parts throughout all the partitions of $n$ into distinct parts. The methods required are much…

Let $\mathbb{P}$ denote the set of primes and $\mathcal{N}\subset \mathbb{N}$ be a set with arbitrary weights attached to its elements. Set $\mathfrak{p}_{\mathcal{N}}(n)$ to be the restricted partition function which counts partitions of…