Related papers: Cram\'{e}r moderate deviations for a supercritical…
For the Narain-Horvitz-Thompson estimator to have usual asymptotic properties such as consistency, some conditions on the sampling design and on the variable of interest are needed. Cardot et al. (2010) give some sufficient conditions for…
We study polynomial time algorithms for estimating the mean of a heavy-tailed multivariate random vector. We assume only that the random vector $X$ has finite mean and covariance. In this setting, the radius of confidence intervals achieved…
Samples with a common mean but possibly different, ordered variances arise in various fields such as interlaboratory experiments, field studies or the analysis of sensor data. Estimators for the common mean under ordered variances typically…
This article is concerned with Monte-Carlo methods for the estimation of the trace of an implicitly given matrix $A$ whose information is only available through matrix-vector products. Such a method approximates the trace by an average of…
We derive Cram\'{e}r type moderate deviations for stationary sequences of bounded random variables. Our results imply the moderate deviation principles and a Berry-Esseen bound. Applications to quantile coupling inequalities, functions of…
We consider the process $\widehat\Lambda_n-\Lambda_n$, where $\Lambda_n$ is a cadlag step estimator for the primitive $\Lambda$ of a nonincreasing function $\lambda$ on $[0,1]$, and $\widehat\Lambda_n$ is the least concave majorant of…
A moderate deviation principle for functionals, with at most quadratic growth, of moving average processes is established. The main assumptions on the moving average process are a Logarithmic Sobolev inequality for the driving random…
In this article, we give explicit bounds on the Wasserstein and the Kolmogorov distances between random variables lying in the first chaos of the Poisson space and the standard Normal distribution, using the results proved by Last, Peccati…
Monte Carlo matrix trace estimation is a popular randomized technique to estimate the trace of implicitly-defined matrices via averaging quadratic forms across several observations of a random vector. The most common approach to analyze the…
The Galton-Watson process is a Markov chain modeling the population size of independently reproducing particles giving birth to $k$ offspring with probability $p_k$, $k\ge0$. In this paper we consider {\it defective} Galton-Watson processes…
A properly scaled critical Galton-Watson process converges to a continuous state critical branching process $\xi(\cdot)$ as the number of initial individuals tends to infinity. We extend this classical result by allowing for overlapping…
We give a slight refinement to the process by which estimates for exponential sums are extracted from bounds for Vinogradov's mean value. Coupling this with the recent works of Wooley, and of Bourgain, Demeter and Guth, providing optimal…
We study the evolution of the population size distribution of a critical Galton-Watson process with infinite variance of the offspring size of particles assuming that the population size is unusually small at the distant moment $n$ of…
We consider a high-dimensional mean estimation problem over a binary hidden Markov model, which illuminates the interplay between memory in data, sample size, dimension, and signal strength in statistical inference. In this model, an…
Given a graph with a subset of labeled nodes, we are interested in the quality of the averaging estimator which for an unlabeled node predicts the average of the observations of its labeled neighbors. We rigorously study concentration…
Calculating a Monte Carlo standard error (MCSE) is an important step in the statistical analysis of the simulation output obtained from a Markov chain Monte Carlo experiment. An MCSE is usually based on an estimate of the variance of the…
In this paper, a linearized Crank-Nicolson Galerkin finite element method (FEM) for generalized Ginzburg-Landau equation (GLE) is considered, in which, the difference method in time and the standard Galerkin FEM are employed. Based on the…
We consider a recurrent Markov process which is an It\^o semi-martingale. The L\'evy kernel describes the law of its jumps. Based on observations X(0),X({\Delta}),...,X(n{\Delta}), we construct an estimator for the L\'evy kernel's density.…
In this paper, we study the concentration properties of quadratic forms associated with Markov chains using the martingale decomposition method introduced by Atchad\'e and Cattaneo (2014). In particular, we derive concentration inequalities…
In this work, we analyze the variance of a stochastic estimator for computing Schatten norms of matrices. The estimator extracts information from a single sketch of the matrix, that is, the product of the matrix with a few standard Gaussian…