scholarly journals Families of Well Approximable Measures

2021 ◽  
Vol 16 (1) ◽  
pp. 53-70
Author(s):  
Samantha Fairchild ◽  
Max Goering ◽  
Christian Weiß

Abstract We provide an algorithm to approximate a finitely supported discrete measure μ by a measure νN corresponding to a set of N points so that the total variation between μ and νN has an upper bound. As a consequence if μ is a (finite or infinitely supported) discrete probability measure on [0, 1] d with a sufficient decay rate on the weights of each point, then μ can be approximated by νN with total variation, and hence star-discrepancy, bounded above by (log N)N− 1. Our result improves, in the discrete case, recent work by Aistleitner, Bilyk, and Nikolov who show that for any normalized Borel measure μ, there exist finite sets whose star-discrepancy with respect to μ is at most ( log   N ) d − 1 2 N − 1 {\left( {\log \,N} \right)^{d - {1 \over 2}}}{N^{ - 1}} . Moreover, we close a gap in the literature for discrepancy in the case d =1 showing both that Lebesgue is indeed the hardest measure to approximate by finite sets and also that all measures without discrete components have the same order of discrepancy as the Lebesgue measure.

2008 ◽  
Vol 58 (3) ◽  
pp. 161-189 ◽  
Author(s):  
Ken’ichi Katou ◽  
Naoki Makimoto ◽  
Yukio Takahashi

2002 ◽  
Vol 34 (03) ◽  
pp. 609-625 ◽  
Author(s):  
N. Papadatos ◽  
V. Papathanasiou

The random variablesX1,X2, …,Xnare said to be totally negatively dependent (TND) if and only if the random variablesXiand ∑j≠iXjare negatively quadrant dependent for alli. Our main result provides, for TND 0-1 indicatorsX1,x2, …,Xnwith P[Xi= 1] =pi= 1 - P[Xi= 0], an upper bound for the total variation distance between ∑ni=1Xiand a Poisson random variable with mean λ ≥ ∑ni=1pi. An application to a generalized birthday problem is considered and, moreover, some related results concerning the existence of monotone couplings are discussed.


2015 ◽  
Vol 29 (1) ◽  
pp. 93-117
Author(s):  
Mieczysław Kula ◽  
Małgorzata Serwecińska

AbstractThe paper is devoted to the communication complexity of lattice operations in linearly ordered finite sets. All well known techniques ([4, Chapter 1]) to determine the communication complexity of the infimum function in linear lattices disappoint, because a gap between the lower and upper bound is equal to O(log2n), where n is the cardinality of the lattice. Therefore our aim will be to investigate the communication complexity of the function more carefully. We consider a family of so called interval protocols and we construct the interval protocols for the infimum. We prove that the constructed protocols are optimal in the family of interval protocols. It is still open problem to compute the communication complexity of constructed protocols but the numerical experiments show that their complexity is less than the complexity of known protocols for the infimum function.


2015 ◽  
Author(s):  
Γεώργιος Παπαγιάννης

The main aim of the present thesis is to investigate the effect of diverging priors concerning model uncertainty on decision making. One of the main issues in the thesis is to assess the effect of different notions of distance in the space of probability measures and their use as loss functionals in the process of identifying the best suited model among a set of plausible priors. Another issue, is that of addressing the problem of ``inhomogeneous" sets of priors, i.e. sets of priors that highly divergent opinions may occur, and the need to robustly treat that case. As high degrees of inhomogeneity may lead to distrust of the decision maker to the priors it may be desirable to adopt a particular prior corresponding to the set which somehow minimizes the ``variability" among the models on the set. This leads to the notion of Frechet risk measure. Finally, an important problem is the actual calculation of robust risk measures. An account of their variational definition, the problem of calculation leads to the numerical treatment of problems of the calculus of variations for which reliable and effective algorithms are proposed. The contributions of the thesis are presented in the following three chapters. In Chapter 2, a statistical learning scheme is introduced for constructing the best model compatible with a set of priors provided by different information sources of varying reliability. As various priors may model well different aspects of the phenomenon the proposed scheme is a variational scheme based on the minimization of a weighted loss function in the space of probability measures which in certain cases is shown to be equivalent to weighted quantile averaging schemes. Therefore in contrast to approaches such as minimax decision theory in which a particular element of the prior set is chosen we construct for each prior set a probability measure which is not necessarily an element of it, a fact that as shown may lead to better description of the phenomenon in question. While treating this problem we also address the issue of the effect of the choice of distance functional in the space of measures on the problem of model selection. One of the key findings in this respect is that the class of Wasserstein distances seems to have the best performance as compared to other distances such as the KL-divergence. In Chapter 3, motivated by the results of Chapter 2, we treat the problem of specifying the risk measure for a particular loss when a set of highly divergent priors concerning the distribution of the loss is available. Starting from the principle that the ``variability" of opinions is not welcome, a fact for which a strong axiomatic framework is provided (see e.g. Klibanoff (2005) and references therein) we introduce the concept of Frechet risk measures, which corresponds to a minimal variance risk measure. Here we view a set of priors as a discrete measure on the space of probability measures and by variance we mean the variance of this discrete probability measure. This requires the use of the concept of Frechet mean. By different metrizations of the space of probability measures we define a variety of Frechet risk measures, the Wasserstein, the Hellinger and the weighted entropic risk measure, and illustrate their use and performance via an example related to the static hedging of derivatives under model uncertainty. In Chapter 4, we consider the problem of numerical calculation of convex risk measures applying techniques from the calculus of variations. Regularization schemes are proposed and the theoretical convergence of the algorithms is considered.


