Related papers: Constructing measures with identical moments
This short note gives a sufficient condition for having the class of polynomials dense in the space of square integrable functions with respect to a finite measure dominated by the Lebesgue measure in the real line, here denoted by $L^2$.…
We present an approach to the verification of systems for whose description some elements - constants or functions - are underspecified and can be regarded as parameters, and, in particular, describe a method for automatically generating…
Given an even number of points in a plane, we are interested in matching all the points by straight line segments so that the segments do not cross. Bottleneck matching is a matching that minimizes the length of the longest segment. For…
We seek to find normative criteria of adequacy for nonmonotonic logic similar to the criterion of validity for deductive logic. Rather than stipulating that the conclusion of an inference be true in all models in which the premises are…
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…
Let $\mu$ and $\nu$ be two non-degenerate finite signed Borel measures defined on a proper convex cone of $\mathbb{R}^n$. We prove that if all convolution powers of $\mu$ and $\nu$ are appropriately equal (and non-zero) on a proper concave…
In this paper we study moment sequences of matrix-valued measures on compact intervals. A complete parametrization of such sequences is obtained via a symmetric version of matricial canonical moments. Furthermore, distinguished extensions…
Double machine learning provides $\sqrt{n}$-consistent estimates of parameters of interest even when high-dimensional or nonparametric nuisance parameters are estimated at an $n^{-1/4}$ rate. The key is to employ Neyman-orthogonal moment…
We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…
We introduce a general framework to deterministically construct binary measurement matrices for compressed sensing. The proposed matrices are composed of (circulant) permutation submatrix blocks and zero submatrix blocks, thus making their…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
Calibration, the practice of choosing the parameters of a structural model to match certain empirical moments, can be viewed as minimum distance estimation. Existing standard error formulas for such estimators require a consistent estimate…
For a broad class of point processes, including determinantal point processes, we construct associated marked and conditional ensembles, which allow to study a random configuration in the point process, based on information about a randomly…
Suppose that a sequence of data points follows a distribution of a certain parametric form, but that one or more of the underlying parameters may change over time. This paper addresses various natural questions in such a framework. We…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
Given a metrizable topological vector space, we can also use its von Neumann bornology or its bornology of precompact subsets to do analysis. We show that the bornological and topological approaches are equivalent for many problems. For…
In this paper, we study the properties of a certain class of Borel measures on $\mathbb{R}^n$ that arise in the integral representation of Herglotz-Nevanlinna functions. In particular, we find that restrictions to certain hyperplanes are of…
In this paper we derive polynomial time algorithms that generate random $k$-noncrossing matchings and $k$-noncrossing RNA structures with uniform probability. Our approach employs the bijection between $k$-noncrossing matchings and…
This is an invitation to the probabilistic approach for constructing K\"ahler-Einstein metrics on complex projective algebraic manifolds X. The metrics in question emerge in the large N-limit from a canonical way of sampling N points on X,…
This paper proposes a simple unified inference approach on moment restrictions in the presence of nuisance parameters. The proposed test is constructed based on a new characterization that avoids the estimation of nuisance parameters and…