相关论文: Local central limit theorem for Mallows measure

We establish self-norming central limit theorems for non-stationary time series arising as observations on sequential maps possessing an indifferent fixed point. These transformations are obtained by perturbing the slope in the…

In this paper, we prove a local limit theorem for the chi-square distribution with $r > 0$ degrees of freedom and noncentrality parameter $\lambda \geq 0$. We use it to develop refined normal approximations for the survival function. Our…

We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…

We show that if a permutation statistic can be written as a linear combination of bivincular patterns, then its moments can be expressed as a linear combination of factorials with constant coefficients. This generalizes a result of…

This paper investigates a local central limit theorem for a normalized sequence of random variables belonging to a fixed order Wiener chaos and converging to the standard normal distribution. We prove, without imposing any additional…

We consider covariance asymptotics for linear statistics of general stationary random measures in terms of their truncated pair correlation measure. We give exact infinite series-expansion formulas for covariance of smooth statistics of…

We prove the Central Limit Theorem (CLT) from the definition of weak convergence using the Haar wavelet basis, calculus, and elementary probability. The use of the Haar basis pinpoints the role of $L^{2}([0,1])$ in the CLT as well as the…

For $1\le p \le \infty$, the Fr\'echet $p$-mean of a probability measure on a metric space is an important notion of central tendency that generalizes the usual notions in the real line of mean ($p=2$) and median ($p=1$). In this work we…

In this paper we prove the central limit theorem for Hotelling's $T^2$ statistic when the dimension of the random vectors is proportional to the sample size.

The Robbins-Monro algorithm is a recursive, simulation-based stochastic procedure to approximate the zeros of a function that can be written as an expectation. It is known that under some technical assumptions, a Gaussian convergence can be…

An estimate of the order of approximation in the central limit theorem for strictly stationary associated random variables with finite moments of order q > 2 is obtained. A moderate deviation result is also obtained. We have a refinement of…

We use various combinatorial and probabilistic techniques to study growth rates for the probability that a random permutation from the Mallows distribution avoids consecutive patterns. The Mallows distribution behaves like a $q$-analogue of…

We give estimates on the rate of convergence in the Boolean central limit theorem for the L\'evy distance. In the case of measures with bounded support we obtain a sharp estimate by giving a qualitative description of this convergence.

We consider the existence of the integrated density of states (IDS) of the Anderson model on the Hilbert space $\ell^2(\mathbb{Z}^d)$ as analogues to the law of large numbers (LLN). In this work, we prove the analogues central limit theorem…

Statistical inferences for sample correlation matrices are important in high dimensional data analysis. Motivated by this, this paper establishes a new central limit theorem (CLT) for a linear spectral statistic (LSS) of high dimensional…

A consistent kernel estimator of the limiting spectral distribution of general sample covariance matrices was introduced in Jing, Pan, Shao and Zhou (2010). The central limit theorem of the kernel estimator is proved in this paper.

Consider the random walk $G_n : = g_n \ldots g_1$, $n \geq 1$, where $(g_n)_{n\geq 1}$ is a sequence of independent and identically distributed random elements with law $\mu$ on the general linear group ${\rm GL}(V)$ with $V=\mathbb R^d$.…

A local cut point is by definition a point that disconnectes its sufficiently small neighborhood. We show that there exists an upper bound for the degree of a local cut point in a metric measure space satisfying the generalized…

Linear processes are defined as a discrete-time convolution between a kernel and an infinite sequence of i.i.d. random variables. We modify this convolution by introducing decimation, that is, by stretching time accordingly. We then…

Linear statistics of eigenvalues in many familiar classes of random matrices are known to obey gaussian central limit theorems. The proofs of such results are usually rather difficult, involving hard computations specific to the model in…