Chapter 5. Logistic Processes

Size: px
Start display at page:

Download "Chapter 5. Logistic Processes"

Transcription

1 Chapter 5 Logistic Processes * 5.1 Introduction The logistic distribution is the most commonly used probability model for demographic contexts for modeling growth of populations. Oliver (1964) use it to nlodel agricultural production data. Fisk (1961) used it in studying lnconle distribution. Many authors used it to model growth of human population. Plackett (1959) used it to model survival data. Berkson (1953) used it in studying the growth of bioassays. Grizzle (1961) used it in the area of public health. Arnold (1989). (1993), Arnold and Robertson (1989), Sim (1993) use the logistic distribution in the construction of autoregressive time series models having different structures. In the present chapter we generalize the standard logistic distribution to obtain a wider class of distributions. In sectlon 5.2, the new generalized logistic distribution is introduced and its distributional properties are investigated. The graphs corresponding to probability density function distribution function and hazard rate function are given and it is shown to be of use * The results included in (hi> chapter were partly presented in the form of a paper entitled "Marshall Olkin generalized Logistic Distribution and its applications in time series modeling" jointly by Alice Thomas and K.K.Jose. at National Seminar on Recent Trends in Statistics and Workshop on Statistical Computing held at Nehm Arts and Science College, Kanjangad during January ,

2 to model different typeis of reliability data. It is shown that this distribution is geometrically extreme stable. We apply these to a more general family called semi logistic family as in the lines of Pillai (1991). In section 5.3, AK (1) and AR (k) model with Marshall Olkin generalized logistic (MOCiL) marginal is constructed and studied. In section 5.4, Marshall Olkin semi logistic (MOSL) distribution is introduced and its properties are studied. In section 5.5, first and kth order autoregressive minification structure with MOSL marginal is constructed and its properties are studied. In section 5.6, Marshall Olkin bivariate logistic (MOBL) family is considered and some characterizations are obtained. 5.2 Marshall Olkin generalized logistic family We consider the tvvo parameter logistic distribution with survival function Then substituting in (2.2.1 :I we get a new family of distributions, which we shall refer to as the MarshallOlkin Generalized Logistic (MOGL) family, whose survival function is given by a Table 5.1 gives the cumulative distribution function of MOGL distribution. The probability density function corresponding to G is given by

3 The hazard rate is given by The moment generating function of X is The expected value of X is If XI, X,,...,X, are independent and identically distributed random variables having the survival function of MOGL G(x), then [ 2r U, = min( XI. X2,...,X,,) has the survival function 1 +e. 'Table 5.2 shows the expected values of X for various combinations of a and 8 when h = 1. Figure 5.1 gives the graph of probability density function g (x). Figure 5.2 gives the graph of hazard rate function r (x). Theorem MarshallOlkin generalized logistci distribution is geometric extreme stable Proof Proceeding as in Theorern 3.4.1, we have G (x; p) = p F(x) I (1 p) F(X) Suppose F (x) =: w. /{a+o exp (h x))

4 which is the survival function of MOGL. Then G (x) =pa l{pa+q exp (h x)} Hence U is geometric minimum stable. Hence V is geometric maximum stable. Hence the family of MOGL distributions with the survival function of the form F (x) = ~1 /{IX+O exp (A x)), is geometricextreme stable. Theorem Let (Xi, i 2 1) be a sequence of independent and identically distributed random variables with common survival function F(x) and N be a geometric random variable with parameter p and P(N = n) = p q "~'; n = 1,2,..., 0 < p < 1, q =Ip, which is independent of {Xi)for all i 2 1. Let UN = min X,. Then {UN] is distributed as MOiSi'N GL if and only if {X,) is distributed as logistic. Proof Proceeding as in Theorem we have Suppose

5 H (x) = w /{a+e exp (A x)), which is the survi~al function of MOGL. This proves the sufficiency part of the theorem. Conversely suppose H (x) = a/{a+h exp (h x)). Then we get which is the survival function of logistic. 5.3 An AR (1) model with MOGL marginal distribution Now we consider an AR (1) model having stationary marginal distribution as the MOGL distribution. Theorem Consider an AR (1) structure given by (2.3.1), where {E,} is a sequence of independent and identically distributed random variables independent of {X,,, X,.,,... ), then {X,) is a stationary Markovian AR(1) process with MOGL marginals if and only if {E.) is distributed as logistic distribution. Proof Proceeding as in the case of theorem if we take then it easily follows that F. (x) =a /(a+@ exp (h x)), which is the survival function of MOGL.

6 Conversely. if we take, it is easy to show that F,,(x) is distributed as logistic and the process is stationary. In order to establish stationarity we proceed as follows. d Assume X,,., = MOGL and E, = logistic. Then Fx,, (x) =a /{u+h exp (h x)). This establishes that ( X is distributed as MOGL. Even if X,, is arbitrary, it is easy to establish that X } is stationary and is asymptotically marginally distributed as MOGL. Crollary Consider an autoregressive minification process X, of order k with structure (2.5.1). Then {Xn} has stationary marginal distribution as MOGL if and only if {E,] is distributed as logistic Sample path behaviour The sample path of' the process for different values of p and h are given in Figure 5.4. The simulated sample path using 100 observations generated from the MOCiLAR (1) process with p=0.3, 0.5 and 0.9 and h = 0.5, 1 and 2 are given respectively in the figure 5.4.The sample path behaviour of the MOGLAR (1) process seems to be distinctive and is adjustable through the parameters p and a. This makes the model very rich. Mainly there seems to be three cases: (4)runs of increasing values up runs (5)runs of decreasing values down runs (6) both (peaks). These observations can be verified by referring to the Table 5.3 showing P (X, < X,.,).These probabilities are obtained

7 through a Monte Carlo simulation procedure. Sequences of 100, 300, 500, observatxons from MOGLAR (1) process are generated repeatedly for ten tlrnes and for each sequence the probability is estimated. A table of such probabilities is provided with the average from ten trials along wilh an estimate of standard error (see Table 5.3). 5.4 Semi logistic family of distributions Pillai ( ) intrclduced the semipareto distribution. In a similar manner we introduce the semilogistic distribution as one having the survival function F(x) = P (X > X) = 1 I + exp(v(x)) where ~ (x) satisfies the functional equation ( ). Hence the semilogistic family is a wide class of distributions including the logistic distributions. When

8 Theorem Let {X,. i 2 I ) be a sequence of independent and identically distributed random variables with common survival function F(x) and N be a geometric random variable with parameter p and P(N = n) = p q "I; n =1,2,..., 0 < p <: 1, q =Ip, which is independent of {X,}for all i L 1. Let U, = min X,. Then {UN) is distributed as MOSL if and I<,<\ only if {X,) is distributed as semi logistic. Proof Proceeding as in Theorem we have 1 Suppose F(x) = I+ exp(w (x)) ' I c'v' 1' I' Then H (x) = which is the survival function of MOSL. This proves the sufficiency part of the theorem. Conversely suppose Then we get which is the survival function of semi logistic.

9 5.5 An AR (1) model with MOSL marginal distributions Theorem Consider an AR (I.) structure given by (2.3.1). where {E,] is a sequence of independent and identically distributed random variables independent of X,, then { X,) is a stationary Markovian AR (1) process with MOSL marginals if and only if (E,} is distributed as semilogistic distribution. Proof Proceeding as in the case of Theorem if we take then it easily follows that F X(~) = 1 1 I + ~ev'*' P which is the survival function of MOSL. Conversely if we take it is easy to show that F,,,(x) is distributed as semi logistic and the process is stationary. In order to establish stationarity we proceed as follows.,i,i Assume X,., =MOSI, and E.= semilogistic. I Then F x,, (x) =. I I+ (Y'" P

10 This establishes that ) is distributed as MOSL. Even if Xo is arbitrary, it is easy to establish that {XI is stationary and is asymptotically marginally distributed as MOSL. Theorem Consider an autoregressive minification process X, of order k with structure (2.5.1). Then X ) has stationary marginal distribution as MOSL if and only if {E.} is distributed as semilogistic. 5.6 Marshall Olkin bivariate logistic family of distributions function We consider the bivariate semilogistic distribution with survival 1 F (x, y) =P!X > x,y > y) = I1 + exp(v(x. Y)) where ylx. y) satisfies the functional equation (3.6.3) From (3.6.1) we can see that the new survival function is G (x, Y) = ll(l+(llp) exp (w(x,y))), (5.6.2) which we shall refer to as MarshallOlkin bivariate semilogistic distribution denoted as MOBSL. Consider the bivariate logistic distribution with survival function I F (x, y) = I + 'ti, \fi2 ;(x, Y)E R2, PI. 02 > 0. From (3.6. l), the new survival function is which we shall refer to as MarshallOlkin bivariate logistic distribution denoted as MOBL.

11 If (X,, Y,), i = 1,2,...,n are independent and identically distributed random variables having the survival function of MOBL G(X,~), then (minx,, miny,) has the survival function 1 Theorem Let N be a geometric random variable with parameter p and P(N = n) = p q"~', n =:I,2,...,0 < p < 1, q =1p. Consider a sequence {(Xi, Yi). i 2 1 ] be independently and identically distributed random vectors with common!survival function F(X,~). N and (Xi,Yi) are independent for all i 2 1. Let UN = min X, and VN = mink;. Then the IiiiN lc_i<n random vectors (UN, VN) and (X,, Y,) are distributed as MOBL if and only if (X,, Y,) have BL distribution. Proof Consider S (x, y) = P [IJN > x, VN > y] Let F (x, y) logistic:. ',which is the survival function of bivariate I +erd'."'? Substituting this in the above equation we have which is the survival function of MOBL. Conversely suppose that

12 s (x, y) x 1 I t (II~)G,~~~+~~. Then p F(x, y) I [ I ( 1p) F(x, y)] = On simplifying we get 1 I+ (l/a)er8'+"' ' Hence the proof is complete. Let (Nk, k 2 I } be a sequence of geometric random variables with parameters p,, 0 sr pk < 1. Define Fk(x,y) = PIUNk.I >x, VNk.[>y]r k=2,3... = pk~, FkI~x,~)~) I { I(~P~~) Fk,(x,y)~ (5.6.4) Here we refer ~k as ithe survival function of the geometric (P~.~) minimum of i.i.d. random vectors with Fk., as the common survival function. Theorem Let {(X,, Y,), i 21) be a sequence of i.i.d. bivariate random vectors with common survival function G(x,y). Define FI= 6 and Fk as the survival function of the geometric (~k.~) minimum of i.i.d.random vectors with common survival function Fk.lr k = Then R(x, y:) = G(X, Y) (5.6.5) if and only if (Xi,Y, ) has MOBL, distribution. Proof By definition, the survival function Fk satisfies the equation (5.6.4). 1 1 Lt(1,'p)e x"+,r ~+O(X,Y)' We have G(x, y)

