ON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME
|
|
- Sherilyn Anthony
- 8 years ago
- Views:
Transcription
1 ON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME Alexey Chuprunov Kazan State University, Russia István Fazekas University of Debrecen, Hungary 2012
2 Kolchin s generalized allocation scheme A law of large numbers
3 A law of large numbers Kolchin s generalized allocation scheme In the generalized scheme of allocations of particles into cells, the distribution of the cell contents are represented as the conditional distribution of independent random variables under the condition that their sum is fixed, see V. F. Kolchin (1999). Let η 1,..., η N be nonnegative integer-valued random variables. If there exist independent random variables ξ 1,..., ξ N such that P{η 1 = k 1,..., η N = k N} = (1.1) = P{ξ 1 = k 1,..., ξ N = k N ξ ξ N = n}, where k 1,..., k N are arbitrary nonnegative integers, we say that η 1,..., η N represent a generalized allocation scheme with parameters n and N, and independent random variables ξ 1,..., ξ N.
4 A law of large numbers Let the random variables ξ 1,..., ξ N be identically distributed. Usually (see, e.g., A. V. Kolchin (2003)) the random variables ξ 1,..., ξ N are distributed as follows q k = P{ξ 1 = k} = (b k θ k )/(k!b(θ)) where b 0, b 1,... is a certain sequence of non-negative numbers, and B(θ) = b k θ k /k!. k=0
5 Example. Poisson polynomial A law of large numbers Let ξ i have Poisson distribution, i.e. P(ξ i = k) = λk k! e λ, k = 0, 1,.... Then ( ) n! 1 n P{ξ 1 = k 1,..., ξ N = k N ξ ξ N = n} = k 1!... k N! N if k k N = n. That is {η 1 = k 1,..., η N = k N} has polynomial distribution. More precisely, it describes the allocation of n balls into N boxes. That is we obtain the original allocation scheme.
6 A law of large numbers Example. Binomial poly-hypergeometric Let ξ i have binomial distribution, i.e. P(ξ i = k) = ( t k) p k (1 p) t k, k = 0, 1,..., t. Then ( t P{ξ 1 = k 1,..., ξ N = k N ξ 1 + +ξ N = n} = k 1 ) ( t... k N ) / ( ) Nt n if k k N = n. That is {η 1 = k 1,..., η N = k N} has poly-hypergeometric distribution.
7 Example. Random forest A law of large numbers Let T n,n denote the set of forests containing N labelled roots and n labelled nonroot vertices. By Cayley s theorem, T n,n has N(n + N) n 1 elements. Consider uniform distribution on T n,n. Let η i denote the number of the nonroot vertices of the ith tree. Then P{η 1 = k 1,..., η N = k N} = n! (k 1 + 1) k (k N + 1) k N 1 k 1!... k N! N(N + n) n 1. Now let ξ i have the following distribution (Borel, Tanner) P(ξ i = k) = λk (1+k) k 1 k! e (k+1)λ, k = 0, 1,..., λ > 0. Then P{ξ 1 = k 1,..., ξ N = k N ξ 1 + +ξ N = n} = P{η 1 = k 1,..., η N = k N}. See Kolchin (1999), Ch-F (2010).
8 A law of large numbers Consider a sequence of non-negative numbers b 0, b 1,... with b 0 > 0, b 1 > 0 (1.2) and assume that the convergence radius R of the series B(θ) = k=0 b kθ k /k! (1.3) is positive. Let us introduce the random variable ξ = ξ(θ) (where θ > 0) with distribution p k (θ) = P{ξ = k} = b k θ k /k!b(θ), k = 0, 1, 2,.... (1.4) By Kolchin (2003), one has m = m(θ) = Eξ = θb (θ)/b(θ). Let 0 < θ < θ < R. m(θ), θ [θ, θ ], is a positive, continuous, strictly increasing function. We will denote by m 1 the inverse function of m.
9 A law of large numbers A law of large numbers In view of independence of the random variables ξ 1,..., ξ N, the study of several questions of the generalized allocation scheme can be reduced to problems of sums of independent random variables. Let µ nn be the number of the random variables η 1,..., η N being equal to a fixed r, r = 0, 1,..., n. Observe that µ nn = µ rnn = N i=1 I {η i =r} (1.5) is the number of cells containing r particles.
10 A law of large numbers Theorem B (Ch-F 2010) Suppose that ξ 1 = ξ 1 (θ) has distribution (1.4) with property (1.2). Assume that n, N such that n N = α nn α where 0 < α <. Assume that 0 < θ < R where θ = m 1 (α). Then we have lim n,n 1 N µ nn = p r (θ) almost surely.
11 In this paper we study the following scheme. Let ξ 0, ξ 1,..., ξ N be independent identically distributed random variables such that P{η 1 = k 1,..., η N = k N } = (2.1) = P{ξ 1 = k 1,..., ξ N = k N ξ ξ N n}, where k 1,..., k N are arbitrary nonnegative integers. Then we say that η 1,..., η N obey a generalized allocation scheme. It describes the generalized allocation of at most n balls into N boxes. Let p r = P(ξ 0 = r), r N 0. a = Eξ 0 <.
12 Observe that µ nn = µ rnn = N I {η i=1 i =r} (2.2) is the number of cells containing r particles. Introduce notation S N = N i=1 ξ i, S c N = N i=1 (ξ i a). Throughout the paper Φ denotes the distribution function of the standard Gaussian law. Notation α nn = n N.
13 Theorem Let Eξ 0 = a <. Suppose that there exists a sequence B N, N = 1, 2,..., such that N B N > 0 for all N = 1, 2,..., B N, B N 1 lim = 1, (2.1) N B N and 1 B N S c N ξ, as N, (2.2) in distribution where ξ is an almost surely finite random variable. Denote by F the distribution function of ξ. Let C be a point of continuity of F such that F (C) = P{ξ < C} = q 0 > 0. Let C < d 1 <. Then we have 1 lim n,n, a+c B N N <α nn <d 1 N µ nn = p r almost surely. (2.3)
14 Corollary Let Eξ 0 = a <. Let a < d < d 1 <. Then we have 1 lim n,n, d<α nn <d 1 N µ nn = p r almost surely. Corollary Suppose that Eξ 2 0 < and let Eξ 0 = a. Let C > 0, a < d 1 <. Then we have 1 lim n,n, a C <α N nn <d 1 N µ nn = p r almost surely.
15 Main results of this subsection are contained in the following theorem. We study the convergence of 1 N µ nn under the condition: n, N such that n N = α nn α. We show that an analogue of Kolmogorov s SLLN is valid if α is large and an analogue of Theorem B is valid if α is small. Moreover, 1 N µ nn is convergent, if ξ 0 satisfies Cramér s condition. Recall that ξ satisfies Cramér s condition, if there exists a positive constant H such that Ee λξ < for all λ < H. Observe that a positive random variable ξ satisfies Cramér s condition, if and only if Ee λξ < for some 0 < λ. We emphasize that next Theorem concerns the general model (2.1), and the particular distribution (1.4) is assumed only in part (3) of the theorem.
16 Theorem Let Eξ 0 = a <. (1) Let α > a. Then we have 1 lim n,n, α nn α N µ nn = p r almost surely. (2) Assume that ξ 0 satisfies the Cramér condition. Then we have 1 lim n,n, α nn a N µ nn = p r almost surely. (2.4) (3) Let 0 < α < a. Suppose that the random variable ξ 0 = ξ 0 (θ) has distribution (1.4) and condition (1.2) is valid. Assume that θ = m 1 (α) and 0 < θ < R. Then we have 1 lim n,n, α nn α N µ nn = p r (θ) in probability. (2.5)
17 Denote by ξ (r) 0 a random variable with distribution P{ξ (r) 0 = k} = P{ξ 0 = k ξ 0 r}. Remark that P(ξ 0 r) 0, because ξ 0 is nondegenerate. Let Eξ (r) = a r and let ξ (r) 1,..., ξ(r) N be independent copies of ξ(r) 0. Let S (r) N = N i=1 ξ(r) i. CN k = ( ) N k is the binomial coefficient. We have the following analogue of Kolchin s (1999) formula for model (2.1). Theorem For all k = 0, 1, 2,..., N we have (r) P{µ nn = k} = CN k P{S pk N k N k r (1 p r ) n kr}. (2.6) P{S N n}
18 Formula (2.6) gives us possibility to apply usual limit theorems for sums of independent random variables in order to prove local limit theorems for µ nn. Theorem (1) Let d > a. Let s 2 r = p r (1 p r ). Then, uniformly for α nn > d, we have P{µ nn = k} = 1 2πNsr e u2 /2 (1 + o(1)), (2.7) as n, N and u = k Npr belongs to an arbitrary bounded fixed s r N 1/2 interval. (2) Suppose a < a r and a < d < d 1 < a r. Then, for any fixed k, we have lim P{µ nn = k} = 0. (2.8) n,n, d<α nn <d 1
19 Theorem Suppose that Eξ0 2 <. Denote by σ2 the variance of ξ 0 and by σr 2 the variance of ξ (r) 0. Let < C. Then, as n, N such that N(α nn a) C, we have = P{µ nn = k} = (2.9) (( ( ) 1 e u2 /2 C r a usr / ( ) ) 1 p Φ 1 r C Φ + o(1)) 2πNsr pr σ r σ for u = k Npr s r N 1/2 belonging to any bounded fixed interval.
20 Theorem Suppose that the random variable ξ 0 = ξ 0 (θ) has distribution (1.4), condition (1.2) is satisfied, and θ K < R. Suppose that r = 1 and n k is fixed. Let N such that Np r (θ) λ for some 0 < λ <. Then for all k N 0 we have P{µ nn = k} = λ k e λ k! n (1 + o(1)). (2.10) l=0 λl e λ l! Corollary Suppose that the random variable ξ = ξ(θ) has distribution (1.4), condition (1.2) is satisfied, and θ K < R. Suppose that r = 1. Let n, N such that Np r (θ) λ for some 0 < λ <. Then for all k N 0 we have P{µ nn = k} = λk e λ k! (1 + o(1)).
21 The following theorem shows that, using stronger conditions, the previous Corollary is valid for r > 1. Theorem Suppose that the random variable ξ = ξ(θ) has distribution (1.4), condition (1.2) is satisfied, and θ K < R. Let r > 1 and n N 1 1/r. Let N such that Np r (θ) λ for some 0 < λ <. Then for all k N 0 we have P{µ nn = k} = λk e λ (1 + o(1)). (2.11) k! Previous Theorems are analogues of certain results in Kolchin (1999).
22 Let η (N) = max 1 i N η i. Now let ξ ( r) 0 be a random variable with distribution P{ξ ( r) 0 = k} = P{ξ 0 = k ξ 0 r}. Let ξ ( r) i, i = 1,..., N, be independent copies of ξ ( r) 0. Let S ( r) N = N i=1 ξ( r) i, a r = Eξ ( r) 0, P r = P{ξ 0 > r}. We have the following analogue of Kolchin s (1999) formula. Theorem ( r) N P{S N n} P{η (N) r} = (1 P r ), for all r N, (2.12) P{S N n} P{η (N) 0} = (1 P 0) N P{S N n}.
23 By (2.12), we can apply limit theorems for sums of i.i.d. r.v. s. Theorem Let d > a. Then for all r N, as n, N, we have uniformly for α nn > d. P{η (N) r} = (1 P r ) N (1 + o(1)) (2.13) Theorem Suppose that Eξ0 2 <. Let < C. Then, for all r N, as n, N such that N(α nn a) C we have / ( )) ) C P{η (N) r} = (1 P r ) ((1 N Φ + o(1), σ for a r < a, (2.14) P{η (N) r} = (1 P r ) N ((1 + o(1))), a r = a. (2.15)
24 Theorem Suppose that the random variable ξ = ξ(θ) has distribution (1.4), condition (1.2) is satisfied, and θ K < R. Let r N and b r 0. Let θ = θ(n) be such that Np r+1 (θ) λ where 0 < λ <. Then, as n, N such that n N r/(r+1), we have P{η (N) = r} = e λ + o(1), (2.16) P{η (N) = r + 1} = 1 e λ + o(1). (2.17)
25 The previous theorem is valid with weaker conditions in the case of r = 0. Corollary Suppose that the random variable ξ = ξ(θ) has distribution (1.4), condition (1.2) is satisfied, and θ K < R. Let r = 0. Let θ = θ(n) be such that Np 1 (θ) λ where 0 < λ <. Then, as n, N, we have P{η (N) = 0} = e λ + o(1) and P{η (N) = 1} = 1 e λ + o(1). To prove it we have to use the next theorem.
26 Theorem Suppose that the random variable ξ = ξ(θ) has distribution (1.4), condition (1.2) is satisfied, and θ K < R. Let r = 0 and let n N be fixed. Let θ = θ(n) be such that Np 1 (θ) λ where 0 < λ <. Then, as N, we have P{η (N) = 0} = P{η (N) = 1} = 1 e λ n l=0 λl e λ l! e λ n l=0 λl e λ l! + o(1), (2.18) + o(1). (2.19)
27 Chuprunov, A.N. and Fazekas, I. (2005). Inequalities and strong laws of large numbers for random allocations. Acta Math. Hungar. 109, no. 1-2, Chuprunov, A.N. and Fazekas, I. (2010). An inequality for moments and its applications to the generalized allocation scheme. Publ. Math. Debrecen, 76, no. 3, Chuprunov, A.N. and Fazekas, I. (2010). An exponential inequality and strong limit theorems for conditional expectations. Period. Math. Hungar. 61, no. 1-2, Erdős P. and Rényi A. (1960). On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. Ser. A. 5,
28 Gnedenko, B.V. and Kolmogorov, A.N. (1954). Limit distributions for sums of independent random variables. Addison-Wesley Publishing Company, Inc., Cambridge, Mass. Kolchin, A.V. (2003). On limit theorems for the generalised allocation scheme. (English. Russian original) Discrete Math. Appl. 13, no. 6, Kolchin, A. V. and Kolchin, V. F. (2006). On transition of distributions of sums of independent identically distributed random variables from one lattice to another in the generalised allocation scheme. (Russian) Diskret. Mat. 18, no. 4, Kolchin, A. V. and Kolchin, V. F. (2007). On the transition of distributions of sums of random variables related to the generalised allocation scheme from one lattice to another. (Russian) Diskret. Mat. 19, no. 3, Kolchin, V.F. (1968). A class of limit theorems for conditional distributions. Litovsk. Matem. Sb. 8, no. 1,
29 Kolchin, V.F. (1999). Random Graphs. Cambridge University Press, Cambridge. Pavlov, Yu. L. (2000). Random Forests. VSP, Utrecht. Petrov, V. V. (1965). On the probabilities of large deviations for sums of independent random variables. (English. Russian original) Theor. Probab. Appl. 10, Petrov V.V. (1995). Limit theorems of probability theory. Sequences of independent random variables. Oxford Studies in Probability. 4. Oxford: Clarendon Press. Rozovskii, L. V. (2003). Probabilities of large deviations for some classes of distributions satisfying the Cramér condition. (Russian) Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 298 (2003), Veroyatn. i Stat. 6, , ; translation in J. Math. Sci. (N. Y.) 128 (2005), no. 1,
A generalized allocation scheme
Annales Mathematicae et Informaticae 39 (202) pp. 57 70 Proceedings of the Conference on Stochastic Models and their Applications Faculty of Informatics, University of Debrecen, Debrecen, Hungary, August
More informationLimit theorems for the longest run
Annales Mathematicae et Informaticae 36 (009) pp. 33 4 http://ami.ektf.hu Limit theorems for the longest run József Túri University of Miskolc, Department of Descriptive Geometry Submitted June 009; Accepted
More informationMATH4427 Notebook 2 Spring 2016. 2 MATH4427 Notebook 2 3. 2.1 Definitions and Examples... 3. 2.2 Performance Measures for Estimators...
MATH4427 Notebook 2 Spring 2016 prepared by Professor Jenny Baglivo c Copyright 2009-2016 by Jenny A. Baglivo. All Rights Reserved. Contents 2 MATH4427 Notebook 2 3 2.1 Definitions and Examples...................................
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 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 informationWHERE DOES THE 10% CONDITION COME FROM?
1 WHERE DOES THE 10% CONDITION COME FROM? The text has mentioned The 10% Condition (at least) twice so far: p. 407 Bernoulli trials must be independent. If that assumption is violated, it is still okay
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 informationAggregate Loss Models
Aggregate Loss Models Chapter 9 Stat 477 - Loss Models Chapter 9 (Stat 477) Aggregate Loss Models Brian Hartman - BYU 1 / 22 Objectives Objectives Individual risk model Collective risk model Computing
More informationNotes on Continuous Random Variables
Notes on Continuous Random Variables Continuous random variables are random quantities that are measured on a continuous scale. They can usually take on any value over some interval, which distinguishes
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 informationMath 461 Fall 2006 Test 2 Solutions
Math 461 Fall 2006 Test 2 Solutions Total points: 100. Do all questions. Explain all answers. No notes, books, or electronic devices. 1. [105+5 points] Assume X Exponential(λ). Justify the following two
More information( ) ( ) [2],[3],[4],[5],[6],[7]
( ) ( ) Lebesgue Takagi, - []., [2],[3],[4],[5],[6],[7].,. [] M. Hata and M. Yamaguti, The Takagi function and its generalization, Japan J. Appl. Math., (984), 83 99. [2] T. Sekiguchi and Y. Shiota, A
More informationAsymptotics for a discrete-time risk model with Gamma-like insurance risks. Pokfulam Road, Hong Kong
Asymptotics for a discrete-time risk model with Gamma-like insurance risks Yang Yang 1,2 and Kam C. Yuen 3 1 Department of Statistics, Nanjing Audit University, Nanjing, 211815, China 2 School of Economics
More information6 PROBABILITY GENERATING FUNCTIONS
6 PROBABILITY GENERATING FUNCTIONS Certain derivations presented in this course have been somewhat heavy on algebra. For example, determining the expectation of the Binomial distribution (page 5.1 turned
More information1 Prior Probability and Posterior Probability
Math 541: Statistical Theory II Bayesian Approach to Parameter Estimation Lecturer: Songfeng Zheng 1 Prior Probability and Posterior Probability Consider now a problem of statistical inference in which
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 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 informationMath 151. Rumbos Spring 2014 1. Solutions to Assignment #22
Math 151. Rumbos Spring 2014 1 Solutions to Assignment #22 1. An experiment consists of rolling a die 81 times and computing the average of the numbers on the top face of the die. Estimate the probability
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 informationSTAT 315: HOW TO CHOOSE A DISTRIBUTION FOR A RANDOM VARIABLE
STAT 315: HOW TO CHOOSE A DISTRIBUTION FOR A RANDOM VARIABLE TROY BUTLER 1. Random variables and distributions We are often presented with descriptions of problems involving some level of uncertainty about
More informationSEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
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 informationExact Confidence Intervals
Math 541: Statistical Theory II Instructor: Songfeng Zheng Exact Confidence Intervals Confidence intervals provide an alternative to using an estimator ˆθ when we wish to estimate an unknown parameter
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 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 informationFor a partition B 1,..., B n, where B i B j = for i. A = (A B 1 ) (A B 2 ),..., (A B n ) and thus. P (A) = P (A B i ) = P (A B i )P (B i )
Probability Review 15.075 Cynthia Rudin A probability space, defined by Kolmogorov (1903-1987) consists of: A set of outcomes S, e.g., for the roll of a die, S = {1, 2, 3, 4, 5, 6}, 1 1 2 1 6 for the roll
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 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 informationA simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
More informationECE302 Spring 2006 HW4 Solutions February 6, 2006 1
ECE302 Spring 2006 HW4 Solutions February 6, 2006 1 Solutions to HW4 Note: Most of these solutions were generated by R. D. Yates and D. J. Goodman, the authors of our textbook. I have added comments in
More informationPrime power degree representations of the symmetric and alternating groups
Prime power degree representations of the symmetric and alternating groups Antal Balog, Christine Bessenrodt, Jørn B. Olsson, Ken Ono Appearing in the Journal of the London Mathematical Society 1 Introduction
More informationJoint Exam 1/P Sample Exam 1
Joint Exam 1/P Sample Exam 1 Take this practice exam under strict exam conditions: Set a timer for 3 hours; Do not stop the timer for restroom breaks; Do not look at your notes. If you believe a question
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 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 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 informationEmbedding nearly-spanning bounded degree trees
Embedding nearly-spanning bounded degree trees Noga Alon Michael Krivelevich Benny Sudakov Abstract We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of
More informationChapter 3: DISCRETE RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS. Part 3: Discrete Uniform Distribution Binomial Distribution
Chapter 3: DISCRETE RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS Part 3: Discrete Uniform Distribution Binomial Distribution Sections 3-5, 3-6 Special discrete random variable distributions we will cover
More informationE3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
More informationSTAT 830 Convergence in Distribution
STAT 830 Convergence in Distribution Richard Lockhart Simon Fraser University STAT 830 Fall 2011 Richard Lockhart (Simon Fraser University) STAT 830 Convergence in Distribution STAT 830 Fall 2011 1 / 31
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 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 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 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 informationON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska
Pliska Stud. Math. Bulgar. 22 (2015), STUDIA MATHEMATICA BULGARICA ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION E. I. Pancheva, A. Gacovska-Barandovska Smirnov (1949) derived four
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 information10.2 Series and Convergence
10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and
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 informationIntroduction to Probability
Introduction to Probability EE 179, Lecture 15, Handout #24 Probability theory gives a mathematical characterization for experiments with random outcomes. coin toss life of lightbulb binary data sequence
More informationMaster s Theory Exam Spring 2006
Spring 2006 This exam contains 7 questions. You should attempt them all. Each question is divided into parts to help lead you through the material. You should attempt to complete as much of each problem
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 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 informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 18. A Brief Introduction to Continuous Probability
CS 7 Discrete Mathematics and Probability Theory Fall 29 Satish Rao, David Tse Note 8 A Brief Introduction to Continuous Probability Up to now we have focused exclusively on discrete probability spaces
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 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 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 informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More informationChapter 5: Normal Probability Distributions - Solutions
Chapter 5: Normal Probability Distributions - Solutions Note: All areas and z-scores are approximate. Your answers may vary slightly. 5.2 Normal Distributions: Finding Probabilities If you are given that
More information4. Continuous Random Variables, the Pareto and Normal Distributions
4. Continuous Random Variables, the Pareto and Normal Distributions A continuous random variable X can take any value in a given range (e.g. height, weight, age). The distribution of a continuous random
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 informationIEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem
IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem Time on my hands: Coin tosses. Problem Formulation: Suppose that I have
More informationWeek 1: Introduction to Online Learning
Week 1: Introduction to Online Learning 1 Introduction This is written based on Prediction, Learning, and Games (ISBN: 2184189 / -21-8418-9 Cesa-Bianchi, Nicolo; Lugosi, Gabor 1.1 A Gentle Start Consider
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 informationAn Introduction to Basic Statistics and Probability
An Introduction to Basic Statistics and Probability Shenek Heyward NCSU An Introduction to Basic Statistics and Probability p. 1/4 Outline Basic probability concepts Conditional probability Discrete Random
More informationPrinciple of Data Reduction
Chapter 6 Principle of Data Reduction 6.1 Introduction An experimenter uses the information in a sample X 1,..., X n to make inferences about an unknown parameter θ. If the sample size n is large, then
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 informationSome special discrete probability distributions
University of California, Los Angeles Department of Statistics Statistics 100A Instructor: Nicolas Christou Some special discrete probability distributions Bernoulli random variable: It is a variable that
More informationChapter 5 Discrete Probability Distribution. Learning objectives
Chapter 5 Discrete Probability Distribution Slide 1 Learning objectives 1. Understand random variables and probability distributions. 1.1. Distinguish discrete and continuous random variables. 2. Able
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 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 informationa 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 informationGenerating Functions
Chapter 10 Generating Functions 10.1 Generating Functions for Discrete Distributions So far we have considered in detail only the two most important attributes of a random variable, namely, the mean and
More information1 Sufficient statistics
1 Sufficient statistics A statistic is a function T = rx 1, X 2,, X n of the random sample X 1, X 2,, X n. Examples are X n = 1 n s 2 = = X i, 1 n 1 the sample mean X i X n 2, the sample variance T 1 =
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 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 informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
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 informationStern Sequences for a Family of Multidimensional Continued Fractions: TRIP-Stern Sequences
Stern Sequences for a Family of Multidimensional Continued Fractions: TRIP-Stern Sequences arxiv:1509.05239v1 [math.co] 17 Sep 2015 I. Amburg K. Dasaratha L. Flapan T. Garrity C. Lee C. Mihaila N. Neumann-Chun
More informationLecture 5 : The Poisson Distribution
Lecture 5 : The Poisson Distribution Jonathan Marchini November 10, 2008 1 Introduction Many experimental situations occur in which we observe the counts of events within a set unit of time, area, volume,
More informationFrom Binomial Trees to the Black-Scholes Option Pricing Formulas
Lecture 4 From Binomial Trees to the Black-Scholes Option Pricing Formulas In this lecture, we will extend the example in Lecture 2 to a general setting of binomial trees, as an important model for a single
More information9 More on differentiation
Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......
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 informationThe Advantages and Disadvantages of Online Linear Optimization
LINEAR PROGRAMMING WITH ONLINE LEARNING TATSIANA LEVINA, YURI LEVIN, JEFF MCGILL, AND MIKHAIL NEDIAK SCHOOL OF BUSINESS, QUEEN S UNIVERSITY, 143 UNION ST., KINGSTON, ON, K7L 3N6, CANADA E-MAIL:{TLEVIN,YLEVIN,JMCGILL,MNEDIAK}@BUSINESS.QUEENSU.CA
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 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 informationLecture 8: More Continuous Random Variables
Lecture 8: More Continuous Random Variables 26 September 2005 Last time: the eponential. Going from saying the density e λ, to f() λe λ, to the CDF F () e λ. Pictures of the pdf and CDF. Today: the Gaussian
More informationSTT315 Chapter 4 Random Variables & Probability Distributions KM. Chapter 4.5, 6, 8 Probability Distributions for Continuous Random Variables
Chapter 4.5, 6, 8 Probability Distributions for Continuous Random Variables Discrete vs. continuous random variables Examples of continuous distributions o Uniform o Exponential o Normal Recall: A random
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 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 informationEfficiency and the Cramér-Rao Inequality
Chapter Efficiency and the Cramér-Rao Inequality Clearly we would like an unbiased estimator ˆφ (X of φ (θ to produce, in the long run, estimates which are fairly concentrated i.e. have high precision.
More informationDongfeng Li. Autumn 2010
Autumn 2010 Chapter Contents Some statistics background; ; Comparing means and proportions; variance. Students should master the basic concepts, descriptive statistics measures and graphs, basic hypothesis
More informationCounting Primes whose Sum of Digits is Prime
2 3 47 6 23 Journal of Integer Sequences, Vol. 5 (202), Article 2.2.2 Counting Primes whose Sum of Digits is Prime Glyn Harman Department of Mathematics Royal Holloway, University of London Egham Surrey
More informationA Turán Type Problem Concerning the Powers of the Degrees of a Graph
A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:
More informationSupplement to Call Centers with Delay Information: Models and Insights
Supplement to Call Centers with Delay Information: Models and Insights Oualid Jouini 1 Zeynep Akşin 2 Yves Dallery 1 1 Laboratoire Genie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, 92290
More informationA LOGNORMAL MODEL FOR INSURANCE CLAIMS DATA
REVSTAT Statistical Journal Volume 4, Number 2, June 2006, 131 142 A LOGNORMAL MODEL FOR INSURANCE CLAIMS DATA Authors: Daiane Aparecida Zuanetti Departamento de Estatística, Universidade Federal de São
More informationProbability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur
Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce
More informationHomework 4 - KEY. Jeff Brenion. June 16, 2004. Note: Many problems can be solved in more than one way; we present only a single solution here.
Homework 4 - KEY Jeff Brenion June 16, 2004 Note: Many problems can be solved in more than one way; we present only a single solution here. 1 Problem 2-1 Since there can be anywhere from 0 to 4 aces, the
More information4.1 4.2 Probability Distribution for Discrete Random Variables
4.1 4.2 Probability Distribution for Discrete Random Variables Key concepts: discrete random variable, probability distribution, expected value, variance, and standard deviation of a discrete random variable.
More informationFactoring Patterns in the Gaussian Plane
Factoring Patterns in the Gaussian Plane Steve Phelps Introduction This paper describes discoveries made at the Park City Mathematics Institute, 00, as well as some proofs. Before the summer I understood
More informationx a x 2 (1 + x 2 ) n.
Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number
More informationErrata and updates for ASM Exam C/Exam 4 Manual (Sixteenth Edition) sorted by page
Errata for ASM Exam C/4 Study Manual (Sixteenth Edition) Sorted by Page 1 Errata and updates for ASM Exam C/Exam 4 Manual (Sixteenth Edition) sorted by page Practice exam 1:9, 1:22, 1:29, 9:5, and 10:8
More information