Properties of moments of random variables
|
|
- Johnathan Lawson
- 7 years ago
- Views:
Transcription
1 Properties of moments of rom variables Jean-Marie Dufour Université de Montréal First version: May 1995 Revised: January 23 This version: January 14, 23 Compiled: January 14, 23, 1:5pm This work was supported by the Canada Research Chair Program (Chair in Econometrics, Université de Montréal), the Alexer-von-Humboldt Foundation (Germany), the Canadian Network of Centres of Excellence [program on Mathematics of Information Technology Complex Systems (MITACS)], the Canada Council for the Arts (Killam Fellowship), the Natural Sciences Engineering Research Council of Canada, the Social Sciences Humanities Research Council of Canada, the Fonds FCAR (Government of Québec). Canada Research Chair Holder (Econometrics). Centre interuniversitaire de recherche en analyse des organisations (CIRANO), Centre interuniversitaire de recherche en économie quantitative (CIREQ), Département de sciences économiques, Université de Montréal. Mailing address: Département de sciences économiques, Université de Montréal, C.P succursale Centre-ville, Montréal, Québec, Canada H3C 3J7. TEL: ; FAX: ; jean.marie.dufour@umontreal.ca. Web page:
2 Contents List of Definitions, Propositions Theorems ii 1. Existence of moments 1 2. Moment inequalities 1 3. Markov-type inequalities 2 4. Moments behavior of tail areas 4 5. Moments of sums of rom variables 6 6. Proofs 9 List of Definitions, Propositions Theorems 1.1 Proposition : Existence of absolute ordinary moments Proposition : Monotonicity of L r Proposition : c r -inequality Proposition : Mean form of c r -inequality Proposition : Closure of L r Proposition : Hölder inequality Proposition : Cauchy-Schwarz inequality Proposition : Minkowski inequality Proposition : Moment monotonicity Theorem : Liapunov theorem Proposition : Lower bounds on the moments of a sum Proposition : Jensen inequality Proposition : Markov inequalities Proposition : Chebyshev inequalities Proposition : Refined Markov inequalities Proposition : Moment existence tail area decay Proposition : Distribution decomposition of r-moments Proposition : Distribution decomposition of the first absolute moment Corollary : Moment-tail area inequalities Proposition : Mean-tail area inequalities Proposition : Bounds on the absolute moments of a sum of rom variables 6 i
3 5.2 Proposition : Minkowski inequality for n variables Proposition : Bounds on the absolute moments of a sum of rom variables under conditional symmetry Proposition : Bounds on the absolute moments of a sum of rom variables under martingale condition Proposition : Bounds on the absolute moments of a sum of rom variables under two-sided martingale condition Proposition : Bounds on the absolute moments of a sum of independent rom variables Proof of Theorem Proof of Proposition ii
4 Let X Y be real rom variables, let r s be real positive constants (r >, s > ). The distribution functions of X Y are denoted F X (x) =P[X x] F Y (x) =P[Y x]. 1. Existence of moments 1.1 EXISTENCE OF ABSOLUTE AND ORDINARY MOMENTS. E( X ) always exists in the extended real numbers R R { } { } E( X ) [, ]; i.e., either E( X ) is a non-negative real number or E( X ) =. 1.2 E(X) exists is finite E( X ) <. 1.3 E( X ) < E(X) E( X ) <. 1.4 If <r s, then E( X s ) < E( X r ) <. (1.1) 1.5 MONOTONICITY OF L r. L s L r for <s r. 1.6 E( X r ) < E(X k ) exists is finite for all integers k such that <k r. 2. Moment inequalities 2.1 c r -INEQUALITY. E( X + Y r ) c r [E( X r )+E( Y r )] (2.1) where c r =1, if <r 1, =2 r 1, if r>1. (2.2) 2.2 MEAN FORM OF c r -INEQUALITY. E( 1 2 (X + Y ) r ) ( 1 2) r [E( X r )+E( Y r )], if <r 1, 1 2 [E( X r )+E( Y r )], if r>1. (2.3) 2.3 CLOSURE OF L r. Let a b be real numbers. Then X L r Y L r ax + by L r. (2.4) 1
5 2.4 HÖLDER INEQUALITY. Ifr>1 1 r + 1 s =1,then 2.5 CAUCHY-SCHWARZ INEQUALITY. 2.6 MINKOWSKI INEQUALITY. If r 1, then E( XY ) [E( X r )] 1/r [E( Y s )] 1/s. (2.5) E( XY ) [E(X 2 )] 1/2 [E(Y 2 )] 1/2. (2.6) E( X + Y r ) 1/r [E( X r )] 1/r +[E( Y r )] 1/r. (2.7) 2.7 MOMENT MONOTONICITY. [E( X r )] 1/r is a non-decreasing function of r, i.e. <r s [E( X r )] 1/r [E( X s )] 1/s. (2.8) 2.8 Theorem LIAPUNOV THEOREM. log[e( X r )] is a convex function of r, i.e. for any λ [, 1], log[e( X λr+(1 λ)s )] λ log[e( X r )] + (1 λ)log[e( X s )]. (2.9) 2.9 LOWER BOUNDS ON THE MOMENTS OF A SUM. IfE( X r ) <, E( Y r ) < E(Y X) =, then E( X + Y r ) E( X r ), for r 1. (2.1) 2.1 JENSEN INEQUALITY. If g(x) is a convex function on R E( X ) <, then, for any constant c R, g(c) E[g(X EX + c)] (2.11), in particular, 3. Markov-type inequalities g(ex) E[g(X)]. (2.12) 3.1 MARKOV INEQUALITIES. Let g : R R be a function such that g(x) is a real rom variable, E( g(x) ) < P[ g(x) M] =1 (3.1) 2
6 where M [, ]. If g(x) is a non-decreasing function on R, then, for all a R, E [g (X)] g (a) M P[X a] E [g (X)] g (a). (3.2) If g(x) is a non-decreasing function on [, ) g(x) =g( x) for any x, then, for all a, E [g (X)] g (a) E [g (X)] P[ X a] (3.3) M g (a) where / CHEBYSHEV INEQUALITIES. If P[ X M] =1,whereM [, ], then, for all a, E ( X r ) a r P[ X a] E ( X r ). (3.4) M r a r 3.3 Theorem REFINED MARKOV INEQUALITIES. Let g : R R be a function such that g(x) is a real rom variable, E( g(x) ) < g(x) M U for x A U, (3.5) g(x) M L for x A L, (3.6) where M U, M L, A U A L. Let also C U (g, a) = g(x) df X (x), C L (g, a) = g(x) df X (x). (3.7) [a, ) (,a] (a) If g(x) is nondecreasing on [A U, ), then, for a A U, C U (g, a) P[X a] C U(g, a). (3.8) M U g (a) (b) If g(x) is nonincreasing on (, A L ], then, for a A L, C L (g, a) P[X a] C L(g, a). (3.9) M L g (a) (c) If g(x) is nondecreasing on [A U, ) nonincreasing on (, A L ], then, for a 3
7 max{ A U, A L }, P[ X a] C U(g, a) g (a) + C L(g, a) g ( a) C U(g, a)+c L (g, a) min{g (a),g( a)}, (3.1) P[ X a] C U(g, a) + C L(g, a) M U M L C U(g, a)+c L (g, a). (3.11) max{m U,M L } 4. Moments behavior of tail areas 4.1 Proposition MOMENT EXISTENCE AND TAIL AREA DECAY. Let r >. If E( X r ) <, then In particular, if E( X ) <, then lim x {xr P [X x]} = lim x { x r P [X x]} = lim {x r P [ X x]} =. (4.1) x lim {x P [X x]} = lim { x P [X x]} x x = lim {x P [ X x]} =. (4.2) x 4.2 Theorem DISTRIBUTION DECOMPOSITION OF r-moments. Forany r>, x r df X (x) =r x r 1 [1 F X (x)]dx, (4.3) E( X r ) = r = r x r 1 P( X x)dx x r 1 [1 F X (x)+f X ( x)]dx, (4.4) E( X r ) < x r 1 P( X x) is integrable on (, + ) 4
8 x r 1 [1 F X (x)+f X ( x)] is integrable on (, + ) x r 1 [1 F X (x)]dx < x r 1 F X (x)dx <. (4.5) 4.3 Proposition DISTRIBUTION DECOMPOSITION OF THE FIRST ABSOLUTE MOMENT. xdf X (x) = E X = [1 F X (x)]dx, (4.6) P( X x)dx, (4.7) E( X ) < P( X x) is integrable on (, + ) [1 F X (x)+f X ( x)] is integrable on (, + ) [1 F X (x)]dx < F X (x)dx <. (4.8) 4.4 Proposition MOMENT-TAIL AREA INEQUALITIES. Let g(x) be a nonnegative strictly increasing function on [, ) let g 1 (x) be the inverse function of g. Then, P [ X g 1 (n) ] E[g(X)] n=1 P [ X >g 1 (n) ]. (4.9) n= In particular, for any r>, P( X n 1/r ) E( X r ) P( X >n 1/r ) n=1 1+ n= P(X >n 1/r ). (4.1) 4.5 Corollary MEAN-TAIL AREA INEQUALITIES. IfX is a positive rom variable, n=1 P(X n) E(X) 1+ n=1 P(X >n). (4.11) n=1 5
9 5. Moments of sums of rom variables In this section, we consider a sequence X 1,...,X n of rom variables, study the moments of the corresponding sum average: S n = X i, Xn = S n /n. (5.1) 5.1 Proposition BOUNDS ON THE ABSOLUTE MOMENTS OF A SUM OF RANDOM VARI- ABLES. E( S n r ) n E( X i r ), if <r 1, n r 1 n (5.2) E( X i r ), if r>1, E( X n r ) ( ) 1 r E( X n i r ), if <r 1, E( X i r ), if r>1. 1 n 5.2 Proposition MINKOWSKI INEQUALITY FOR n VARIABLES. Ifr 1, then (5.3) [E( S n r )] 1/r [E( X i r )] 1/r (5.4) [E( X n r )] 1/r 1 n [E( X i r )] 1/r { 1 n 1/r. E( X i )} r (5.5) 5.3 Proposition BOUNDS ON THE ABSOLUTE MOMENTS OF A SUM OF RANDOM VARI- ABLES UNDER CONDITIONAL SYMMETRY. If the distribution of X k+1 given S i is symmetric about zero for k =1,..., n 1, E( X i r ) <,,...,n,then E( S n r ) E( X i r ) for 1 r 2, (5.6) 6
10 E( X n r ) with equality holding when r =2. ( ) r 1 E( X i r ) for 1 r 2, (5.7) n 5.4 Proposition BOUNDS ON THE ABSOLUTE MOMENTS OF A SUM OF RANDOM VARI- ABLES UNDER MARTINGALE CONDITION. If E( X i r ) <,,..., n,then Furthermore, for r =2, E(X k+1 S k )= a.s., k =1,...,n 1, (5.8) E( S n r ) 2 E( X n r ) 2 E( X i r ), for 1 r 2, (5.9) ( ) r 1 E( X i r ), for 1 r 2. (5.1) n E(S n 2 )= E(Xi 2 ). (5.11) 5.5 Proposition BOUNDS ON THE ABSOLUTE MOMENTS OF A SUM OF RANDOM VARI- ABLES UNDER TWO-SIDED MARTINGALE CONDITION. Let S m(k) = m+1, i k X i, 1 k m +1 n. (5.12) If E(X k S m(k) )= a.s., for 1 k m +1 n, (5.13) E( X i r ) <,,..., n,then E( S n r ) ( 2 1 ) E( X i r ), for 1 r 2, (5.14) n E( X n r ) ( ) r ( ) E( X i r ), for 1 r 2. (5.15) n n 7
11 5.6 Proposition BOUNDS ON THE ABSOLUTE MOMENTS OF A SUM OF INDEPEN- DENT RANDOM VARIABLES. Let the rom variables X 1,...,X n be independent with E(X i )= E( X i r ) <,,..., n, let If D(r) < 1 1 r 2, then D(r) =[13.52/(2.6π) r ] Γ (r)sin(rπ/2). (5.16) E( S n r ) [1 D(r)] 1 E( X i r ), (5.17) E( X n r ) ( ) r 1 [1 D(r)] 1 E( X i r ), for 1 r 2. (5.18) n 8
12 6. Proofs 1.1 to 3.2. See Loève (1977, Volume I, Sections , pp ). For Jensen inequality, see also Chow Teicher (1988, Section 4.3, pp ). Hannan (1985), Lehmann Shaffer (1988), Piegorsch Casella (1988) Khuri Casella (22) discussed conditions for the existence of the moments of 1/X See von Bahr Esseen (1965, Lemma 3). PROOF OF THEOREM 3.3 (a) For x a A U, we have g (x) g (a) g (x) M U, hence C U (g, a) = g (x) df X (x) g (a) df X (x) =g (a) P [X a] [a, ) [a, ) g (x) df X (x) M U P [X a], [a, ) from which we get the inequality C U (g, a) P [X a] C U (g, a). M U g (a) (b) For x a A L, we have g (x) g (a) g (x) M L, hence C L (g, a) = g (x) df X (x) g (a) df X (x) =g (a) P [X a] [,a) [,a) g (x) df X (x) M L P [X a] [,a) from which we get the inequality C L (g, a) P [X a] C L (g, a). M L g (a) (c) For a max ( A U, A L ), we have a A U a A L, hence P [ X a] = P [X a]+p [X a] C U (g, a) + C L (g, a) g (a) g(a) 9
13 C U (g, a)+c L (g, a) min {g ( a),g( a)} P [ X a] C U (g, a) + C L (g, a) M U M L C U (g, a)+c L (g, a). max (M U,M L ) 4.1 to 4.3. See Feller (1966, Section V.6, Lemma 1), Chung (1974, Exercises 17-18), Serfling (198, Section 1.14, pp ) Chow Teicher (1988, Section 4.3, pp ). For other inequalities involving absolute moments, the reader may consult Beesack (1984) See Chow Teicher (1988, Section 4.1, Corollary 3, p. 9) The inequality (4.11) is given by Chung (1974, Theorem 3.2.1) Serfling (198, Section 1.3, p. 12) See von Bahr Esseen (1965), Chung (1974, p. 48) Chow Teicher (1988, p. 18) See Chung (1974, p. 48). PROOF OF PROPOSITION 5.2 The first inequality follows by recursion on applying the Minkowski inequality for two variables. The first part of the second inequality is obtained by multiplying both sides of the first one by (1/n). The second part follows on observing that the function x 1/r is concave in x for x> when r> See von Bahr Esseen (1965, Theorem 1) See von Bahr Esseen (1965, Theorem 2) See von Bahr Esseen (1965, Theorem 3) See von Bahr Esseen (1965, Theorem 4). 1
14 References BEESACK, P. R. (1984): Inequalities for Absolute Moments of a Distribution: From Laplace to von Mises, Journal of Mathematical Analysis Applications, 98, CHOW, Y.S., AND H. TEICHER (1988): Probability Theory. Independence, Interchangeability, Martingales. Second Edition. Springer-Verlag, New York. CHUNG, K. L. (1974): A Course in Probability Theory. Academic Press, New York, second edn. FELLER, W. (1966): An Introduction to Probability Theory its Applications, Volume II. John Wiley & Sons, New York. HANNAN, E. J. (1985): Letter to the Editor: "Sufficient Necessary Conditions for Finite Negative Moments", The American Statistician, 39, 326. KHURI, A., AND G. CASELLA (22): The Existence of the First Negative Moment Revisited, The American Statistician, 56, LEHMANN, E.L., AND J. P. SHAFFER (1988): Inverted Distributions, The American Statistician, 42, LOÈVE, M. (1977): Probability Theory, Volumes I II. Springer-Verlag, New York, 4th edn. PIEGORSCH, W. W., AND G. CASELLA (1988): The Existence of the First Negative Moment, The American Statistician, 39, SERFLING, R. J. (198): Approximation Theorems of Mathematical Statistics. John Wiley & Sons, New York. VON BAHR, B., AND C.-G. ESSEEN (1965): Inequalities for the rth Absolute Moment of a Sum of Rom Variables, 1 r 2, The Annals of Mathematical Statistics, 36,
Probability Generating Functions
page 39 Chapter 3 Probability Generating Functions 3 Preamble: Generating Functions Generating functions are widely used in mathematics, and play an important role in probability theory Consider a sequence
More informationIntroduction to time series analysis
Introduction to time series analysis Jean-Marie Dufour First version: December 1998 Revised: January 2003 This version: January 8, 2008 Compiled: January 8, 2008, 6:12pm This work was supported by the
More informationMath 431 An Introduction to Probability. Final Exam Solutions
Math 43 An Introduction to Probability Final Eam Solutions. A continuous random variable X has cdf a for 0, F () = for 0 <
More informationTail inequalities for order statistics of log-concave vectors and applications
Tail inequalities for order statistics of log-concave vectors and applications Rafał Latała Based in part on a joint work with R.Adamczak, A.E.Litvak, A.Pajor and N.Tomczak-Jaegermann Banff, May 2011 Basic
More informationMULTIVARIATE PROBABILITY DISTRIBUTIONS
MULTIVARIATE PROBABILITY DISTRIBUTIONS. PRELIMINARIES.. Example. Consider an experiment that consists of tossing a die and a coin at the same time. We can consider a number of random variables defined
More informationLecture 13: Martingales
Lecture 13: Martingales 1. Definition of a Martingale 1.1 Filtrations 1.2 Definition of a martingale and its basic properties 1.3 Sums of independent random variables and related models 1.4 Products of
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationRandom variables P(X = 3) = P(X = 3) = 1 8, P(X = 1) = P(X = 1) = 3 8.
Random variables Remark on Notations 1. When X is a number chosen uniformly from a data set, What I call P(X = k) is called Freq[k, X] in the courseware. 2. When X is a random variable, what I call F ()
More informationLecture 6: Discrete & Continuous Probability and Random Variables
Lecture 6: Discrete & Continuous Probability and Random Variables D. Alex Hughes Math Camp September 17, 2015 D. Alex Hughes (Math Camp) Lecture 6: Discrete & Continuous Probability and Random September
More informationTHE CENTRAL LIMIT THEOREM TORONTO
THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................
More informationChapter 4 Lecture Notes
Chapter 4 Lecture Notes Random Variables October 27, 2015 1 Section 4.1 Random Variables A random variable is typically a real-valued function defined on the sample space of some experiment. For instance,
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationInequalities of Analysis. Andrejs Treibergs. Fall 2014
USAC Colloquium Inequalities of Analysis Andrejs Treibergs University of Utah Fall 2014 2. USAC Lecture: Inequalities of Analysis The URL for these Beamer Slides: Inequalities of Analysis http://www.math.utah.edu/~treiberg/inequalitiesslides.pdf
More informationRANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS
RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS. DISCRETE RANDOM VARIABLES.. Definition of a Discrete Random Variable. A random variable X is said to be discrete if it can assume only a finite or countable
More informationSeparation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More informationGambling Systems and Multiplication-Invariant Measures
Gambling Systems and Multiplication-Invariant Measures by Jeffrey S. Rosenthal* and Peter O. Schwartz** (May 28, 997.. Introduction. This short paper describes a surprising connection between two previously
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More informationMARTINGALES AND GAMBLING Louis H. Y. Chen Department of Mathematics National University of Singapore
MARTINGALES AND GAMBLING Louis H. Y. Chen Department of Mathematics National University of Singapore 1. Introduction The word martingale refers to a strap fastened belween the girth and the noseband of
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationLecture 5 Principal Minors and the Hessian
Lecture 5 Principal Minors and the Hessian Eivind Eriksen BI Norwegian School of Management Department of Economics October 01, 2010 Eivind Eriksen (BI Dept of Economics) Lecture 5 Principal Minors and
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationTransformations and Expectations of random variables
Transformations and Epectations of random variables X F X (): a random variable X distributed with CDF F X. Any function Y = g(x) is also a random variable. If both X, and Y are continuous random variables,
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics GLOBAL EXISTENCE AND DECREASING PROPERTY OF BOUNDARY VALUES OF SOLUTIONS TO PARABOLIC EQUATIONS WITH NONLOCAL BOUNDARY CONDITIONS Sangwon Seo Volume 193 No. 1 March 2000
More informationWHEN DOES A RANDOMLY WEIGHTED SELF NORMALIZED SUM CONVERGE IN DISTRIBUTION?
WHEN DOES A RANDOMLY WEIGHTED SELF NORMALIZED SUM CONVERGE IN DISTRIBUTION? DAVID M MASON 1 Statistics Program, University of Delaware Newark, DE 19717 email: davidm@udeledu JOEL ZINN 2 Department of Mathematics,
More informationProbability Theory. Florian Herzog. A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T..
Probability Theory A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T.. Florian Herzog 2013 Probability space Probability space A probability space W is a unique triple W = {Ω, F,
More informationDepartment of Mathematics, Indian Institute of Technology, Kharagpur Assignment 2-3, Probability and Statistics, March 2015. Due:-March 25, 2015.
Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment -3, Probability and Statistics, March 05. Due:-March 5, 05.. Show that the function 0 for x < x+ F (x) = 4 for x < for x
More informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More informationSF2940: Probability theory Lecture 8: Multivariate Normal Distribution
SF2940: Probability theory Lecture 8: Multivariate Normal Distribution Timo Koski 24.09.2015 Timo Koski Matematisk statistik 24.09.2015 1 / 1 Learning outcomes Random vectors, mean vector, covariance matrix,
More informationSection 5.1 Continuous Random Variables: Introduction
Section 5. Continuous Random Variables: Introduction Not all random variables are discrete. For example:. Waiting times for anything (train, arrival of customer, production of mrna molecule from gene,
More informationGeometrical Characterization of RN-operators between Locally Convex Vector Spaces
Geometrical Characterization of RN-operators between Locally Convex Vector Spaces OLEG REINOV St. Petersburg State University Dept. of Mathematics and Mechanics Universitetskii pr. 28, 198504 St, Petersburg
More informationSection 6.1 - Inner Products and Norms
Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationSection 6.1 Joint Distribution Functions
Section 6.1 Joint Distribution Functions We often care about more than one random variable at a time. DEFINITION: For any two random variables X and Y the joint cumulative probability distribution function
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationRandom variables, probability distributions, binomial random variable
Week 4 lecture notes. WEEK 4 page 1 Random variables, probability distributions, binomial random variable Eample 1 : Consider the eperiment of flipping a fair coin three times. The number of tails that
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS Contents 1. Moment generating functions 2. Sum of a ranom number of ranom variables 3. Transforms
More informationit is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
More informationWalrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
More informationINSURANCE RISK THEORY (Problems)
INSURANCE RISK THEORY (Problems) 1 Counting random variables 1. (Lack of memory property) Let X be a geometric distributed random variable with parameter p (, 1), (X Ge (p)). Show that for all n, m =,
More informationNote on some explicit formulae for twin prime counting function
Notes on Number Theory and Discrete Mathematics Vol. 9, 03, No., 43 48 Note on some explicit formulae for twin prime counting function Mladen Vassilev-Missana 5 V. Hugo Str., 4 Sofia, Bulgaria e-mail:
More informationON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath
International Electronic Journal of Algebra Volume 7 (2010) 140-151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationCITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION
No: CITY UNIVERSITY LONDON BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION ENGINEERING MATHEMATICS 2 (resit) EX2005 Date: August
More informationDefinition: Suppose that two random variables, either continuous or discrete, X and Y have joint density
HW MATH 461/561 Lecture Notes 15 1 Definition: Suppose that two random variables, either continuous or discrete, X and Y have joint density and marginal densities f(x, y), (x, y) Λ X,Y f X (x), x Λ X,
More informationLecture Notes on Elasticity of Substitution
Lecture Notes on Elasticity of Substitution Ted Bergstrom, UCSB Economics 210A March 3, 2011 Today s featured guest is the elasticity of substitution. Elasticity of a function of a single variable Before
More information2WB05 Simulation Lecture 8: Generating random variables
2WB05 Simulation Lecture 8: Generating random variables Marko Boon http://www.win.tue.nl/courses/2wb05 January 7, 2013 Outline 2/36 1. How do we generate random variables? 2. Fitting distributions Generating
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationInfluences in low-degree polynomials
Influences in low-degree polynomials Artūrs Bačkurs December 12, 2012 1 Introduction In 3] it is conjectured that every bounded real polynomial has a highly influential variable The conjecture is known
More information5. Continuous Random Variables
5. Continuous Random Variables Continuous random variables can take any value in an interval. They are used to model physical characteristics such as time, length, position, etc. Examples (i) Let X be
More informations-convexity, model sets and their relation
s-convexity, model sets and their relation Zuzana Masáková Jiří Patera Edita Pelantová CRM-2639 November 1999 Department of Mathematics, Faculty of Nuclear Science and Physical Engineering, Czech Technical
More informationCHAPTER IV - BROWNIAN MOTION
CHAPTER IV - BROWNIAN MOTION JOSEPH G. CONLON 1. Construction of Brownian Motion There are two ways in which the idea of a Markov chain on a discrete state space can be generalized: (1) The discrete time
More information1.1 Introduction, and Review of Probability Theory... 3. 1.1.1 Random Variable, Range, Types of Random Variables... 3. 1.1.2 CDF, PDF, Quantiles...
MATH4427 Notebook 1 Spring 2016 prepared by Professor Jenny Baglivo c Copyright 2009-2016 by Jenny A. Baglivo. All Rights Reserved. Contents 1 MATH4427 Notebook 1 3 1.1 Introduction, and Review of Probability
More informationEXTREMES ON THE DISCOUNTED AGGREGATE CLAIMS IN A TIME DEPENDENT RISK MODEL
EXTREMES ON THE DISCOUNTED AGGREGATE CLAIMS IN A TIME DEPENDENT RISK MODEL Alexandru V. Asimit 1 Andrei L. Badescu 2 Department of Statistics University of Toronto 100 St. George St. Toronto, Ontario,
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More informationMathematics for Econometrics, Fourth Edition
Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents
More information6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
More informationLecture 5: Mathematical Expectation
Lecture 5: Mathematical Expectation Assist. Prof. Dr. Emel YAVUZ DUMAN MCB1007 Introduction to Probability and Statistics İstanbul Kültür University Outline 1 Introduction 2 The Expected Value of a Random
More informationLectures on Stochastic Processes. William G. Faris
Lectures on Stochastic Processes William G. Faris November 8, 2001 2 Contents 1 Random walk 7 1.1 Symmetric simple random walk................... 7 1.2 Simple random walk......................... 9 1.3
More information25 Integers: Addition and Subtraction
25 Integers: Addition and Subtraction Whole numbers and their operations were developed as a direct result of people s need to count. But nowadays many quantitative needs aside from counting require numbers
More informationLecture 4: BK inequality 27th August and 6th September, 2007
CSL866: Percolation and Random Graphs IIT Delhi Amitabha Bagchi Scribe: Arindam Pal Lecture 4: BK inequality 27th August and 6th September, 2007 4. Preliminaries The FKG inequality allows us to lower bound
More informationarxiv:math/0412362v1 [math.pr] 18 Dec 2004
Improving on bold play when the gambler is restricted arxiv:math/0412362v1 [math.pr] 18 Dec 2004 by Jason Schweinsberg February 1, 2008 Abstract Suppose a gambler starts with a fortune in (0, 1) and wishes
More informationSensitivity analysis of utility based prices and risk-tolerance wealth processes
Sensitivity analysis of utility based prices and risk-tolerance wealth processes Dmitry Kramkov, Carnegie Mellon University Based on a paper with Mihai Sirbu from Columbia University Math Finance Seminar,
More informationVERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS
VERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS MICHAEL DRMOTA, OMER GIMENEZ, AND MARC NOY Abstract. We show that the number of vertices of a given degree k in several kinds of series-parallel labelled
More informationSF2940: Probability theory Lecture 8: Multivariate Normal Distribution
SF2940: Probability theory Lecture 8: Multivariate Normal Distribution Timo Koski 24.09.2014 Timo Koski () Mathematisk statistik 24.09.2014 1 / 75 Learning outcomes Random vectors, mean vector, covariance
More informationCollinear Points in Permutations
Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,
More informationST 371 (IV): Discrete Random Variables
ST 371 (IV): Discrete Random Variables 1 Random Variables A random variable (rv) is a function that is defined on the sample space of the experiment and that assigns a numerical variable to each possible
More informationAsymptotics of discounted aggregate claims for renewal risk model with risky investment
Appl. Math. J. Chinese Univ. 21, 25(2: 29-216 Asymptotics of discounted aggregate claims for renewal risk model with risky investment JIANG Tao Abstract. Under the assumption that the claim size is subexponentially
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationFIND ALL LONGER AND SHORTER BOUNDARY DURATION VECTORS UNDER PROJECT TIME AND BUDGET CONSTRAINTS
Journal of the Operations Research Society of Japan Vol. 45, No. 3, September 2002 2002 The Operations Research Society of Japan FIND ALL LONGER AND SHORTER BOUNDARY DURATION VECTORS UNDER PROJECT TIME
More informationSTOCK LOANS. XUN YU ZHOU Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong 1.
Mathematical Finance, Vol. 17, No. 2 April 2007), 307 317 STOCK LOANS JIANMING XIA Center for Financial Engineering and Risk Management, Academy of Mathematics and Systems Science, Chinese Academy of Sciences
More informationOrder statistics and concentration of l r norms for log-concave vectors
Order statistics and concentration of l r norms for log-concave vectors Rafa l Lata la Abstract We establish upper bounds for tails of order statistics of isotropic log-concave vectors and apply them to
More informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative
More informationOPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem")
OPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem") BY Y. S. CHOW, S. MORIGUTI, H. ROBBINS AND S. M. SAMUELS ABSTRACT n rankable persons appear sequentially in random order. At the ith
More informationSingle-Period Balancing of Pay Per-Click and Pay-Per-View Online Display Advertisements
Single-Period Balancing of Pay Per-Click and Pay-Per-View Online Display Advertisements Changhyun Kwon Department of Industrial and Systems Engineering University at Buffalo, the State University of New
More informationThe Ergodic Theorem and randomness
The Ergodic Theorem and randomness Peter Gács Department of Computer Science Boston University March 19, 2008 Peter Gács (Boston University) Ergodic theorem March 19, 2008 1 / 27 Introduction Introduction
More informationSome representability and duality results for convex mixed-integer programs.
Some representability and duality results for convex mixed-integer programs. Santanu S. Dey Joint work with Diego Morán and Juan Pablo Vielma December 17, 2012. Introduction About Motivation Mixed integer
More informationMaximum Likelihood Estimation
Math 541: Statistical Theory II Lecturer: Songfeng Zheng Maximum Likelihood Estimation 1 Maximum Likelihood Estimation Maximum likelihood is a relatively simple method of constructing an estimator for
More informationNotes on Symmetric Matrices
CPSC 536N: Randomized Algorithms 2011-12 Term 2 Notes on Symmetric Matrices Prof. Nick Harvey University of British Columbia 1 Symmetric Matrices We review some basic results concerning symmetric matrices.
More informationReal Roots of Univariate Polynomials with Real Coefficients
Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials
More informationand s n (x) f(x) for all x and s.t. s n is measurable if f is. REAL ANALYSIS Measures. A (positive) measure on a measurable space
RAL ANALYSIS A survey of MA 641-643, UAB 1999-2000 M. Griesemer Throughout these notes m denotes Lebesgue measure. 1. Abstract Integration σ-algebras. A σ-algebra in X is a non-empty collection of subsets
More informationBuered Probability of Exceedance: Mathematical Properties and Optimization Algorithms
Buered Probability of Exceedance: Mathematical Properties and Optimization Algorithms Alexander Mafusalov, Stan Uryasev RESEARCH REPORT 2014-1 Risk Management and Financial Engineering Lab Department of
More informationProperties of sequences Since a sequence is a special kind of function it has analogous properties to functions:
Sequences and Series A sequence is a special kind of function whose domain is N - the set of natural numbers. The range of a sequence is the collection of terms that make up the sequence. Just as the word
More informationResearch Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative
More informationSingle item inventory control under periodic review and a minimum order quantity
Single item inventory control under periodic review and a minimum order quantity G. P. Kiesmüller, A.G. de Kok, S. Dabia Faculty of Technology Management, Technische Universiteit Eindhoven, P.O. Box 513,
More informationEx. 2.1 (Davide Basilio Bartolini)
ECE 54: Elements of Information Theory, Fall 00 Homework Solutions Ex.. (Davide Basilio Bartolini) Text Coin Flips. A fair coin is flipped until the first head occurs. Let X denote the number of flips
More informationSome Problems of Second-Order Rational Difference Equations with Quadratic Terms
International Journal of Difference Equations ISSN 0973-6069, Volume 9, Number 1, pp. 11 21 (2014) http://campus.mst.edu/ijde Some Problems of Second-Order Rational Difference Equations with Quadratic
More informationLECTURE 15: AMERICAN OPTIONS
LECTURE 15: AMERICAN OPTIONS 1. Introduction All of the options that we have considered thus far have been of the European variety: exercise is permitted only at the termination of the contract. These
More informationarxiv:1112.0829v1 [math.pr] 5 Dec 2011
How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly
More informationUnderstanding Basic Calculus
Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and other
More informationSome stability results of parameter identification in a jump diffusion model
Some stability results of parameter identification in a jump diffusion model D. Düvelmeyer Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany Abstract In this paper we discuss
More informationContinuity of the Perron Root
Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North
More informationElements of probability theory
2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted
More informationTHE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok
THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan
More information1 Gambler s Ruin Problem
Coyright c 2009 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins
More informationON PRICE CAPS UNDER UNCERTAINTY
ON PRICE CAPS UNDER UNCERTAINTY ROBERT EARLE CHARLES RIVER ASSOCIATES KARL SCHMEDDERS KSM-MEDS, NORTHWESTERN UNIVERSITY TYMON TATUR DEPT. OF ECONOMICS, PRINCETON UNIVERSITY APRIL 2004 Abstract. This paper
More informationSCORE SETS IN ORIENTED GRAPHS
Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in
More informationHomework # 3 Solutions
Homework # 3 Solutions February, 200 Solution (2.3.5). Noting that and ( + 3 x) x 8 = + 3 x) by Equation (2.3.) x 8 x 8 = + 3 8 by Equations (2.3.7) and (2.3.0) =3 x 8 6x2 + x 3 ) = 2 + 6x 2 + x 3 x 8
More information