1962 ◽  
Vol 14 ◽  
pp. 597-601 ◽  
Author(s):  
J. Kiefer

The main object of this paper is to prove the following:Theorem. Let f1, … ,fk be linearly independent continuous functions on a compact space. Then for 1 ≤ s ≤ k there exist real numbers aij, 1 ≤ i ≤ s, 1 ≤ j ≤ k, with {aij, 1 ≤ i, j ≤ s} n-singular, and a discrete probability measure ε*on, such that(a) the functions gi = Σj=1kaijfj 1 ≤ i ≤ s, are orthonormal (ε*) to the fj for s < j ≤ k;(b)The result in the case s = k was first proved in (2). The result when s < k, which because of the orthogonality condition of (a) is more general than that when s = k, was proved in (1) under a restriction which will be discussed in § 3. The present proof does not require this ad hoc restriction, and is more direct in approach than the method of (2) (although involving as much technical detail as the latter in the case when the latter applies).


2002 ◽  
Vol 34 (3) ◽  
pp. 609-625 ◽  
Author(s):  
N. Papadatos ◽  
V. Papathanasiou

The random variables X1, X2, …, Xn are said to be totally negatively dependent (TND) if and only if the random variables Xi and ∑j≠iXj are negatively quadrant dependent for all i. Our main result provides, for TND 0-1 indicators X1, x2, …, Xn with P[Xi = 1] = pi = 1 - P[Xi = 0], an upper bound for the total variation distance between ∑ni=1Xi and a Poisson random variable with mean λ ≥ ∑ni=1pi. An application to a generalized birthday problem is considered and, moreover, some related results concerning the existence of monotone couplings are discussed.


2000 ◽  
Vol 37 (03) ◽  
pp. 705-717 ◽  
Author(s):  
Peter Donnelly ◽  
Eliane R. Rodrigues

Consider a population of fixed size consisting of N haploid individuals. Assume that this population evolves according to the two-allele neutral Moran model in mathematical genetics. Denote the two alleles by A 1 and A 2. Allow mutation from one type to another and let 0 &lt; γ &lt; 1 be the sum of mutation probabilities. All the information about the population is recorded by the Markov chain X = (X(t)) t≥0 which counts the number of individuals of type A 1. In this paper we study the time taken for the population to ‘reach’ stationarity (in the sense of separation and total variation distances) when initially all individuals are of one type. We show that after t ∗ = Nγ-1logN + cN the separation distance between the law of X(t ∗) and its stationary distribution converges to 1 - exp(-γe-γc ) as N → ∞. For the total variation distance an asymptotic upper bound is obtained. The results depend on a particular duality, and couplings, between X and a genealogical process known as the lines of descent process.


2000 ◽  
Vol 37 (3) ◽  
pp. 705-717 ◽  
Author(s):  
Peter Donnelly ◽  
Eliane R. Rodrigues

Consider a population of fixed size consisting of N haploid individuals. Assume that this population evolves according to the two-allele neutral Moran model in mathematical genetics. Denote the two alleles by A1 and A2. Allow mutation from one type to another and let 0 < γ < 1 be the sum of mutation probabilities. All the information about the population is recorded by the Markov chain X = (X(t))t≥0 which counts the number of individuals of type A1. In this paper we study the time taken for the population to ‘reach’ stationarity (in the sense of separation and total variation distances) when initially all individuals are of one type. We show that after t∗ = Nγ-1logN + cN the separation distance between the law of X(t∗) and its stationary distribution converges to 1 - exp(-γe-γc) as N → ∞. For the total variation distance an asymptotic upper bound is obtained. The results depend on a particular duality, and couplings, between X and a genealogical process known as the lines of descent process.


1959 ◽  
Vol 11 ◽  
pp. 583-592 ◽  
Author(s):  
Louis de Branges

Let be the Fourier transform of a Borel measure of finite total variation. The formulacan be justified if the integral on the right converges absolutely. ForwhereNow let h → 0 in both sides of this equation and use the Lebesgue dominated convergence theorem.


Sign in / Sign up

Export Citation Format

Share Document