13 J) is a monotonically increasing function in both x and y and lim lim $(.x,,v) =O andlimlim$(x, y) = m. v,*. I, So we can write F~x. Y) = +.k = 1,2,... ~ ~.. Substituting this in (5.6.4), we get Recursively using this relation we have This implies that Hence Fk (x. y) = G(x, y) This proves the sufficiency part. Conversely assume that equation (5.6.5) is true. By the hypothesis of the theorem equation (5.6.6) follows. Thus equation (5.6.5) and equation (5.6.6) together lead to the (.K>?.I This implies v) :=. PlP?...P{ I Hence the proof is complete. Theorem ( X Consider a bivariate autoregressive minification process Y ) having structure (3.7.1). Then (XY)) has stationary

14 marginal distribution as MOBL distribution if and only if {(U,,V,)] is jointly distributed as bivariate logistic distribution. Proof is similar to Theorem Theorem Consider a kth order bivariate autoregressive model having the structure (3.8.1). Then {(X,, Y,)] has stationary marginal distribution as MOBL if and only if {(U,, V,)] is jointly distributed as bivariate logistic distribution. Remark The abov~e theorems can be extended to bivariate semi logistic distributions in an analogous manner.

15 Table 4.1 c.d.f. table for the MOGP distribution for fi = 1

