Related papers: Exact value for subgaussian norm of centered indic…
Let X be the random variable that counts the number of triangles in the random graph G(n,p). We show that for some absolute constant c, the probability that X deviates from its expectation by at least \lambda \var(X)^{1/2} is at most…
We derive a Gaussian Central Limit Theorem for the sample quantiles based on locally dependent random variables with explicit convergence rate. Our approach is based on converting the problem to a sum of indicator random variables, applying…
We consider a problem of statistical mean estimation in which the samples are not observed directly, but are instead observed by a relay (``teacher'') that transmits information through a memoryless channel to the decoder (``student''), who…
In this paper we study precise large deviations for the partial sums of a stationary sequence with a subexponential marginal distribution. Our main focus is on distributions which either have a regularly varying or a lognormal-type tail. We…
A non trivial problem that arises in several applications is the estimation of the mean of a truncated normal distribution. In this paper, an iterative deterministic scheme for approximating this mean is proposed. It has been inspired from…
We derive in this preprint the moment and exponential tail estimates, sufficient conditions for the Non-Central Limit Theorem (NCLT) in the ordinary one-dimensional space as well as in the space of continuous functions for the properly…
We prove that there is a universal constant $C>0$ so that for every $d \in \mathbb N$, every centered subgaussian distribution $\mathcal D$ on $\mathbb R^d$, and every even $p \in \mathbb N$, the $d$-variate polynomial $(Cp)^{p/2} \cdot…
Linear Least Squares is a very well known technique for parameter estimation, which is used even when sub-optimal, because of its very low computational requirements and the fact that exact knowledge of the noise statistics is not required.…
A sequential importance sampling algorithm is developed for the distribution that results when a matrix of independent, but not identically distributed, Bernoulli random variables is conditioned on a given sequence of row and column sums.…
We provide rates of convergence in the central limit theorem in terms of projective criteria for adapted stationary sequences of centered random variables taking values in Banach spaces, with finite moment of order $p \in ]2,3]$ as soon as…
Estimation of the complete distribution of a random variable is a useful primitive for both manual and automated decision making. This problem has received extensive attention in the i.i.d. setting, but the arbitrary data dependent setting…
The intensity statistics of signals in the presence of Gaussian noise is obtained by studying the model of a random signal plus a random phasor sum. The additive Gaussian noise is shown to result in a Bessel transform of the probability…
The sum of symmetric Markov dependent three-point random variables is approximated by the difference of two independent Poisson random variables (Skellam random variable). The accuracy is estimated in local, total variation and Wasserstein…
The article starts with new aliasing-truncation error upper bounds in the sampling theorem for non-bandlimited stochastic signals. Then, it investigates $L_p([0,T])$ approximations of sub-Gaussian random signals. Explicit truncation error…
One can consider $\mu$-Martin-L\"of randomness for a probability measure $\mu$ on $2^{\omega}$, such as the Bernoulli measure $\mu_p$ given $p \in (0, 1)$. We study Bernoulli randomness of sequences in $n^{\omega}$ with parameters $p_0,…
Sums of of 1-dependent integer-valued random variables are approximated by compound Poisson, negative binomial and Binomial distributions and signed compound Poisson measures. Estimates are obtained for total variation and local metrics.…
We deduce in this short report the non-asymptotic for exponential tail of distribution for sums of independent centered random variables.
We propose an estimator for the mean of a random vector in $\mathbb{R}^d$ that can be computed in time $O(n^4+n^2d)$ for $n$ i.i.d.~samples and that has error bounds matching the sub-Gaussian case. The only assumptions we make about the…
We propose a novel algorithm for the support estimation of partially known Gaussian graphical models that incorporates prior information about the underlying graph. In contrast to classical approaches that provide a point estimate based on…
In this paper we use probabilistic methods to derive some results on the generalized Bernoulli and generalized Euler polynomials. Our approach is based on the properties of Appell polynomials associated with uniformly distributed and…