Related papers: Random Moment Problems under Constraints

Generalized empirical likelihood and generalized method of moments are well spread methods of resolution of inverse problems in econometrics. Each method defines a specific semiparametric model for which it is possible to calculate…

In this work we study the rate of convergence in the central limit theorem for the Euclidean norm of random orthogonal projections of vectors chosen at random from an $\ell_p^n$-ball which has been obtained in [Alonso-Guti\'errez, Prochno,…

This paper expands the notion of robust moment problems to incorporate distributional ambiguity using Wasserstein distance as the ambiguity measure. The classical Chebyshev-Cantelli (zeroth partial moment) inequalities, Scarf and Lo (first…

Let $(Z_{n})$ be a supercritical branching process in a random environment $\xi $, and $W$ be the limit of the normalized population size $Z_{n}/\mathbb{E}[Z_{n}|\xi ]$. We show large and moderate deviation principles for the sequence $\log…

We study the general moment problem for measures on the real line, with polynomials replaced by more general spaces of entire functions. As a particular case, we describe measures that are uniquely determined by a restriction of their…

Computing the distribution of permanents of random matrices has been an outstanding open problem for several decades. In quantum computing, "anti-concentration" of this distribution is an unproven input for the proof of hardness of the task…

We compute the deterministic approximation for mixed fluctuation moments of products of deterministic matrices and general Sobolev functions of Wigner matrices. Restricting to polynomials, our formulas reproduce recent results of [Male,…

We establish relationships between the classical moments problems which are problems of a construction of a measure supported on a real line, on a half-line or on an interval from prescribed set of moments with the Boundary control approach…

We introduce a general random model of a combinatorial optimization problem with geometric structure that encapsulates both linear programming and integer linear programming. Let $Q$ be a bounded set called the feasible set, $E$ be an…

Covariances and variances of linear statistics of a point process can be written as integrals over the truncated two-point correlation function. When the point process consists of the eigenvalues of a random matrix ensemble, there are often…

We consider a system of diffusing particles on the real line in a quadratic external potential and with repulsive electrostatic interaction. The empirical measure process is known to converge weakly to a deterministic measure-valued process…

In this paper, we study high-dimensional random projections of $\ell_p^n$-balls. More precisely, for any $n\in\mathbb N$ let $E_n$ be a random subspace of dimension $k_n\in\{1,\ldots,n\}$ and $X_n$ be a random point in the unit ball of…

This paper deals with sequences of random variables belonging to a fixed chaos of order $q$ generated by a Poisson random measure on a Polish space. The problem is investigated whether convergence of the third and fourth moment of such a…

A smooth function of the second moments of $N$ continuous variables gives rise to an uncertainty relation if it is bounded from below. We present a method to systematically derive such bounds by generalizing an approach applied previously…

We bound the variance and other moments of a random vector based on the range of its realizations, thus generalizing inequalities of Popoviciu (1935) and Bhatia and Davis (2000) concerning measures on the line to several dimensions. This is…

This paper is focused on the statistical analysis of probability measures $\nu_{1},\ldots,\nu_{n}$ on $\mathbb{R}$ that can be viewed as independent realizations of an underlying stochastic process. We consider the situation of practical…

We consider a finite sequence of random points in a finite domain of a finite-dimensional Euclidean space. The points are sequentially allocated in the domain according to a model of cooperative sequential adsorption. The main peculiarity…

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

The moments of random variables are fundamental statistical measures for characterizing the shape of a probability distribution, encompassing metrics such as mean, variance, skewness, and kurtosis. Additionally, the product moments,…

The non-convexity and intractability of distributionally robust chance constraints make them challenging to cope with. From a data-driven perspective, we propose formulating it as a robust optimization problem to ensure that the…