Subadditivity Re–Examined: the Case for Value–At–Risk∗
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Duality for Outer $ L^ P \Mu (\Ell^ R) $ Spaces and Relation to Tent Spaces
p r DUALITY FOR OUTER Lµpℓ q SPACES AND RELATION TO TENT SPACES MARCO FRACCAROLI p r Abstract. We prove that the outer Lµpℓ q spaces, introduced by Do and Thiele, are isomorphic to Banach spaces, and we show the expected duality properties between them for 1 ă p ď8, 1 ď r ă8 or p “ r P t1, 8u uniformly in the finite setting. In the case p “ 1, 1 ă r ď8, we exhibit a counterexample to uniformity. We show that in the upper half space setting these properties hold true in the full range 1 ď p,r ď8. These results are obtained via greedy p r decompositions of functions in Lµpℓ q. As a consequence, we establish the p p r equivalence between the classical tent spaces Tr and the outer Lµpℓ q spaces in the upper half space. Finally, we give a full classification of weak and strong type estimates for a class of embedding maps to the upper half space with a fractional scale factor for functions on Rd. 1. Introduction The Lp theory for outer measure spaces discussed in [13] generalizes the classical product, or iteration, of weighted Lp quasi-norms. Since we are mainly interested in positive objects, we assume every function to be nonnegative unless explicitly stated. We first focus on the finite setting. On the Cartesian product X of two finite sets equipped with strictly positive weights pY,µq, pZ,νq, we can define the classical product, or iterated, L8Lr,LpLr spaces for 0 ă p, r ă8 by the quasi-norms 1 r r kfkL8ppY,µq,LrpZ,νqq “ supp νpzqfpy,zq q yPY zÿPZ ´1 r 1 “ suppµpyq ωpy,zqfpy,zq q r , yPY zÿPZ p 1 r r p kfkLpppY,µq,LrpZ,νqq “ p µpyqp νpzqfpy,zq q q , arXiv:2001.05903v1 [math.CA] 16 Jan 2020 yÿPY zÿPZ where we denote by ω “ µ b ν the induced weight on X. -
Superadditive and Subadditive Transformations of Integrals and Aggregation Functions
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Portsmouth University Research Portal (Pure) Superadditive and subadditive transformations of integrals and aggregation functions Salvatore Greco⋆12, Radko Mesiar⋆⋆34, Fabio Rindone⋆⋆⋆1, and Ladislav Sipeky†3 1 Department of Economics and Business 95029 Catania, Italy 2 University of Portsmouth, Portsmouth Business School, Centre of Operations Research and Logistics (CORL), Richmond Building, Portland Street, Portsmouth PO1 3DE, United Kingdom 3 Department of Mathematics and Descriptive Geometry, Faculty of Civil Engineering Slovak University of Technology 810 05 Bratislava, Slovakia 4 Institute of Theory of Information and Automation Czech Academy of Sciences Prague, Czech Republic Abstract. We propose the concepts of superadditive and of subadditive trans- formations of aggregation functions acting on non-negative reals, in particular of integrals with respect to monotone measures. We discuss special properties of the proposed transforms and links between some distinguished integrals. Superaddi- tive transformation of the Choquet integral, as well as of the Shilkret integral, is shown to coincide with the corresponding concave integral recently introduced by Lehrer. Similarly the transformation of the Sugeno integral is studied. Moreover, subadditive transformation of distinguished integrals is also discussed. Keywords: Aggregation function; superadditive and subadditive transformations; fuzzy integrals. 1 Introduction The concepts of subadditivity and superadditivity are very important in economics. For example, consider a production function A : Rn R assigning to each vector of pro- + → + duction factors x = (x1,...,xn) the corresponding output A(x1,...,xn). If one has available resources given by the vector x =(x1,..., xn), then, the production function A assigns the output A(x1,..., xn). -
Var and Other Risk Measures
What is Risk? Risk Measures Methods of estimating risk measures Bibliography VaR and other Risk Measures Francisco Ramírez Calixto International Actuarial Association November 27th, 2018 Francisco Ramírez Calixto VaR and other Risk Measures What is Risk? Risk Measures Methods of estimating risk measures Bibliography Outline 1 What is Risk? 2 Risk Measures 3 Methods of estimating risk measures Francisco Ramírez Calixto VaR and other Risk Measures What is Risk? Risk Measures Methods of estimating risk measures Bibliography What is Risk? Risk 6= size of loss or size of a cost Risk lies in the unexpected losses. Francisco Ramírez Calixto VaR and other Risk Measures What is Risk? Risk Measures Methods of estimating risk measures Bibliography Types of Financial Risk In Basel III, there are three major broad risk categories: Credit Risk: Francisco Ramírez Calixto VaR and other Risk Measures What is Risk? Risk Measures Methods of estimating risk measures Bibliography Types of Financial Risk Operational Risk: Francisco Ramírez Calixto VaR and other Risk Measures What is Risk? Risk Measures Methods of estimating risk measures Bibliography Types of Financial Risk Market risk: Each one of these risks must be measured in order to allocate economic capital as a buer so that if a catastrophic event happens, the bank won't go bankrupt. Francisco Ramírez Calixto VaR and other Risk Measures What is Risk? Risk Measures Methods of estimating risk measures Bibliography Risk Measures Def. A risk measure is used to determine the amount of an asset or assets (traditionally currency) to be kept in reserve in order to cover for unexpected losses. -
A Mini-Introduction to Information Theory
A Mini-Introduction To Information Theory Edward Witten School of Natural Sciences, Institute for Advanced Study Einstein Drive, Princeton, NJ 08540 USA Abstract This article consists of a very short introduction to classical and quantum information theory. Basic properties of the classical Shannon entropy and the quantum von Neumann entropy are described, along with related concepts such as classical and quantum relative entropy, conditional entropy, and mutual information. A few more detailed topics are considered in the quantum case. arXiv:1805.11965v5 [hep-th] 4 Oct 2019 Contents 1 Introduction 2 2 Classical Information Theory 2 2.1 ShannonEntropy ................................... .... 2 2.2 ConditionalEntropy ................................. .... 4 2.3 RelativeEntropy .................................... ... 6 2.4 Monotonicity of Relative Entropy . ...... 7 3 Quantum Information Theory: Basic Ingredients 10 3.1 DensityMatrices .................................... ... 10 3.2 QuantumEntropy................................... .... 14 3.3 Concavity ......................................... .. 16 3.4 Conditional and Relative Quantum Entropy . ....... 17 3.5 Monotonicity of Relative Entropy . ...... 20 3.6 GeneralizedMeasurements . ...... 22 3.7 QuantumChannels ................................... ... 24 3.8 Thermodynamics And Quantum Channels . ...... 26 4 More On Quantum Information Theory 27 4.1 Quantum Teleportation and Conditional Entropy . ......... 28 4.2 Quantum Relative Entropy And Hypothesis Testing . ......... 32 4.3 Encoding -
Comparative Analyses of Expected Shortfall and Value-At-Risk Under Market Stress1
Comparative analyses of expected shortfall and value-at-risk under market stress1 Yasuhiro Yamai and Toshinao Yoshiba, Bank of Japan Abstract In this paper, we compare value-at-risk (VaR) and expected shortfall under market stress. Assuming that the multivariate extreme value distribution represents asset returns under market stress, we simulate asset returns with this distribution. With these simulated asset returns, we examine whether market stress affects the properties of VaR and expected shortfall. Our findings are as follows. First, VaR and expected shortfall may underestimate the risk of securities with fat-tailed properties and a high potential for large losses. Second, VaR and expected shortfall may both disregard the tail dependence of asset returns. Third, expected shortfall has less of a problem in disregarding the fat tails and the tail dependence than VaR does. 1. Introduction It is a well known fact that value-at-risk2 (VaR) models do not work under market stress. VaR models are usually based on normal asset returns and do not work under extreme price fluctuations. The case in point is the financial market crisis of autumn 1998. Concerning this crisis, CGFS (1999) notes that “a large majority of interviewees admitted that last autumn’s events were in the “tails” of distributions and that VaR models were useless for measuring and monitoring market risk”. Our question is this: Is this a problem of the estimation methods, or of VaR as a risk measure? The estimation methods used for standard VaR models have problems for measuring extreme price movements. They assume that the asset returns follow a normal distribution. -
An Upper Bound on the Size of Diamond-Free Families of Sets
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Repository of the Academy's Library An upper bound on the size of diamond-free families of sets Dániel Grósz∗ Abhishek Methuku† Casey Tompkins‡ Abstract Let La(n, P ) be the maximum size of a family of subsets of [n] = {1, 2,...,n} not containing P as a (weak) subposet. The diamond poset, denoted Q2, is defined on four elements x,y,z,w with the relations x < y,z and y,z < w. La(n, P ) has been studied for many posets; one of the major n open problems is determining La(n, Q2). It is conjectured that La(n, Q2) = (2+ o(1))⌊n/2⌋, and infinitely many significantly different, asymptotically tight constructions are known. Studying the average number of sets from a family of subsets of [n] on a maximal chain in the Boolean lattice 2[n] has been a fruitful method. We use a partitioning of the maximal chains and n introduce an induction method to show that La(n, Q2) ≤ (2.20711 + o(1))⌊n/2⌋, improving on the n earlier bound of (2.25 + o(1))⌊n/2⌋ by Kramer, Martin and Young. 1 Introduction Let [n]= 1, 2,...,n . The Boolean lattice 2[n] is defined as the family of all subsets of [n]= 1, 2,...,n , and the ith{ level of 2}[n] refers to the collection of all sets of size i. In 1928, Sperner proved the{ following} well-known theorem. Theorem 1.1 (Sperner [24]). -
5 Norms on Linear Spaces
5 Norms on Linear Spaces 5.1 Introduction In this chapter we study norms on real or complex linear linear spaces. Definition 5.1. Let F = (F, {0, 1, +, −, ·}) be the real or the complex field. A semi-norm on an F -linear space V is a mapping ν : V −→ R that satisfies the following conditions: (i) ν(x + y) ≤ ν(x)+ ν(y) (the subadditivity property of semi-norms), and (ii) ν(ax)= |a|ν(x), for x, y ∈ V and a ∈ F . By taking a = 0 in the second condition of the definition we have ν(0)=0 for every semi-norm on a real or complex space. A semi-norm can be defined on every linear space. Indeed, if B is a basis of V , B = {vi | i ∈ I}, J is a finite subset of I, and x = i∈I xivi, define νJ (x) as P 0 if x = 0, νJ (x)= ( j∈J |aj | for x ∈ V . We leave to the readerP the verification of the fact that νJ is indeed a seminorm. Theorem 5.2. If V is a real or complex linear space and ν : V −→ R is a semi-norm on V , then ν(x − y) ≥ |ν(x) − ν(y)|, for x, y ∈ V . Proof. We have ν(x) ≤ ν(x − y)+ ν(y), so ν(x) − ν(y) ≤ ν(x − y). (5.1) 160 5 Norms on Linear Spaces Since ν(x − y)= |− 1|ν(y − x) ≥ ν(y) − ν(x) we have −(ν(x) − ν(y)) ≤ ν(x) − ν(y). (5.2) The Inequalities 5.1 and 5.2 give the desired inequality. -
Contrasting Stochastic and Support Theory Interpretations of Subadditivity
Error and Subadditivity 1 A Stochastic Model of Subadditivity J. Neil Bearden University of Arizona Thomas S. Wallsten University of Maryland Craig R. Fox University of California-Los Angeles RUNNING HEAD: SUBADDITIVITY AND ERROR Please address all correspondence to: J. Neil Bearden University of Arizona Department of Management and Policy 405 McClelland Hall Tucson, AZ 85721 Phone: 520-603-2092 Fax: 520-325-4171 Email address: [email protected] Error and Subadditivity 2 Abstract This paper demonstrates both formally and empirically that stochastic variability is sufficient for, and at the very least contributes to, subadditivity of probability judgments. First, making rather weak assumptions, we prove that stochastic variability in mapping covert probability judgments to overt responses is sufficient to produce subadditive judgments. Three experiments follow in which participants provided repeated probability estimates. The results demonstrate empirically the contribution of random error to subadditivity. The theorems and the experiments focus on within-respondent variability, but most studies use between-respondent designs. We use numerical simulations to extend the work to contrast within- and between-respondent measures of subadditivity. Methodological implications of all the results are discussed, emphasizing the importance of taking stochastic variability into account when estimating the role of other factors (such as the availability bias) in producing subadditive judgments. Error and Subadditivity 3 A Stochastic Model of Subadditivity People are often called on the map their subjective degree of belief to a number on the [0,1] probability interval. Researchers established early on that probability judgments depart systematically from normative principles of Bayesian updating (e.g., Phillips & Edwards, 1966). -
Lecture 1 1 Introduction 2 How to Measure Information? 3 Notation
CSE533: Information Theory in Computer Science September 28, 2010 Lecture 1 Lecturer: Anup Rao Scribe: Anup Rao 1 Introduction Information theory is the study of a broad variety of topics having to do with quantifying the amount of information carried by a random variable or collection of random variables, and reasoning about this information. In this course, we shall see a quick primer on basic concepts in information theory, before switching gears and getting a taste for a few domains in computer science where these concepts have been used to prove beautiful results. 2 How to measure information? There are several ways in which one might try to measure the information carried by a random variable. • We could measure how much space it takes to store the random variable, on average. For example, if X is uniformly random n-bit string, it takes n-bits of storage to write down the value of X. If X is such that there is a string a such that Pr[X = a] = 1=2, we can save on the space by encoding X so that 0 represents a and all other strings are encoded with a leading 1. With this encoding, the expected amount of space we need to store X is at most n=2 + 1. • We could measure how unpredictable X is in terms of what the probability of success is for an algorithm that tries to guess the value of X before it is sampled. If X is a uniformly random string, the best probability is 2−n. If X is as in the second example, this probability is 1=2. -
MATH 421/510 Assignment 1
MATH 421/510 Assignment 1 Suggested Solutions January 2018 All exercises from Folland, section 5.1. \Problem 1 (6)" below, for instance, indicates that the first problem on this assignment is Exercise 5.1.6 in Folland. Problem 1 (6). Suppose that X is a finite-dimensional normed space. Let e1; e2; : : : ; en Pn Pn be a basis for X, and define k 1 ajejk1 = 1 jajj. a) k · k1 is a norm on X. Pn n b) The map (a1; : : : ; an) 7! 1 ajej is continuous from K with the usual Euclidean topology to X with the topology defined by k · k1. c) fx 2 X : kxk1 = 1g is compact in X. d) All norms on X are equivalent. (Compare any norm to k · k1.) Solution. a) As always, we need to check positivity, homogeneity, and subadditivity. • Positivity: Pn Let x = j=1 ajej. Then kxk1 ≥ 0. Suppose that x 6= 0. Then aj 6= 0 for some 1 ≤ j ≤ n, and hence n X kxk1 = jaij ≥ jajj > 0 i=1 Conversely, suppose that x = 0. Then aj = 0 for each 1 ≤ j ≤ n, so kxk1 = 0. Pn • Homogeneity: Let x = j=1 ajej as before and let c 2 K. We compute directly: n n n n X X X X kcxk1 = c ajej = (caj)ej = jcajj = jcj jajj = jcjkxk1 j=1 1 j=1 1 j=1 j=1 as required. 1 Pn Pn • Subadditivity: If x = j=1 ajej and b = j=1 bjej, then n n n n X X X X kx + yk1 = (aj + bj)ej = jaj + bjj ≤ jajj + jbjj = kxk1 + kyk1: j=1 1 j=1 j=1 j=1 n b) Let k · k2 denote the Euclidean norm on K . -
SUBADDITIVE FUNCTIONS of ONE REAL VARIABLE by RICHARD
SUBADDITIVE FUNCTIONS OF ONE REAL VARIABLE I By RICHARD GEORGE LAATSCH" Bachelor of Science Central Missouri State College Warrensburg, Missouri 1953 Master of Arts University of Missouri Columbia, Missouri 1957 Submitted to the Faculty of the Graduate School of the Oklahoma State University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY l"lay, 1962 L \ \ \ s (. 0 f . ?. OKLAHOMA STATE UNIVERSITY LIBRARY NOV 8 1962 SUBADDITIVE FUNCTIONS OF ONE REAL VARIABLE Thesis Approved: Thesis Adviser <D�ff/�� ~ ~ffcL~~\, -y1o-z..<A/ [:.. ~ ~~~ Dean of the Graduate School 504544 ii PREFACE This paper is concerned with certain problems in the theory of subadditive functions of a real variable. The basic definitions appear on page 1 and the entire first chapter serves as an introduction and orientation to the remaining materialo Chapter II contains a basic rotation theorem and some lemmas on continuity and boundedness which will be used in later chapters. Chapters III and IV deal with several kinds of extensions of functions which yield or preserve subadditivity; in particular, Chapter III is devoted to the maximal subadditive extension to E = [O ,co) of a subaddi tive function on [O, a]. Contrary to previous work on this topic, no assumptions of continuity are made. The last three chapters are devoted to sets of subad ditive functions. Chapter V discusses convergence, espe cially uniform convergence, of subadditive functions - motivated by a theorem of Bruckner -- and gives an example (the Cantor function) of a monotone subadditive function with unusual propertieso In Chapters VI and VII convex cones of subadditive functions are discussed and the ex tremal element problems considered. -
Divergence-Based Risk Measures: a Discussion on Sensitivities and Extensions
entropy Article Divergence-Based Risk Measures: A Discussion on Sensitivities and Extensions Meng Xu 1 and José M. Angulo 2,* 1 School of Economics, Sichuan University, Chengdu 610065, China 2 Department of Statistics and Operations Research, University of Granada, 18071 Granada, Spain * Correspondence: [email protected]; Tel.: +34-958-240492 Received: 13 June 2019; Accepted: 24 June 2019; Published: 27 June 2019 Abstract: This paper introduces a new family of the convex divergence-based risk measure by specifying (h, f)-divergence, corresponding with the dual representation. First, the sensitivity characteristics of the modified divergence risk measure with respect to profit and loss (P&L) and the reference probability in the penalty term are discussed, in view of the certainty equivalent and robust statistics. Secondly, a similar sensitivity property of (h, f)-divergence risk measure with respect to P&L is shown, and boundedness by the analytic risk measure is proved. Numerical studies designed for Rényi- and Tsallis-divergence risk measure are provided. This new family integrates a wide spectrum of divergence risk measures and relates to divergence preferences. Keywords: convex risk measure; preference; sensitivity analysis; ambiguity; f-divergence 1. Introduction In the last two decades, there has been a substantial development of a well-founded risk measure theory, particularly propelled since the axiomatic approach introduced by [1] in relation to the concept of coherency. While, to a large extent, the theory has been fundamentally inspired and motivated with financial risk assessment objectives in perspective, many other areas of application are currently or potentially benefited by the formal mathematical construction of the discipline.