相关论文: Sharp probability estimates for generalized Smirno…

We establish large deviation type estimates for i.i.d. products of two dimensional random matrices with finitely supported probability distribution. The estimates are stable under perturbations and require no irreducibility assumptions. In…

Finite sample bounds on the estimation error of the mean by the empirical mean, uniform over a class of functions, can often be conveniently obtained in terms of Rademacher or Gaussian averages of the class. If a function of n variables has…

In this paper, we propose a method based on GMM (the generalized method of moments) to estimate the parameters of stable distributions with $0<\alpha<2$. We don't assume symmetry for stable distributions.

For a random variable with a unimodal distribution and finite second moment Gau\ss \, (1823) proved a sharp bound on the probability of the random variable to be outside a symmetric interval around its mode. An alternative proof for it is…

Establishing the convergence of splines can be cast as a variational problem which is amenable to a $\Gamma$-convergence approach. We consider the case in which the regularization coefficient scales with the number of observations, $n$, as…

We consider a situation where the distribution of a random variable is being estimated by the empirical distribution of noisy measurements of that variable. This is common practice in, for example, teacher value-added models and other…

We present new explicit upper bounds for the smoothness of the distribution of the random diagonal sum $S_n=\sum_{j=1}^nX_{j,\pi(j)}$ of a random $n\times n$ matrix $X=(X_{j,r})$, where the $X_{j,r}$ are independent integer valued random…

Using recent results from the theory of integer points close to smooth curves, we give an asymptotic formula for the distribution of values of a class of integer-valued prime-independent multiplicative functions.

A definition for the statistical significance of a signal in an experiment is proposed by establishing a correlation between the observed p-value and the normal distribution integral probability, which is suitable for both counting…

The randomly oriented graph $G_{n,p}^{\sigma}$ is an Erd\H{o}s-R\'enyi random graph $G_{n,p}$ with a random orientation $\sigma$, which assigns to each edge a direction so that $G_{n,p}^{\sigma}$ becomes a directed graph. Denote by $S_n$…

A stochastic algorithm is proposed, finding the set of generalized means associated to a probability measure on a compact Riemannian manifold M and a continuous cost function on the product of M by itself. Generalized means include p-means…

We consider estimating the proportion of random variables for two types of composite null hypotheses: (i) the means or medians of the random variables belonging to a non-empty, bounded interval; (ii) the means or medians of the random…

Consider a discrete-time one-dimensional supercritical branching random walk. We study the probability that there exists an infinite ray in the branching random walk that always lies above the line of slope $\gamma-\epsilon$, where $\gamma$…

We study the empirical likelihood approach to construct confidence intervals for the optimal value and the optimality gap of a given solution, henceforth quantify the statistical uncertainty of sample average approximation, for optimization…

This paper deals with the problem of quantifying the approximation a probability measure by means of an empirical (in a wide sense) random probability measure, depending on the first n terms of a sequence of random elements. In Section 2,…

A systematic study of the probability distribution of superimposed random codes is presented through the use of generating functions. Special attention is paid to the cases of either uniformly distributed but not necessarily independent or…

We prove the unexpected result that almost uniform sampling of independent sets in graphs is possible via a probabilistic polynomial time algorithm. Note that our sampling algorithm (if correct) has extremely surprising consequences; the…

Let $M_n=\max \left(X_1, X_2, \ldots, X_n \right)$ denote the partial maximum of an independent and identically distributed skew-normal random sequence. In this paper, the rate of uniform convergence of skew-normal extremes is derived. It…

We prove almost Strichartz estimates found after adding regularity in the spherical coordinates for Schr\"odinger-like equations. The estimates are sharp up to endpoints. The proof relies on estimates involving spherical averages. Sharpness…

This paper presents foundational theoretical results on distributed parameter estimation for undirected probabilistic graphical models. It introduces a general condition on composite likelihood decompositions of these models which…