Related papers: Asymptotic normality through factorial cumulants a…
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…
We compute the exact asymptotics for the cumulants of linear statistics associated with the zeros counting measure of a large class of real Gaussian processes. Precisely, we show that if the underlying covariance function is regular and…
Factorial moments and cumulants are usually defined with respect to the unconditioned Poisson process. Conditioning a sample by selecting events of a given overall multiplicity $N$ necessarily introduces correlations. By means of Edgeworth…
We establish asymptotic expansions for factorial moments of following distributions: number of cycles in a random permutation, number of inversions in a random permutation, and number of comparisons used by the randomized quick sort…
We derive a non-asymptotic expression for the moments of traces of monomials in several independent complex Wishart matrices, extending some explicit formulas available in the literature. We then deduce the explicit expression for the…
A variety of estimators for the parameters of the Generalized Pareto distribution, the approximating distribution for excesses over a high threshold, have been proposed, always assuming the underlying data to be independent. We recently…
With many pretreatment covariates and treatment factors, the classical factorial experiment often fails to balance covariates across multiple factorial effects simultaneously. Therefore, it is intuitive to restrict the randomization of the…
For numerical semigroups with a specified list of (not necessarily minimal) generators, we obtain explicit asymptotic expressions, and in some cases quasipolynomial/quasirational representations, for all major factorization length…
By a suitable shifting-the-mean parametrization at the Dirichlet series level and Delange's Tauberian theorems, we show that the number of factors in random ordered factorizations of integers is asymptotically normally distributed.
We present a technique to study normalizing strategies when termination is asymptotic, that is, it appears as a limit, as opposite to reaching a normal form in a finite number of steps. Asymptotic termination occurs in several settings,…
We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…
Using a recently derived integral in terms of elementary functions, we derive new asymptotic expansions of the normal inverse Gaussian cumulative distribution function. One of the asymptotic representations is in terms of the normal…
In a recent work, a central limit theorem for pattern counts in random planar maps was proven by reducing the problem to a face count problem. We provide a shorter proof by circumventing this reduction through the computation of bivariate…
A new effective method for factorization of a class of nonrational $n\times n$ matrix-functions with \emph{stable partial indices} is proposed. The method is a generalization of the one recently proposed by the authors which was valid for…
This paper provides a selective review of the statistical network analysis literature focused on clustering and inference problems for stochastic blockmodels and their variants. We survey asymptotic normality results for stochastic…
We introduce the notion of asymptotic partition regularity for Diophantine equations. We show how this notion is at the core of almost all known negative results in the Ramsey theory of equations, and we use it to produce new ones, as in…
The purpose of this paper is to study the limiting distribution of special {\it additive functionals} on random planar maps, namely the number of occurrences of a given {\it pattern}. The main result is a central limit theorem for these…
Frequentists' inference often delivers point estimators associated with confidence intervals or sets for parameters of interest. Constructing the confidence intervals or sets requires understanding the sampling distributions of the point…
We consider a number of combinatorial problems in which rational generating functions may be obtained, whose denominators have factors with certain singularities. Specifically, there exist points near which one of the factors is asymptotic…
Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence…