How common sense can be misleading in ruin theory
|
|
- Brooke Grant
- 7 years ago
- Views:
Transcription
1 Annals of the University of Craiova, Mathematics and Computer Science Series Volume, 6, Pages 7 8 ISSN: -69 Dedicated to Marius Iosifescu on the occasion of his 8th anniversary How common sense can be misleading in ruin theory Anişoara Maria Răducan, Raluca Vernic, and Gheorghiţă Zbăganu Abstract. Some graphical representations of ruin probability computed mainly for Erlang type claims suggested an idea that intuitively seems to be true: if the first claims are small then the chance to get ruined is also small. However, for other claims this does not hold, as is shown by counterexamples. Key words and phrases. Ruin probability, nonhomogeneous claims, stochastic order.. The problem In the insurance field, the evaluation of ruin probabilities is of great importance since it influences the future financial politics of any insurance company. In this sense some recursive formulae were obtained in [], for the ruin probability evaluated at or before claim instants for the following risk model used to describe the evolution over time of the surplus of an insurance company n n U n u X i Y i u ξ i. i Here U n n denotes the remaining capital after paying the n-th claim, u is the initial capital, X n n are the claim sizes CSs assumed to be Erlang-distributed, independent and independent of Y n n, the nonnegative inter-claim revenues ICRs which themselves are assumed to be independent, identically distributed i.i.d., following an arbitrary distribution. Then ξ n X n Y n represents the loss increment between the n -th and the n-th claims. We recall [], [8] that the ruin probability at or before the n-th claim is j ψ n u P min U j < P max ξ i > u. j n j n The novelty of Răducan et al. [], [5] consists in assuming that the CSs are nonhomogeneous Erlang distributed, yielding a nonhomogeneous process. Motivated by many numerical examples, Răducan et al. [] stated the following conjecture relating the order in which the nonhomogeneous claims arrive to the magnitude of the corresponding ruin probability: if the claims arrive in the increasing stochastic order, then the ruin probability is smaller that if the same claims come under a different order. That seemed to be common sense: during the small claims period, the insurer s capital accumulates, hence it can face the hard claims period better than if a larger claim arrives sooner and decreases the insurer s capital. Received April, 6. i i 7
2 HOW COMMON SENSE CAN BE MISLEADING IN RUIN THEORY 7 However, this conjecture was proved only in the particular case when the CSs are exponentially distributed with all parameters distinct, see [5] and [6]. In this paper, we deal with a case which is more restrictive than the stated conjecture, and more general in the same time: it is more restrictive because we consider only two claims, and more general because we let them follow any distribution supported on positive values. More precisely, we study if there is a relation between the magnitude of the ruin probability and the arrival order of the two claims when these claims satisfy some stochastic order. In this sense, in Section we define a new stochastic relation which we call ruin domination. This relation is not always transitive, as we point out using a counterexample.. Various stochastic orderings Let X, X be two nonnegative random variables r.v, and let F, G be their distribution functions d.f. If the r.v are absolutely continuous either with respect to the Lebesgue measure, or with respect to the counting one, we will denote by p, q their densities. We recall the following stochastic orders see, for instance [7]:. The usual stochastic domination: X st X F G q G. The hazard rate domination: X hr X p F. The likelihood ratio domination: X like X p q is decreasing.. The increasing convex order: X icx X EuX EuX for any nondecreasing convex u. Remark.. It is known that the likelihood ratio domination implies the hazard rate one, which in turn, implies the stochastic one; see, e.g., [7]. Back to the conjecture stated by [5], if we deal with only two claims, it turns into the following claim: Conjecture. Let X, X, Y, Y be independent nonnegative r.v.s., withy and Y identically distributed. Let ξ i X i Y i, i,, L, max ξ, ξ + ξ +, L, max ξ, ξ + ξ +. If X st X, then L, st L, ; or, in other words, if ψ i,j t P L i,j > t, i j {, }, t >, represents the two ruin probabilities, then the claim is that ψ, ψ,. Or, in terms of survival probabilities denoted by φ i,j ψ i,j, the claim is that φ, φ,. We already know that this conjecture holds if the claims are exponentially distributed. More generally, the common sense says that if the ICRs are the same, then it is better if the smaller claim X comes first and the greater one X comes next than if the greater claim comes first and the smaller one afterwards i.e., in the first scenario one seems to be better prepared for the more dangerous claim than in the second one, provided that the incomes are identically distributed. Related to this situation, we define the following stochastic relation. Definition.. Let X, X be two independent non-negative r.v.s. We say that X dominates X in the ruin sense if, for any i.i.d. non-negative r.v.s Y, Y, independent of X, X it is true that L, st L, i.e., that max, X Y, X + X Y Y st max, X Y, X + X Y Y.
3 7 A.M. RĂDUCAN, R. VERNIC, AND G. ZBĂGANU We denote this relation by X ruin X. If the domination holds only for Y Y const we say that X dominates X in the weak ruin domination and write X wruin X. Otherwise written: two claims X, X are in the relation X ruin X if the scenario first comes claim X, then X is always better in stochastic order than first comes claim X, then X for any i.i.d. ICRs Y, Y, while X wruin X means that the first scenario is better only for constant ICRs. Thus, our conjecture says that X st X X ruin X. The current study was prompted by the unpleasant surprise that the conjecture is false. Here are two counterexamples. Example.. Suppose that X, X....,.... Y Y. The reader can check that X st X but it is not true that L, st L,. Precisely in the first scenario we have ψ, P L, >.6.6 while in the second one ψ, P L, >.9.6. However, it is true that when the initial capital u is greater than, then ψ, u ψ, u. The two scenarios are not stochastically comparable. Example.. Let X Uniform,, X exp, Y Y. Clearly X st X. Then ξ X, ξ X + X, and for t the corresponding survival probabilities are. φ t P L t P X + t, X + X + t P X min + t, + t X [ ] E P X min + t, + t X X [ ] E min, min + t, + t X + min, + t, + t x e x dx. + Therefore ϕ, t e + t + e t if t. Next, e t + e t if t > ϕ, t P L t P X + t, X + X + t E [P X min, + t X X ] e t. e Thus ϕ, + e.65 while ϕ, e.7. It is not e true that ϕ, ϕ,.
4 HOW COMMON SENSE CAN BE MISLEADING IN RUIN THEORY 75 It turns out that even the weaker conjecture X st X X wruin X fails to be true. Even the weaker implication X hr X X wruin X is false - as it is proved by the second example. However, in both examples it is true that the second scenario is worse in the increasing convex order meaning that L, icx L, but maybe this is only by chance; we do not dare to add a new false guess here.. Ruin domination in general case In order to see under which assumptions the ruin domination holds, we define the following notation: for two nonnegative r.v.s X, X and a, b, t let and a,b P X a, X + X a + b P X a, X + X a + b, D a,b t a+t,b + b+t,a. Lemma.. i. If a then a, and D a, t t,a. ii. Let X, X be non-negative independent r.v.s. and let F, F be their d.f.s. If they are absolutely continuous with respect to some measure µ, the densities are df x f x dµ x, df x f x dµ x and δ x, y f x f y f y f x then a,b +b x δ x, y dµ y dµ x... iii. If the d.f.s. F p p p... then for any a, b > positive integers, a,b a i a+b i j δ i,j min{a,b} a+b x, F min{a,b} i a... q q q... a+b i ja+ where δ i,j p i q j p j q i and, by convention, an empty sum is. δ x, y dµ y dµ x. 5 are discrete, δ i,j, 6 Proof. i. For any a we have a, P X a, X + X a P X a, X + X a P X + X a P X + X a and D a, t a+t, + t,a t,a. ii. The first equality is immediate. To prove the second one, we consider first the case a b, when we split a,b δ x, y dµ y dµ x + +b x a δ x, y dµ y dµ x. The first integral is since if we change the order of integration followed by interchanging x and y, we get δ y, x dµ y dµ x δ y, x dµ y dµ x δ y, x dµ x dµ y δ x, y + δ y, x dµ x dµ y.
5 76 A.M. RĂDUCAN, R. VERNIC, AND G. ZBĂGANU When a > b we split a,b b a δ x, y dµ y dµ x + b a+b x With a similar reasoning, we obtain that +b x a δ x, y dµ y dµ x +b x δ x, y dµ y dµ x. b a a+b x δ x, y dµ y dµ x δ x, y dµ y dµ x, hence the equality from 5 also holds. iii. Taking into consideration that δ i,j +δ j,i, this formula results after a reasoning similar with the one in the continuous case ii. Remark.. Let us notice that: i D a,b t D b,a t, a, b, t an obvious consequence of the definition, ii D a,b t, a, b, t a,b, a, b obvious from D a, t t,a. Proposition.. Let X, X be non-negative independent random variables. Then i X wruin X if and only if a,b for any b a. ii X ruin X if and only if D a,b t dh a dh b for any probability distribution H on the halfline [, and t. iii If X, X are discrete, then X wruin X if and only if m,n for all nonnegative integers m, n such that m n. Proof. i X wruin X P X x+t, X +X x+t P X x+t, X +X x + t x+t,x for all t, x. Put a x + t and b x. ii X ruin X P X Y +t, X +X Y +Y +t P X Y +t, X +X Y + Y + t for any i.i.d. nonnegative r.v.s. Y, Y, independent of X, X. Denoting by H the common distribution of Y, Y, we see that Next P X Y + t, X + X Y + Y + t E [P X Y + t, X + X Y + Y + t Y, Y ] P X y + t, X + X y + y + tdhy dhy P X y + t, X + X y + y + tdhy dhy P X y + t, X + X y + y + tdhy dhy P X Y + t, X + X Y + Y + t. P X Y + t, X + X Y + Y + t E [P X Y + t, X + X Y + Y + t Y, Y ] P X y + t, X + X y + y + tdhy dhy.
6 HOW COMMON SENSE CAN BE MISLEADING IN RUIN THEORY 77 Then P X Y + t, X + X Y + Y + t P X Y + t, X + X Y + Y + t [P X y + t, X + X y + y + t P X y + t, X + X y + y + t]dhy dhy t+y,y dh y dh y t+y,y + t+y,y dh y dh y t+y,y dh y dh y D a,b t dh a dh b. iii From i we know already that X wruin X x+t,x, x, t. But in the [x+t] [x+t] i discrete case x+t,x δ i,j, thus we have only to check that m n i j where m : [x + t] and m + n [x + t]. Here [x] is integer part of x. Thus the claim is that [a + t] [a + t] [a + t] + [a + t] [a + t] +. This is easy and it is left to the reader [a] [a + t]. Corollary.. Let X, X be nonnegative independent r.v.s, absolutely continuous with respect to some σ-finite measure µ having densities p, q. Then a sufficient condition in order that the relation X ruin X hold is that δ x, y p x q y p y q x for all x y. Proof. According to ii from Proposition. X ruin X if and only if D a,b t dh a dh b. But D a,b t a+t,b + b+t,a. We denote a a + t and b b + t. Using the second equality in 5, we note that mina,b a +b x a,b δ x, y dµ y dµ x a since in this integral x a and y a, and we know that x y implies δ x, y. Similarly, b,a, which completes the proof. The following corollary is a consequence of the above one. Corollary.. Let X, X be non-negative independent r.v.s. absolutely continuous with respect to some σ- finite measure. Then X like X X ruin X. Remark.. The like relation is too strong, it seems to be far away from the relation ruin. We consider another relation seemingly closer from the later one. Definition.. Denote by X Sruin X the condition D a,b t for all a, b and t. Remark.. According to remark. ii, one can also writex Sruin X a,b for all a, b. Proposition.5. Let X, X be non-negative independent r.v.s. absolutely continuous with respect to some σ- finite measure. The following implications hold: X like X X Sruin X X ruin X X wruin X Proof. The implications are obvious.
7 78 A.M. RĂDUCAN, R. VERNIC, AND G. ZBĂGANU. The comparison in the discret case Here we suppose that... X F p p p......, X F q q q... hence F m m p i, F m m q i. We shall compare these four orderings in the i i most simple cases. The most convenient comparisons are those which involve only the quantities i,j. They are easily to compare because, according to Proposition.. we have the following algorithm : X wruin X m,n for all positive integers m, n such that m n. X Sruin X m,n for all positive integers m, n. Proposition.. Let X, X be non-negative independent r.v.s. as above. Then i. If X wruin X then p pj sup. q j q j ii. If X Sruin X then X st X. iii. If X wruin X and X wruin X then X X. Proof. i. Note that for any n we have n, δ,n and we know that n, or, which is the same p q n p n q. ii. Let m, lim m,n. As m,n for all m, n it follows that m, n for all m. But it is easy to see that m, F m F m. iii. According to i. we see that X wruin X and X wruin X imply p sup pj j q j pj inf j q j and q p p i q i, i. sup j from where p q qj p j p q inf j pj q j. Therefore sup j qj p j, q p q p j for any j. As p i q i it follows that q j i i Here is a table with the first quantities m,n m,n. Here δ i,j:k means δ i,j + δ i,j δ i,k. m/n : δ, δ,: δ,: δ,: δ, δ,: + δ, δ,: + δ,: δ,:5 + δ,: δ, δ,: + δ, δ,:5 + δ,: + δ, δ,:6 + δ,:5 + δ,: δ, δ,:5 + δ, δ,:6 + δ,:5 + δ, δ,:7 + δ,:6 + δ,:5 + δ, So, if A. Supp F Supp F {, }, then the single interesting value of is, δ, and,. Thus X wruin X iff δ, p q p q p q q p p q X st X. Therefore we have Corollary.. If Supp F Supp F {, } then the relations st, wruin, ruin, Sruin and like are the same.
8 HOW COMMON SENSE CAN BE MISLEADING IN RUIN THEORY 79 B. Supp F Supp F {,, }. In this case only the matrix δ, δ i,j i, j,: δ, δ,: does matter. According to our algorithm X wruin X δ,, δ,, δ,: + δ,. Adding the first two inequalities we also get δ,: p q + q q p + p p q q p p q. The last one is p q + p q q p + q p q p + p p q + q q p p + p q + q. But p q, p + p q + q means that X st X. As the conditions for X Sruin X are the same, the conclusion is: Corollary.. If Supp F Supp F {,, } then i. X st X p q, p + p q + q p q, p q. ii. X wruin X X st X, p p, p p X Sruin X X ruin q q q q X. iii. X like X p p p. q q q Remark.. The answer to the question if the Sruin relation implies the like relation is negative, as we can see from the counterexample X and X in which X Sruin X but it is not true that X like X. 6 Remark.. This is the most simple case when one can deny the implication X st X X ruin X. For instance, if X and X, then X st X but it is not true that X ruin X since p q < p q. C. Supp F Supp F {,,, }. The interesting part of is δ, δ,: δ,: i,j i, j δ, δ,: + δ, δ,: + δ,:. δ, δ, + δ, δ, + δ, + δ, ThenX st X p q, p + p q + q, p + p + p q + q + q and X wruin X δ,, δ,, δ,, δ,: + δ,, δ, + δ,, δ, + δ, + δ,.adding the first three inequalities, we obtain p q ; the last one says that p q or, which is the same, that p + p + p q + q + q. The relation X sruin X adds to the inequalities for the weak comparison three more ones: δ,:, δ,: and δ,:, δ,:. The first two of them are superfluous since they are implied by δ,, δ,, δ,. The remaining one is not: written as p + p q + q q + q p + p p + p q + q q + q p + p it implies the stochastic order. To summarize: Corollary.. If Supp F Supp F {,,, } then i. X st X p q, p + p q + q, p + p + p q + q + q. ii. X wruin X p p max, p, p,p q,p q, δ,: + δ,, q q q q 9 9
9 8 A.M. RĂDUCAN, R. VERNIC, AND G. ZBĂGANU δ, + δ,. iii. X Sruin X X wruin X & X st X. iv. X like X p p p p. q q q q The relation X ruin X should be between the last ones. It is possible to coincide with the relation X Sruin X. Remark.. This is the first case when wruin does not imply the stochastic domination. For instance, if X and X, the reader can check that X wruin X but it is not true that X st X. Remark.. The notation attributed to ruin domination might not be the most proper one, since this is not an ordering relation as one can easily see from the following example: X, X, X for which X wruin X wruin X and yet it is not true that 7 7 X wruin X. 7 6 Acknowledgements Gheorghiţă Zbăganu acknowledges the support from a research grant of the Romanian National Authority for Scientific Research CNCS UEFISCDI, project number PN-II-ID-PCE References [] S. Assmussen, H. Albrecher, Ruin Probabilities, World Scientific Publishing Co., Singapore,. [] A. Castaner, M.M. Claramunt, M. Gathy, C. Lefevre, M. Marmol, Ruin problems for a disctere time risk model with non-homogeneous conditions, Scandinavian Actuarial Journal, 8. [] C. Lefevre, P. Picard, A nonhomogeneous risk model for insurance, Computers and Mathematics with Applications 6 5, 5. [] A.M. Răducan, R. Vernic, Gh. Zbăganu, Recursive calculation of ruin probabilities at or before claim instants for non-identically distributed claims, ASTIN Bulletin 5 5,. [5] A.M. Răducan, R. Vernic, Gh. Zbăganu, On the ruin probability for nonhomogeneous claims and arbitrary inter-claim revenues, Journal of Computational and Applied Mathematics 5 9, 9. [6] A.M. Răducan, R. Vernic, Gh. Zbăganu, On a conjecture related to the ruin probability for nonhomogeneous exponentially distributed claims, Submitted. [7] M. Shaked, J.G. Shanthikumar, Stochastic orders and their applications, Academic Press, New York, 99. [8] D.A. Stanford, K.J. Stroinski, K. Lee, Ruin probabilities based at claim instants for some non Poisson claim processes, Insurance: Mathematics and Economics 6, [9] D.A. Stanford, K. Yu, J. Ren, Erlangian approximation for finite time ruin probabilities in perturbed risk models, Scandinavian Actuarial Journal, [] R. Vernic, On a conjecture related to the ruin probability for nonhomogeneous insurance claims, Annals of the Ovidius University of Constanţa - mathematics series 5, 9.
10 HOW COMMON SENSE CAN BE MISLEADING IN RUIN THEORY 8 Anişoara Maria Răducan Institute of Mathematical Statistics and Applied Mathematics Gheorghe Mihoc - Caius Iacob of the Romanian Academy, Bucharest, Romania address: anaraducan@yahoo.ca Raluca Vernic Institute of Mathematical Statistics and Applied Mathematics Gheorghe Mihoc - Caius Iacob of the Romanian Academy, Bucharest, Romania Ovidius University of Constanţa Gheorghiţă Zbăganu Institute of Mathematical Statistics and Applied Mathematics Gheorghe Mihoc - Caius Iacob of the Romanian Academy, Bucharest, Romania University of Bucharest
a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationFULL LIST OF REFEREED JOURNAL PUBLICATIONS Qihe Tang
FULL LIST OF REFEREED JOURNAL PUBLICATIONS Qihe Tang 87. Li, J.; Tang, Q. Interplay of insurance and financial risks in a discrete-time model with strongly regular variation. Bernoulli 21 (2015), no. 3,
More informationModeling and Performance Evaluation of Computer Systems Security Operation 1
Modeling and Performance Evaluation of Computer Systems Security Operation 1 D. Guster 2 St.Cloud State University 3 N.K. Krivulin 4 St.Petersburg State University 5 Abstract A model of computer system
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationThe sum of digits of polynomial values in arithmetic progressions
The sum of digits of polynomial values in arithmetic progressions Thomas Stoll Institut de Mathématiques de Luminy, Université de la Méditerranée, 13288 Marseille Cedex 9, France E-mail: stoll@iml.univ-mrs.fr
More informationDiscussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski.
Discussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski. Fabienne Comte, Celine Duval, Valentine Genon-Catalot To cite this version: Fabienne
More informationA Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails
12th International Congress on Insurance: Mathematics and Economics July 16-18, 2008 A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails XUEMIAO HAO (Based on a joint
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 informationSolutions for Practice problems on proofs
Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some
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 informationA Model of Optimum Tariff in Vehicle Fleet Insurance
A Model of Optimum Tariff in Vehicle Fleet Insurance. Bouhetala and F.Belhia and R.Salmi Statistics and Probability Department Bp, 3, El-Alia, USTHB, Bab-Ezzouar, Alger Algeria. Summary: An approach about
More informationAsymptotics for ruin probabilities in a discrete-time risk model with dependent financial and insurance risks
1 Asymptotics for ruin probabilities in a discrete-time risk model with dependent financial and insurance risks Yang Yang School of Mathematics and Statistics, Nanjing Audit University School of Economics
More informationLecture 13 - Basic Number Theory.
Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted
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 informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationProbability 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 information1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let
Copyright c 2009 by Karl Sigman 1 Stopping Times 1.1 Stopping Times: Definition Given a stochastic process X = {X n : n 0}, a random time τ is a discrete random variable on the same probability space as
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 informationLoad Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load
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 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 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 informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering
More informationStudent Outcomes. Lesson Notes. Classwork. Discussion (10 minutes)
NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 5 8 Student Outcomes Students know the definition of a number raised to a negative exponent. Students simplify and write equivalent expressions that contain
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 informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More informationIrreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients
DOI: 10.2478/auom-2014-0007 An. Şt. Univ. Ovidius Constanţa Vol. 221),2014, 73 84 Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients Anca
More informationMarshall-Olkin distributions and portfolio credit risk
Marshall-Olkin distributions and portfolio credit risk Moderne Finanzmathematik und ihre Anwendungen für Banken und Versicherungen, Fraunhofer ITWM, Kaiserslautern, in Kooperation mit der TU München und
More informationSECTION 10-2 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
More informationStochastic Inventory Control
Chapter 3 Stochastic Inventory Control 1 In this chapter, we consider in much greater details certain dynamic inventory control problems of the type already encountered in section 1.3. In addition to the
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 informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationOverview of Monte Carlo Simulation, Probability Review and Introduction to Matlab
Monte Carlo Simulation: IEOR E4703 Fall 2004 c 2004 by Martin Haugh Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab 1 Overview of Monte Carlo Simulation 1.1 Why use simulation?
More informationMatrix Differentiation
1 Introduction Matrix Differentiation ( and some other stuff ) Randal J. Barnes Department of Civil Engineering, University of Minnesota Minneapolis, Minnesota, USA Throughout this presentation I have
More informationFurther Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1
Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing
More informationQUEUING THEORY. 1. Introduction
QUEUING THEORY RYAN BERRY Abstract. This paper defines the building blocks of and derives basic queuing systems. It begins with a review of some probability theory and then defines processes used to analyze
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More information4.6 Linear Programming duality
4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal
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 informationBasic Proof Techniques
Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document
More information7: The CRR Market Model
Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney MATH3075/3975 Financial Mathematics Semester 2, 2015 Outline We will examine the following issues: 1 The Cox-Ross-Rubinstein
More informationEMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE DEGREES
EMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE ENUMERATION DEGREES AND THE ω-enumeration DEGREES MARIYA I. SOSKOVA AND IVAN N. SOSKOV 1. Introduction One of the most basic measures of the complexity of a
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 informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
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 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 informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationThe sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].
Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
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 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 informationarxiv:math/0112298v1 [math.st] 28 Dec 2001
Annuities under random rates of interest revisited arxiv:math/0112298v1 [math.st] 28 Dec 2001 Krzysztof BURNECKI, Agnieszka MARCINIUK and Aleksander WERON Hugo Steinhaus Center for Stochastic Methods,
More informationFEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL
FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL STATIsTICs 4 IV. RANDOm VECTORs 1. JOINTLY DIsTRIBUTED RANDOm VARIABLEs If are two rom variables defined on the same sample space we define the joint
More informationConditional Tail Expectations for Multivariate Phase Type Distributions
Conditional Tail Expectations for Multivariate Phase Type Distributions Jun Cai Department of Statistics and Actuarial Science University of Waterloo Waterloo, ON N2L 3G1, Canada jcai@math.uwaterloo.ca
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 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 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 informationM/M/1 and M/M/m Queueing Systems
M/M/ and M/M/m Queueing Systems M. Veeraraghavan; March 20, 2004. Preliminaries. Kendall s notation: G/G/n/k queue G: General - can be any distribution. First letter: Arrival process; M: memoryless - exponential
More informationCHAPTER 6. Shannon entropy
CHAPTER 6 Shannon entropy This chapter is a digression in information theory. This is a fascinating subject, which arose once the notion of information got precise and quantifyable. From a physical point
More information26 Integers: Multiplication, Division, and Order
26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue
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 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 informationConvex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
More informationCONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationTHE DYING FIBONACCI TREE. 1. Introduction. Consider a tree with two types of nodes, say A and B, and the following properties:
THE DYING FIBONACCI TREE BERNHARD GITTENBERGER 1. Introduction Consider a tree with two types of nodes, say A and B, and the following properties: 1. Let the root be of type A.. Each node of type A produces
More informationGrey Brownian motion and local times
Grey Brownian motion and local times José Luís da Silva 1,2 (Joint work with: M. Erraoui 3 ) 2 CCM - Centro de Ciências Matemáticas, University of Madeira, Portugal 3 University Cadi Ayyad, Faculty of
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
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 informationAdaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650
More informationGod created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
More informationLinear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
More informationThe Exponential Distribution
21 The Exponential Distribution From Discrete-Time to Continuous-Time: In Chapter 6 of the text we will be considering Markov processes in continuous time. In a sense, we already have a very good understanding
More informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More informationMatrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.
Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that
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 informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More information1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal:
Exercises 1 - number representations Questions 1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal: (a) 3012 (b) - 435 2. For each of
More informationACTUARIAL NOTATION. i k 1 i k. , (ii) i k 1 d k
ACTUARIAL NOTATION 1) v s, t discount function - this is a function that takes an amount payable at time t and re-expresses it in terms of its implied value at time s. Why would its implied value be different?
More informationWald s Identity. by Jeffery Hein. Dartmouth College, Math 100
Wald s Identity by Jeffery Hein Dartmouth College, Math 100 1. Introduction Given random variables X 1, X 2, X 3,... with common finite mean and a stopping rule τ which may depend upon the given sequence,
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More information1.2 Solving a System of Linear Equations
1.. SOLVING A SYSTEM OF LINEAR EQUATIONS 1. Solving a System of Linear Equations 1..1 Simple Systems - Basic De nitions As noticed above, the general form of a linear system of m equations in n variables
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 informationA characterization of trace zero symmetric nonnegative 5x5 matrices
A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the
More informationNonparametric adaptive age replacement with a one-cycle criterion
Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: Pauline.Schrijner@durham.ac.uk
More informationdef: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.
Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationRandom graphs with a given degree sequence
Sourav Chatterjee (NYU) Persi Diaconis (Stanford) Allan Sly (Microsoft) Let G be an undirected simple graph on n vertices. Let d 1,..., d n be the degrees of the vertices of G arranged in descending order.
More informationDifferentiating under an integral sign
CALIFORNIA INSTITUTE OF TECHNOLOGY Ma 2b KC Border Introduction to Probability and Statistics February 213 Differentiating under an integral sign In the derivation of Maximum Likelihood Estimators, or
More informationCredit Risk Models: An Overview
Credit Risk Models: An Overview Paul Embrechts, Rüdiger Frey, Alexander McNeil ETH Zürich c 2003 (Embrechts, Frey, McNeil) A. Multivariate Models for Portfolio Credit Risk 1. Modelling Dependent Defaults:
More informationOPTIMAL CONTROL OF FLEXIBLE SERVERS IN TWO TANDEM QUEUES WITH OPERATING COSTS
Probability in the Engineering and Informational Sciences, 22, 2008, 107 131. Printed in the U.S.A. DOI: 10.1017/S0269964808000077 OPTIMAL CONTROL OF FLEXILE SERVERS IN TWO TANDEM QUEUES WITH OPERATING
More informationIEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS
IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS There are four questions, each with several parts. 1. Customers Coming to an Automatic Teller Machine (ATM) (30 points)
More informationVilnius University. Faculty of Mathematics and Informatics. Gintautas Bareikis
Vilnius University Faculty of Mathematics and Informatics Gintautas Bareikis CONTENT Chapter 1. SIMPLE AND COMPOUND INTEREST 1.1 Simple interest......................................................................
More information