16 Table 5.2. Expected values of X for different values of a and 8 when h = 1

17 Fig 5.1 p.d.f. of MOGL for various values of a and h = 1,8 = 1

18 Fig 5.2 Hazard rate function of MOGL for various values of a and l. = 1,8 = 1

19 Table 5.3 P ( X, < X..,) for the MOGLAR(1) process where h = 1,8 = 1. (Standard error in brackets) Sam le size I

20 I Fig 5.3 Sample paths of MOGLAR (1) process for different values of p and P

21 Fig 5.4 Survival Function of MOBL

Marshall-Olkin Univariate and Bivariate Logistic Processes

Marshall-Olkin Univariate and Bivariate Logistic Processes CHAPTER 5 Marshall-Olkin Univariate and Bivariate Logistic Processes 5. Introduction The logistic distribution is the most commonly used probability model for modelling data on population growth, bioassay,

More information

Gumbel Distribution: Generalizations and Applications

Gumbel Distribution: Generalizations and Applications CHAPTER 3 Gumbel Distribution: Generalizations and Applications 31 Introduction Extreme Value Theory is widely used by many researchers in applied sciences when faced with modeling extreme values of certain

More information

Marshall-Olkin Bivariate Exponential Distribution: Generalisations and Applications

Marshall-Olkin Bivariate Exponential Distribution: Generalisations and Applications CHAPTER 6 Marshall-Olkin Bivariate Exponential Distribution: Generalisations and Applications 6.1 Introduction Exponential distributions have been introduced as a simple model for statistical analysis

More information

A BIVARIATE MARSHALL AND OLKIN EXPONENTIAL MINIFICATION PROCESS

A BIVARIATE MARSHALL AND OLKIN EXPONENTIAL MINIFICATION PROCESS Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacyu/filomat Filomat 22: (2008), 69 77 A BIVARIATE MARSHALL AND OLKIN EXPONENTIAL MINIFICATION PROCESS Miroslav M

More information

A Marshall-Olkin Gamma Distribution and Process

A Marshall-Olkin Gamma Distribution and Process CHAPTER 3 A Marshall-Olkin Gamma Distribution and Process 3.1 Introduction Gamma distribution is a widely used distribution in many fields such as lifetime data analysis, reliability, hydrology, medicine,

More information

On q-gamma Distributions, Marshall-Olkin q-gamma Distributions and Minification Processes

On q-gamma Distributions, Marshall-Olkin q-gamma Distributions and Minification Processes CHAPTER 4 On q-gamma Distributions, Marshall-Olkin q-gamma Distributions and Minification Processes 4.1 Introduction Several skewed distributions such as logistic, Weibull, gamma and beta distributions

More information

Some Generalizations of Weibull Distribution and Related Processes

Some Generalizations of Weibull Distribution and Related Processes Journal of Statistical Theory and Applications, Vol. 4, No. 4 (December 205), 425-434 Some Generalizations of Weibull Distribution and Related Processes K. Jayakumar Department of Statistics, University

More information

Measure-theoretic probability

Measure-theoretic probability Measure-theoretic probability Koltay L. VEGTMAM144B November 28, 2012 (VEGTMAM144B) Measure-theoretic probability November 28, 2012 1 / 27 The probability space De nition The (Ω, A, P) measure space is

More information

Three hours. To be supplied by the Examinations Office: Mathematical Formula Tables and Statistical Tables THE UNIVERSITY OF MANCHESTER.

Three hours. To be supplied by the Examinations Office: Mathematical Formula Tables and Statistical Tables THE UNIVERSITY OF MANCHESTER. Three hours To be supplied by the Examinations Office: Mathematical Formula Tables and Statistical Tables THE UNIVERSITY OF MANCHESTER EXTREME VALUES AND FINANCIAL RISK Examiner: Answer QUESTION 1, QUESTION

More information

Preliminary statistics

Preliminary statistics 1 Preliminary statistics The solution of a geophysical inverse problem can be obtained by a combination of information from observed data, the theoretical relation between data and earth parameters (models),

More information

Random Variables. Random variables. A numerically valued map X of an outcome ω from a sample space Ω to the real line R

Random Variables. Random variables. A numerically valued map X of an outcome ω from a sample space Ω to the real line R In probabilistic models, a random variable is a variable whose possible values are numerical outcomes of a random phenomenon. As a function or a map, it maps from an element (or an outcome) of a sample

More information

Random Variables. Cumulative Distribution Function (CDF) Amappingthattransformstheeventstotherealline.

Random Variables. Cumulative Distribution Function (CDF) Amappingthattransformstheeventstotherealline. Random Variables Amappingthattransformstheeventstotherealline. Example 1. Toss a fair coin. Define a random variable X where X is 1 if head appears and X is if tail appears. P (X =)=1/2 P (X =1)=1/2 Example

More information

Multiple Random Variables

Multiple Random Variables Multiple Random Variables This Version: July 30, 2015 Multiple Random Variables 2 Now we consider models with more than one r.v. These are called multivariate models For instance: height and weight An

More information

Multivariate Random Variable

Multivariate Random Variable Multivariate Random Variable Author: Author: Andrés Hincapié and Linyi Cao This Version: August 7, 2016 Multivariate Random Variable 3 Now we consider models with more than one r.v. These are called multivariate

More information

Probability and Stochastic Processes

Probability and Stochastic Processes Probability and Stochastic Processes A Friendly Introduction Electrical and Computer Engineers Third Edition Roy D. Yates Rutgers, The State University of New Jersey David J. Goodman New York University

More information

Multivariate Normal-Laplace Distribution and Processes

Multivariate Normal-Laplace Distribution and Processes CHAPTER 4 Multivariate Normal-Laplace Distribution and Processes The normal-laplace distribution, which results from the convolution of independent normal and Laplace random variables is introduced by

More information

Stat 512 Homework key 2

Stat 512 Homework key 2 Stat 51 Homework key October 4, 015 REGULAR PROBLEMS 1 Suppose continuous random variable X belongs to the family of all distributions having a linear probability density function (pdf) over the interval

More information

Chapter 3 sections. SKIP: 3.10 Markov Chains. SKIP: pages Chapter 3 - continued

Chapter 3 sections. SKIP: 3.10 Markov Chains. SKIP: pages Chapter 3 - continued Chapter 3 sections Chapter 3 - continued 3.1 Random Variables and Discrete Distributions 3.2 Continuous Distributions 3.3 The Cumulative Distribution Function 3.4 Bivariate Distributions 3.5 Marginal Distributions

More information

The random variable 1

The random variable 1 The random variable 1 Contents 1. Definition 2. Distribution and density function 3. Specific random variables 4. Functions of one random variable 5. Mean and variance 2 The random variable A random variable

More information

Probability and Distributions

Probability and Distributions Probability and Distributions What is a statistical model? A statistical model is a set of assumptions by which the hypothetical population distribution of data is inferred. It is typically postulated

More information

A New Class of Positively Quadrant Dependent Bivariate Distributions with Pareto

A New Class of Positively Quadrant Dependent Bivariate Distributions with Pareto International Mathematical Forum, 2, 27, no. 26, 1259-1273 A New Class of Positively Quadrant Dependent Bivariate Distributions with Pareto A. S. Al-Ruzaiza and Awad El-Gohary 1 Department of Statistics

More information

Ph.D. Qualifying Exam Friday Saturday, January 6 7, 2017

Ph.D. Qualifying Exam Friday Saturday, January 6 7, 2017 Ph.D. Qualifying Exam Friday Saturday, January 6 7, 2017 Put your solution to each problem on a separate sheet of paper. Problem 1. (5106) Let X 1, X 2,, X n be a sequence of i.i.d. observations from a

More information

2 Random Variable Generation

2 Random Variable Generation 2 Random Variable Generation Most Monte Carlo computations require, as a starting point, a sequence of i.i.d. random variables with given marginal distribution. We describe here some of the basic methods

More information

EE4601 Communication Systems

EE4601 Communication Systems EE4601 Communication Systems Week 2 Review of Probability, Important Distributions 0 c 2011, Georgia Institute of Technology (lect2 1) Conditional Probability Consider a sample space that consists of two

More information

Copula Regression RAHUL A. PARSA DRAKE UNIVERSITY & STUART A. KLUGMAN SOCIETY OF ACTUARIES CASUALTY ACTUARIAL SOCIETY MAY 18,2011

Copula Regression RAHUL A. PARSA DRAKE UNIVERSITY & STUART A. KLUGMAN SOCIETY OF ACTUARIES CASUALTY ACTUARIAL SOCIETY MAY 18,2011 Copula Regression RAHUL A. PARSA DRAKE UNIVERSITY & STUART A. KLUGMAN SOCIETY OF ACTUARIES CASUALTY ACTUARIAL SOCIETY MAY 18,2011 Outline Ordinary Least Squares (OLS) Regression Generalized Linear Models

More information

(Received March 30, 1953)

(Received March 30, 1953) MEMOIRS OF THE COLLEGE OF SCIENCE, UNIVERSITY OF KYOTO, SERIES, A V ol. XXVIII, Mathematics No. 1, 1953. On the Evaluation of the Derivatives of Solutions of y"=-f (x, y, y'). By Taro YOSHIZAWA (Received

More information

Continuous Random Variables

Continuous Random Variables 1 / 24 Continuous Random Variables Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay February 27, 2013 2 / 24 Continuous Random Variables

More information

Spring 2012 Math 541B Exam 1

Spring 2012 Math 541B Exam 1 Spring 2012 Math 541B Exam 1 1. A sample of size n is drawn without replacement from an urn containing N balls, m of which are red and N m are black; the balls are otherwise indistinguishable. Let X denote

More information

Lecture 21: Convergence of transformations and generating a random variable

Lecture 21: Convergence of transformations and generating a random variable Lecture 21: Convergence of transformations and generating a random variable If Z n converges to Z in some sense, we often need to check whether h(z n ) converges to h(z ) in the same sense. Continuous

More information

Two hours. Statistical Tables to be provided THE UNIVERSITY OF MANCHESTER. 14 January :45 11:45

Two hours. Statistical Tables to be provided THE UNIVERSITY OF MANCHESTER. 14 January :45 11:45 Two hours Statistical Tables to be provided THE UNIVERSITY OF MANCHESTER PROBABILITY 2 14 January 2015 09:45 11:45 Answer ALL four questions in Section A (40 marks in total) and TWO of the THREE questions

More information

Concomitants of Order Statistics of a New Bivariate Finite Range Distribution (NBFRD)

Concomitants of Order Statistics of a New Bivariate Finite Range Distribution (NBFRD) Global Journal of Pure and Applied Mathematics. ISSN 0973-768 Volume 2, Number 2 (206), pp. 69-697 Research India Publications http://www.ripublication.com/gjpam.htm Concomitants of Order Statistics of

More information

MAS223 Statistical Inference and Modelling Exercises

MAS223 Statistical Inference and Modelling Exercises MAS223 Statistical Inference and Modelling Exercises The exercises are grouped into sections, corresponding to chapters of the lecture notes Within each section exercises are divided into warm-up questions,

More information

This exam contains 6 questions. The questions are of equal weight. Print your name at the top of this page in the upper right hand corner.

This exam contains 6 questions. The questions are of equal weight. Print your name at the top of this page in the upper right hand corner. GROUND RULES: This exam contains 6 questions. The questions are of equal weight. Print your name at the top of this page in the upper right hand corner. This exam is closed book and closed notes. Show

More information

Chapter 3 sections. SKIP: 3.10 Markov Chains. SKIP: pages Chapter 3 - continued

Chapter 3 sections. SKIP: 3.10 Markov Chains. SKIP: pages Chapter 3 - continued Chapter 3 sections 3.1 Random Variables and Discrete Distributions 3.2 Continuous Distributions 3.3 The Cumulative Distribution Function 3.4 Bivariate Distributions 3.5 Marginal Distributions 3.6 Conditional

More information

Software Reliability & Testing

Software Reliability & Testing Repairable systems Repairable system A reparable system is obtained by glueing individual non-repairable systems each around a single failure To describe this gluing process we need to review the concept

More information

Exam 1. (2x + 1) 2 9. lim. (rearranging) (x 1 implies x 1, thus x 1 0

Exam 1. (2x + 1) 2 9. lim. (rearranging) (x 1 implies x 1, thus x 1 0 Department of Mathematical Sciences Instructor: Daiva Pucinskaite Calculus I January 28, 2016 Name: Exam 1 1. Evaluate the it x 1 (2x + 1) 2 9. x 1 (2x + 1) 2 9 4x 2 + 4x + 1 9 = 4x 2 + 4x 8 = 4(x 1)(x

More information

Multivariate random variables

Multivariate random variables Multivariate random variables DS GA 1002 Statistical and Mathematical Models http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall16 Carlos Fernandez-Granda Joint distributions Tool to characterize several

More information

Bayesian Methods with Monte Carlo Markov Chains II

Bayesian Methods with Monte Carlo Markov Chains II Bayesian Methods with Monte Carlo Markov Chains II Henry Horng-Shing Lu Institute of Statistics National Chiao Tung University hslu@stat.nctu.edu.tw http://tigpbp.iis.sinica.edu.tw/courses.htm 1 Part 3

More information

Queen s University Department of Mathematics and Statistics. MTHE/STAT 353 Final Examination April 16, 2016 Instructor: G.

Queen s University Department of Mathematics and Statistics. MTHE/STAT 353 Final Examination April 16, 2016 Instructor: G. Student Number Queen s University Department of Mathematics and Statistics MTHE/STAT 353 Final Examination April 6 206 Instructor: G Takahara Proctors are unable to respond to queries about the interpretation

More information

Two hours. To be supplied by the Examinations Office: Mathematical Formula Tables and Statistical Tables THE UNIVERSITY OF MANCHESTER.

Two hours. To be supplied by the Examinations Office: Mathematical Formula Tables and Statistical Tables THE UNIVERSITY OF MANCHESTER. Two hours MATH38181 To be supplied by the Examinations Office: Mathematical Formula Tables and Statistical Tables THE UNIVERSITY OF MANCHESTER EXTREME VALUES AND FINANCIAL RISK Examiner: Answer any FOUR

More information

Lecture 25: Review. Statistics 104. April 23, Colin Rundel

Lecture 25: Review. Statistics 104. April 23, Colin Rundel Lecture 25: Review Statistics 104 Colin Rundel April 23, 2012 Joint CDF F (x, y) = P [X x, Y y] = P [(X, Y ) lies south-west of the point (x, y)] Y (x,y) X Statistics 104 (Colin Rundel) Lecture 25 April

More information

UQ, Semester 1, 2017, Companion to STAT2201/CIVL2530 Exam Formulae and Tables

UQ, Semester 1, 2017, Companion to STAT2201/CIVL2530 Exam Formulae and Tables UQ, Semester 1, 2017, Companion to STAT2201/CIVL2530 Exam Formulae and Tables To be provided to students with STAT2201 or CIVIL-2530 (Probability and Statistics) Exam Main exam date: Tuesday, 20 June 1

More information

Structural Reliability

Structural Reliability Structural Reliability Thuong Van DANG May 28, 2018 1 / 41 2 / 41 Introduction to Structural Reliability Concept of Limit State and Reliability Review of Probability Theory First Order Second Moment Method

More information

Chapter 6: Random Processes 1

Chapter 6: Random Processes 1 Chapter 6: Random Processes 1 Yunghsiang S. Han Graduate Institute of Communication Engineering, National Taipei University Taiwan E-mail: yshan@mail.ntpu.edu.tw 1 Modified from the lecture notes by Prof.

More information

1 Review of Probability and Distributions

1 Review of Probability and Distributions Random variables. A numerically valued function X of an outcome ω from a sample space Ω X : Ω R : ω X(ω) is called a random variable (r.v.), and usually determined by an experiment. We conventionally denote

More information

MA 519 Probability: Review

MA 519 Probability: Review MA 519 : Review Yingwei Wang Department of Mathematics, Purdue University, West Lafayette, IN, USA Contents 1 How to compute the expectation? 1.1 Tail........................................... 1. Index..........................................

More information

Induction, sequences, limits and continuity

Induction, sequences, limits and continuity Induction, sequences, limits and continuity Material covered: eclass notes on induction, Chapter 11, Section 1 and Chapter 2, Sections 2.2-2.5 Induction Principle of mathematical induction: Let P(n) be

More information

THE QUEEN S UNIVERSITY OF BELFAST

THE QUEEN S UNIVERSITY OF BELFAST THE QUEEN S UNIVERSITY OF BELFAST 0SOR20 Level 2 Examination Statistics and Operational Research 20 Probability and Distribution Theory Wednesday 4 August 2002 2.30 pm 5.30 pm Examiners { Professor R M

More information

Part IA Probability. Definitions. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015

Part IA Probability. Definitions. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015 Part IA Probability Definitions Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.

More information

1 Random Variable: Topics

1 Random Variable: Topics Note: Handouts DO NOT replace the book. In most cases, they only provide a guideline on topics and an intuitive feel. 1 Random Variable: Topics Chap 2, 2.1-2.4 and Chap 3, 3.1-3.3 What is a random variable?

More information

STAT 430/510: Lecture 15

STAT 430/510: Lecture 15 STAT 430/510: Lecture 15 James Piette June 23, 2010 Updates HW4 is up on my website. It is due next Mon. (June 28th). Starting today back at section 6.4... Conditional Distribution: Discrete Def: The conditional

More information

P (x). all other X j =x j. If X is a continuous random vector (see p.172), then the marginal distributions of X i are: f(x)dx 1 dx n

P (x). all other X j =x j. If X is a continuous random vector (see p.172), then the marginal distributions of X i are: f(x)dx 1 dx n JOINT DENSITIES - RANDOM VECTORS - REVIEW Joint densities describe probability distributions of a random vector X: an n-dimensional vector of random variables, ie, X = (X 1,, X n ), where all X is are

More information

MA/ST 810 Mathematical-Statistical Modeling and Analysis of Complex Systems

MA/ST 810 Mathematical-Statistical Modeling and Analysis of Complex Systems MA/ST 810 Mathematical-Statistical Modeling and Analysis of Complex Systems Review of Basic Probability The fundamentals, random variables, probability distributions Probability mass/density functions

More information

5 Introduction to the Theory of Order Statistics and Rank Statistics

5 Introduction to the Theory of Order Statistics and Rank Statistics 5 Introduction to the Theory of Order Statistics and Rank Statistics This section will contain a summary of important definitions and theorems that will be useful for understanding the theory of order

More information

EEL 5544 Noise in Linear Systems Lecture 30. X (s) = E [ e sx] f X (x)e sx dx. Moments can be found from the Laplace transform as

EEL 5544 Noise in Linear Systems Lecture 30. X (s) = E [ e sx] f X (x)e sx dx. Moments can be found from the Laplace transform as L30-1 EEL 5544 Noise in Linear Systems Lecture 30 OTHER TRANSFORMS For a continuous, nonnegative RV X, the Laplace transform of X is X (s) = E [ e sx] = 0 f X (x)e sx dx. For a nonnegative RV, the Laplace

More information

Bivariate Paired Numerical Data

Bivariate Paired Numerical Data Bivariate Paired Numerical Data Pearson s correlation, Spearman s ρ and Kendall s τ, tests of independence University of California, San Diego Instructor: Ery Arias-Castro http://math.ucsd.edu/~eariasca/teaching.html

More information

On the Central Limit Theorem for an ergodic Markov chain

On the Central Limit Theorem for an ergodic Markov chain Stochastic Processes and their Applications 47 ( 1993) 113-117 North-Holland 113 On the Central Limit Theorem for an ergodic Markov chain K.S. Chan Department of Statistics and Actuarial Science, The University

More information

Basic concepts of probability theory

Basic concepts of probability theory Basic concepts of probability theory Random variable discrete/continuous random variable Transform Z transform, Laplace transform Distribution Geometric, mixed-geometric, Binomial, Poisson, exponential,

More information

2. Let S stand for an increasing sequence of distinct positive integers In ;}

2. Let S stand for an increasing sequence of distinct positive integers In ;} APPROXIMATION BY POLYNOMIALS By J. A. CLARKSON AND P. ERDÖS 1. Let In ;) be a set of distinct positive integers. According to a theorem of Müntz and Szász, the condition En -.' = - is necessary and sufficient

More information

Lecture 11. Probability Theory: an Overveiw

Lecture 11. Probability Theory: an Overveiw Math 408 - Mathematical Statistics Lecture 11. Probability Theory: an Overveiw February 11, 2013 Konstantin Zuev (USC) Math 408, Lecture 11 February 11, 2013 1 / 24 The starting point in developing the

More information

The Distributions of Sums, Products and Ratios of Inverted Bivariate Beta Distribution 1

The Distributions of Sums, Products and Ratios of Inverted Bivariate Beta Distribution 1 Applied Mathematical Sciences, Vol. 2, 28, no. 48, 2377-2391 The Distributions of Sums, Products and Ratios of Inverted Bivariate Beta Distribution 1 A. S. Al-Ruzaiza and Awad El-Gohary 2 Department of

More information

2 Functions of random variables

2 Functions of random variables 2 Functions of random variables A basic statistical model for sample data is a collection of random variables X 1,..., X n. The data are summarised in terms of certain sample statistics, calculated as

More information

STA205 Probability: Week 8 R. Wolpert

STA205 Probability: Week 8 R. Wolpert INFINITE COIN-TOSS AND THE LAWS OF LARGE NUMBERS The traditional interpretation of the probability of an event E is its asymptotic frequency: the limit as n of the fraction of n repeated, similar, and

More information

2. The CDF Technique. 1. Introduction. f X ( ).

2. The CDF Technique. 1. Introduction. f X ( ). Week 5: Distributions of Function of Random Variables. Introduction Suppose X,X 2,..., X n are n random variables. In this chapter, we develop techniques that may be used to find the distribution of functions

More information

ENSC327 Communications Systems 19: Random Processes. Jie Liang School of Engineering Science Simon Fraser University

ENSC327 Communications Systems 19: Random Processes. Jie Liang School of Engineering Science Simon Fraser University ENSC327 Communications Systems 19: Random Processes Jie Liang School of Engineering Science Simon Fraser University 1 Outline Random processes Stationary random processes Autocorrelation of random processes

More information

Deccan Education Society s FERGUSSON COLLEGE, PUNE (AUTONOMOUS) SYLLABUS UNDER AUTOMONY. SECOND YEAR B.Sc. SEMESTER - III

Deccan Education Society s FERGUSSON COLLEGE, PUNE (AUTONOMOUS) SYLLABUS UNDER AUTOMONY. SECOND YEAR B.Sc. SEMESTER - III Deccan Education Society s FERGUSSON COLLEGE, PUNE (AUTONOMOUS) SYLLABUS UNDER AUTOMONY SECOND YEAR B.Sc. SEMESTER - III SYLLABUS FOR S. Y. B. Sc. STATISTICS Academic Year 07-8 S.Y. B.Sc. (Statistics)

More information

Statistics (1): Estimation

Statistics (1): Estimation Statistics (1): Estimation Marco Banterlé, Christian Robert and Judith Rousseau Practicals 2014-2015 L3, MIDO, Université Paris Dauphine 1 Table des matières 1 Random variables, probability, expectation

More information

Probability, Random Processes and Inference

Probability, Random Processes and Inference INSTITUTO POLITÉCNICO NACIONAL CENTRO DE INVESTIGACION EN COMPUTACION Laboratorio de Ciberseguridad Probability, Random Processes and Inference Dr. Ponciano Jorge Escamilla Ambrosio pescamilla@cic.ipn.mx

More information

Multiple Random Variables

Multiple Random Variables Multiple Random Variables Joint Probability Density Let X and Y be two random variables. Their joint distribution function is F ( XY x, y) P X x Y y. F XY ( ) 1, < x

More information

ECON 3150/4150, Spring term Lecture 6

ECON 3150/4150, Spring term Lecture 6 ECON 3150/4150, Spring term 2013. Lecture 6 Review of theoretical statistics for econometric modelling (II) Ragnar Nymoen University of Oslo 31 January 2013 1 / 25 References to Lecture 3 and 6 Lecture

More information

( x) ( ) F ( ) ( ) ( ) Prob( ) ( ) ( ) X x F x f s ds

( x) ( ) F ( ) ( ) ( ) Prob( ) ( ) ( ) X x F x f s ds Applied Numerical Analysis Pseudo Random Number Generator Lecturer: Emad Fatemizadeh What is random number: A sequence in which each term is unpredictable 29, 95, 11, 60, 22 Application: Monte Carlo Simulations

More information

Basic concepts of probability theory

Basic concepts of probability theory Basic concepts of probability theory Random variable discrete/continuous random variable Transform Z transform, Laplace transform Distribution Geometric, mixed-geometric, Binomial, Poisson, exponential,

More information

Random variables. DS GA 1002 Probability and Statistics for Data Science.

Random variables. DS GA 1002 Probability and Statistics for Data Science. Random variables DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Motivation Random variables model numerical quantities

More information

2 (Statistics) Random variables

2 (Statistics) Random variables 2 (Statistics) Random variables References: DeGroot and Schervish, chapters 3, 4 and 5; Stirzaker, chapters 4, 5 and 6 We will now study the main tools use for modeling experiments with unknown outcomes

More information

Chapter 4 Multiple Random Variables

Chapter 4 Multiple Random Variables Review for the previous lecture Definition: n-dimensional random vector, joint pmf (pdf), marginal pmf (pdf) Theorem: How to calculate marginal pmf (pdf) given joint pmf (pdf) Example: How to calculate

More information

Convergence Concepts of Random Variables and Functions

Convergence Concepts of Random Variables and Functions Convergence Concepts of Random Variables and Functions c 2002 2007, Professor Seppo Pynnonen, Department of Mathematics and Statistics, University of Vaasa Version: January 5, 2007 Convergence Modes Convergence

More information

Positive and null recurrent-branching Process

Positive and null recurrent-branching Process December 15, 2011 In last discussion we studied the transience and recurrence of Markov chains There are 2 other closely related issues about Markov chains that we address Is there an invariant distribution?

More information

Chapter 4. Continuous Random Variables 4.1 PDF

Chapter 4. Continuous Random Variables 4.1 PDF Chapter 4 Continuous Random Variables In this chapter we study continuous random variables. The linkage between continuous and discrete random variables is the cumulative distribution (CDF) which we will

More information

Probability Distributions Columns (a) through (d)

Probability Distributions Columns (a) through (d) Discrete Probability Distributions Columns (a) through (d) Probability Mass Distribution Description Notes Notation or Density Function --------------------(PMF or PDF)-------------------- (a) (b) (c)

More information

Monte Carlo Simulation. CWR 6536 Stochastic Subsurface Hydrology

Monte Carlo Simulation. CWR 6536 Stochastic Subsurface Hydrology Monte Carlo Simulation CWR 6536 Stochastic Subsurface Hydrology Steps in Monte Carlo Simulation Create input sample space with known distribution, e.g. ensemble of all possible combinations of v, D, q,

More information

STAT 512 sp 2018 Summary Sheet

STAT 512 sp 2018 Summary Sheet STAT 5 sp 08 Summary Sheet Karl B. Gregory Spring 08. Transformations of a random variable Let X be a rv with support X and let g be a function mapping X to Y with inverse mapping g (A = {x X : g(x A}

More information

Extreme Value Analysis and Spatial Extremes

Extreme Value Analysis and Spatial Extremes Extreme Value Analysis and Department of Statistics Purdue University 11/07/2013 Outline Motivation 1 Motivation 2 Extreme Value Theorem and 3 Bayesian Hierarchical Models Copula Models Max-stable Models

More information

Section 4.2: Mathematical Induction 1

Section 4.2: Mathematical Induction 1 Section 4.: Mathematical Induction 1 Over the next couple of sections, we shall consider a method of proof called mathematical induction. Induction is fairly complicated, but a very useful proof technique,

More information

Stat 516, Homework 1

Stat 516, Homework 1 Stat 516, Homework 1 Due date: October 7 1. Consider an urn with n distinct balls numbered 1,..., n. We sample balls from the urn with replacement. Let N be the number of draws until we encounter a ball

More information

Katz Family of Distributions and Processes

Katz Family of Distributions and Processes CHAPTER 7 Katz Family of Distributions and Processes 7. Introduction The Poisson distribution and the Negative binomial distribution are the most widely used discrete probability distributions for the

More information

CHARACTERIZATIONS OF THE PARETO DISTRIBUTION BY THE INDEPENDENCE OF RECORD VALUES. Se-Kyung Chang* 1. Introduction

CHARACTERIZATIONS OF THE PARETO DISTRIBUTION BY THE INDEPENDENCE OF RECORD VALUES. Se-Kyung Chang* 1. Introduction JOURNAL OF THE CHUNGCHEONG MATHEMATICAL SOCIETY Volume 20, No., March 2007 CHARACTERIZATIONS OF THE PARETO DISTRIBUTION BY THE INDEPENDENCE OF RECORD VALUES Se-Kyung Chang* Abstract. In this paper, we

More information

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x

More information

Note that r = 0 gives the simple principle of induction. Also it can be shown that the principle of strong induction follows from simple induction.

Note that r = 0 gives the simple principle of induction. Also it can be shown that the principle of strong induction follows from simple induction. Proof by mathematical induction using a strong hypothesis Occasionally a proof by mathematical induction is made easier by using a strong hypothesis: To show P(n) [a statement form that depends on variable

More information

Bootstrapping the Grainger Causality Test With Integrated Data

Bootstrapping the Grainger Causality Test With Integrated Data Bootstrapping the Grainger Causality Test With Integrated Data Richard Ti n University of Reading July 26, 2006 Abstract A Monte-carlo experiment is conducted to investigate the small sample performance

More information

Statistics for Economists Lectures 6 & 7. Asrat Temesgen Stockholm University

Statistics for Economists Lectures 6 & 7. Asrat Temesgen Stockholm University Statistics for Economists Lectures 6 & 7 Asrat Temesgen Stockholm University 1 Chapter 4- Bivariate Distributions 41 Distributions of two random variables Definition 41-1: Let X and Y be two random variables

More information

ST5212: Survival Analysis

ST5212: Survival Analysis ST51: Survival Analysis 8/9: Semester II Tutorial 1. A model for lifetimes, with a bathtub-shaped hazard rate, is the exponential power distribution with survival fumction S(x) =exp{1 exp[(λx) α ]}. (a)

More information

MATH Notebook 5 Fall 2018/2019

MATH Notebook 5 Fall 2018/2019 MATH442601 2 Notebook 5 Fall 2018/2019 prepared by Professor Jenny Baglivo c Copyright 2004-2019 by Jenny A. Baglivo. All Rights Reserved. 5 MATH442601 2 Notebook 5 3 5.1 Sequences of IID Random Variables.............................

More information

Probability Models. 4. What is the definition of the expectation of a discrete random variable?

Probability Models. 4. What is the definition of the expectation of a discrete random variable? 1 Probability Models The list of questions below is provided in order to help you to prepare for the test and exam. It reflects only the theoretical part of the course. You should expect the questions

More information

ACM 116: Lectures 3 4

ACM 116: Lectures 3 4 1 ACM 116: Lectures 3 4 Joint distributions The multivariate normal distribution Conditional distributions Independent random variables Conditional distributions and Monte Carlo: Rejection sampling Variance

More information

Perhaps the simplest way of modeling two (discrete) random variables is by means of a joint PMF, defined as follows.

Perhaps the simplest way of modeling two (discrete) random variables is by means of a joint PMF, defined as follows. Chapter 5 Two Random Variables In a practical engineering problem, there is almost always causal relationship between different events. Some relationships are determined by physical laws, e.g., voltage

More information

Exam P Review Sheet. for a > 0. ln(a) i=0 ari = a. (1 r) 2. (Note that the A i s form a partition)

Exam P Review Sheet. for a > 0. ln(a) i=0 ari = a. (1 r) 2. (Note that the A i s form a partition) Exam P Review Sheet log b (b x ) = x log b (y k ) = k log b (y) log b (y) = ln(y) ln(b) log b (yz) = log b (y) + log b (z) log b (y/z) = log b (y) log b (z) ln(e x ) = x e ln(y) = y for y > 0. d dx ax

More information

n! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2

n! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2 Order statistics Ex. 4. (*. Let independent variables X,..., X n have U(0, distribution. Show that for every x (0,, we have P ( X ( < x and P ( X (n > x as n. Ex. 4.2 (**. By using induction or otherwise,

More information

Convergence Tests. Academic Resource Center

Convergence Tests. Academic Resource Center Convergence Tests Academic Resource Center Series Given a sequence {a 0, a, a 2,, a n } The sum of the series, S n = A series is convergent if, as n gets larger and larger, S n goes to some finite number.

More information

Random Variables and Their Distributions

Random Variables and Their Distributions Chapter 3 Random Variables and Their Distributions A random variable (r.v.) is a function that assigns one and only one numerical value to each simple event in an experiment. We will denote r.vs by capital

More information

Chapter 2. Discrete Distributions

Chapter 2. Discrete Distributions Chapter. Discrete Distributions Objectives ˆ Basic Concepts & Epectations ˆ Binomial, Poisson, Geometric, Negative Binomial, and Hypergeometric Distributions ˆ Introduction to the Maimum Likelihood Estimation

More information