Generating Functions. STAT253/317 Winter 2013 Lecture 8. More Properties of Generating Functions Random Walk w/ Reflective Boundary at 0
|
|
- Jocelin Matthews
- 5 years ago
- Views:
Transcription
1 Generating Function STAT253/37 Winter 203 Lecture 8 Yibi Huang January 25, 203 Generating Function For a non-negative-integer-valued random variable T, the generating function of T i the expected value of T G() E[ T ] in which T i defined a 0 if T. P(T ), G() i a power erie converging abolutely for all < <. if T i finite w/ prob. G() P(T < ) < otherwie P(T ) G () (0)! Knowing G() Knowing P(T ) for all 0,, 2,... STAT253/ Winter Lecture 8 - STAT253/ Winter Lecture 8-2 More Propertie of Generating Function G() E[ T ] P(T ) E[T ] lim G () if it exit becaue G () d d E[T ] E[T T ] P(T ). E[T (T )] lim G () if it exit becaue G () E[T (T ) T 2 ] 2 2 ( )P(T ) If T and U are independent non-negative-integer-valued random variable, with generating function G T () and G U () repectively, then the generating function of T + U i G T +U () E[ T +U ] E[ T ]E[ U ] G T ()G U () STAT253/ Winter Lecture Random Wal w/ Reflective Boundary at 0 State Space 0,, 2,...} P 0, P i,i+ p, P i,i p q, for i, 2, 3... Only one cla, irreducible For i < j, define N ij minm > 0 : X m j X 0 i} time to reach tate j tarting in tate i Oberve that N 0n N 0 + N N n,n By the Marov property, N 0, N 2,..., N n,n are indep. Given X 0 i N i,i+ if X i + + N i,i + N i,i+ if X i where N i,i N i,i, N i,i+ N i,i+, and N i,i, N i,i+ are indep. STAT253/ Winter Lecture 8-4 ()
2 Generating Function of N i,i+ Let G i () be the generating function of N i,i+. From (??), and by the independence of Ni,i and Ni,i+, we get that G i () p + qe[ +N i,i +N i,i+] p + qg i ()G i () G i () p qg i () Since N 0 i alway, we have G 0 (). Uing the iterating relation (??), we can find p G () qg 0 () p q 2 p (q 2 ) P(N 2 n) (2) pq 2+ pq if n 2 + for 0,, if n i even STAT253/ Winter Lecture 8-5 Similarly, G 2 () p qg () p( q2 ) q( + p) 2 p q( + p) 2 + pq 3 q( + p) 2 p (q( + p) 2 ) + pq 3 (q( + p) 2 ) pq ( + p) 2+ + p + pq + ( + p) 2+3 pq [( + p) + ( + p) ] 2+ p if n P(N 23 n) pq [(+p) + (+p) ] if n 2 + for, 2,... 0 if n i even STAT253/ Winter Lecture 8-6 Mean of N i,i+ Recall that G i () E(N i,i+). Let m i E(N i,i+ ) G i (). i () p( qg i ()) + p(qg i () + qg i ()) ( qg i ()) 2 G p + pq2 G i () ( qg i ()) 2 Since N i,i+ <, G i () for all i 0,,..., n. We have m i G i () p + pqg i () ( q) 2 + qg p i () p + q p ( p + q p m i 2) [ + qp p + (qp ) ( qp ] )i + ( q p )i m 0 Since N 0, which implie m 0. (q/p) i m i p q + ( q p )i if p 0.5 2i + if p 0.5 p + q p m i STAT253/ Winter Lecture 8-7 Mean of N 0,n Recall that N 0n N 0 + N N n,n When E[N 0n ] m 0 + m m n n p q p > 0.5 E[N 0n ] n p q 2pq [ ( q (p q) 2 p )n ] if p 0.5 n 2 if p 0.5 2pq (p q) 2 linear in n p 0.5 E[N 0n ] n 2 quadratic in n p < 0.5 E[N 0n ] O( 2pq (p q) 2 ( q p )n ) exponential in n STAT253/ Winter Lecture 8-8
3 Example: Symmetric Random Wal on (, ) State pace..., 2,, 0,, 2,...} P i,i+ P i,i /2, for all integer i clae, recurrent, null-recurrent or poitive-recurrent? For i, j, define N ij minm > 0 : X m j X 0 i}. Note N 00 + N 0 Given X 0 N 0 if X 0 + N 2 + N 0 if X 2 Note N 2 and N 0 are independent and have the ame ditribution a N 0 (Why?) STAT253/ Winter Lecture 8-9 (3) Generating Function of N 0 Let G() be the generating function of N 0. From (??), we now that G() E[+N 2+N 0 ] G()2 which i a quadratic equation in G(). The two root are G() ± 2 Since G() mut lie between 0 and when 0 < <. Note that G () G() , which implie E[N 00 ] + E[N 0 ]. Symmetric random wal i null recurrent. E[N 0] lim G () STAT253/ Winter Lecture 8-0 The power erie expanion of G() 2 can be found via Newton binomial formula ( ) α ( 2 ) α ( 2 ) where ( ( α 0) and for, α ( ) /2 ) i0 (α i)/!. 2 ( 2 )( 2 2)( 2 3)... ( 2 + )! ( ) (2 3) 2! ( ) (2 3)(2 ) 2!(2 ) ( ) (2 )! 2 ( )! 2!(2 ) ( ) 2 2 (2 ) ( ) 2 From all the above we have G() ( /2 ) ( 2 ) 2 2 (2 ) ( ) /2 ( ) ( ) 2 2 the ditribution of N 0 i ( ) 2 P(N 0 2 ) 2 2 (2 ) for 0,, 2,... P(N 0 2) 0 2 STAT253/ Winter Lecture 8 - STAT253/ Winter Lecture 8-2
4 4.7 Branching Procee Recall a Branching Proce i a population of individual in which all individual have the ame lifepan, and each individual will produce a random number of offpring at the end of it life Let X n ize of the nth generation, n 0,, 2,.... Let Z n,i # of offpring produced by the ith individual in the nth generation. Then X n+ X n i Z n,i (4) Suppoe Z n,i are i.i.d with probability ma function P(Z n,i j) P j, j 0. We uppoe the non-trivial cae that P j < for all j 0. X n } i a Marov chain with tate pace 0,, 2,...}. Mean of a Branching Proce Let µ E[Z n,i ] j0 jp j. Since X n X n i Z n,i, we have [ Xn ] E[X n X n ] E Z n,i X n E[Z n,i ] X n µ i If X 0, then E[X n ] E[E[X n X n ]] E[X n µ] µe[x n ] E[X n ] µe[x n ] µ 2 E[X n 2 ]... µ n E[X 0 ] µ n If µ < E[X n ] 0 a n lim n P(X n ) 0 the branching procee will eventually die out. What if µ or µ >? STAT253/ Winter Lecture 8-3 STAT253/ Winter Lecture 8-4 Variance of a Branching Proce Let σ 2 Var(Z n,i ). Again from the fact that X n X n i Z n,i, we have and hence E[X n X n ] X n µ, Var(X n X n ) X n σ 2 Var(E[X n X n ]) Var(X n µ) µ 2 Var(X n ) E[Var(X n X n )] σ 2 E[X n ] σ 2 µ n. Var(X n ) E[Var(X n X n )] + Var(E[X n X n ]) σ 2 µ n + µ 2 Var(X n ). σ 2 (µ n + µ n µ 2n 2 ) + µ 2n Var(X 0 ) ( ) σ µ 2n 2 µ n µ n µ if µ Var(X 0 ) + nσ 2 if µ STAT253/ Winter Lecture 8-5 Generating Function of the Branching Procee Let g() E[ Z n,i ] P be the generating function of Z n,i, and G n () be the generating function of X n, n 0,, 2,.... Then G n ()} atifie the following two iterative equation (i) G n+ () G n (g()) for n 0,, 2,... (ii) G n+ () g(g n ()) if X 0, for n 0,, 2,... Proof of (i). [ E[ X n+ X n ] E ] [ Xn i Z Xn ] n,i E i Z n,i X n i E[Z n,i ] (by indep. of Z n,i ) X n i g() g()x n From which, we have G n+ () E[ X n+ ] E[E[ X n+ X n ]] E[g() X n ] G n (g()) ince G n () E[ X n ]. Proof of (ii): HW today STAT253/ Winter Lecture 8-6
5 Example Suppoe X 0, and P 0 /4, P /2, P 2 /4. Find the ditribution of X 2. l. g() ( + ) 2 /4. Since X 0, G 0 () E[ X 0 ] E[ ]. From (i) we have G () G 0 (g()) g() ( + ) 2 /4 G 2 () G (g()) 4 ( + 4 ( + )2 ) 2 ( ) 2 ( ) P(X 2 ) The coefficient of in the polynomial of G 2 () i the chance that X P(X 2 ) and P(X 2 ) 0 for 5. STAT253/ Winter Lecture Extinction Probability Let π 0 lim n P(X n 0 X 0 ) P(the population will eventually die out X 0 ) Propoition The extinction probability π 0 i a root of of the equation g() (5) where g() P i the generating function of Z n,i. Proof. π 0 P(population die out) j0 P(population die out X j)p j j0 πj 0 P j g(π 0 ) STAT253/ Winter Lecture 8-8 Propoition I Let µ E[Z n,i ] j0 jp j. If µ, the extinction probability π 0 i unle P. Proof. Let h() g(). Since g(), g () µ, h() g() 0, ( h () jp j j ) ( ) jp j µ for 0 < j j Thu µ h () 0 for 0 < h() i non-increaing in [0, ) h() > h() 0 for 0 < g() > for 0 < There i no root in [0,). STAT253/ Winter Lecture 8-9 Propoition II If µ >, there i a unique root of the equation g() in the domain [0, ), and that i the extinction probability. Proof. Let h() g(). Oberve that h(0) g(0) P 0 > 0 h (0) g (0) P < 0 Then µ > h () µ > 0 h() i increaing near h( δ) < h() 0 for δ > 0 mall enough Since h() i continuou in [0, ), there mut be a root to h(). The root i unique ince h () g () h() i convex in [0,). j2 j(j )P j j 2 0 for 0 < STAT253/ Winter Lecture 8-20
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 information4 Branching Processes
4 Branching Processes Organise by generations: Discrete time. If P(no offspring) 0 there is a probability that the process will die out. Let X = number of offspring of an individual p(x) = P(X = x) = offspring
More information18.440: Lecture 26 Conditional expectation
18.440: Lecture 26 Conditional expectation Scott Sheffield MIT 1 Outline Conditional probability distributions Conditional expectation Interpretation and examples 2 Outline Conditional probability distributions
More information14 Branching processes
4 BRANCHING PROCESSES 6 4 Branching processes In this chapter we will consider a rom model for population growth in the absence of spatial or any other resource constraints. So, consider a population of
More informationSTAT 430/510 Probability Lecture 16, 17: Compute by Conditioning
STAT 430/510 Probability Lecture 16, 17: Compute by Conditioning Pengyuan (Penelope) Wang Lecture 16-17 June 21, 2011 Computing Probability by Conditioning A is an arbitrary event If Y is a discrete random
More informationCASE STUDY: EXTINCTION OF FAMILY NAMES
CASE STUDY: EXTINCTION OF FAMILY NAMES The idea that families die out originated in antiquity, particilarly since the establishment of patrilineality (a common kinship system in which an individual s family
More informationTHE SPLITTING SUBSPACE CONJECTURE
THE SPLITTING SUBSPAE ONJETURE ERI HEN AND DENNIS TSENG Abtract We anwer a uetion by Niederreiter concerning the enumeration of a cla of ubpace of finite dimenional vector pace over finite field by proving
More information= P{X 0. = i} (1) If the MC has stationary transition probabilities then, = i} = P{X n+1
Properties of Markov Chains and Evaluation of Steady State Transition Matrix P ss V. Krishnan - 3/9/2 Property 1 Let X be a Markov Chain (MC) where X {X n : n, 1, }. The state space is E {i, j, k, }. The
More informationMATH 564/STAT 555 Applied Stochastic Processes Homework 2, September 18, 2015 Due September 30, 2015
ID NAME SCORE MATH 56/STAT 555 Applied Stochastic Processes Homework 2, September 8, 205 Due September 30, 205 The generating function of a sequence a n n 0 is defined as As : a ns n for all s 0 for which
More informationLecture 21. The Lovasz splitting-off lemma Topics in Combinatorial Optimization April 29th, 2004
18.997 Topic in Combinatorial Optimization April 29th, 2004 Lecture 21 Lecturer: Michel X. Goeman Scribe: Mohammad Mahdian 1 The Lovaz plitting-off lemma Lovaz plitting-off lemma tate the following. Theorem
More informationStatistics 253/317 Introduction to Probability Models. Winter Midterm Exam Monday, Feb 10, 2014
Statistics 253/317 Introduction to Probability Models Winter 2014 - Midterm Exam Monday, Feb 10, 2014 Student Name (print): (a) Do not sit directly next to another student. (b) This is a closed-book, closed-note
More informationTHE 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 informationarxiv: v2 [math.nt] 30 Apr 2015
A THEOREM FOR DISTINCT ZEROS OF L-FUNCTIONS École Normale Supérieure arxiv:54.6556v [math.nt] 3 Apr 5 943 Cachan November 9, 7 Abtract In thi paper, we etablih a imple criterion for two L-function L and
More informationLecture Notes 5 Convergence and Limit Theorems. Convergence with Probability 1. Convergence in Mean Square. Convergence in Probability, WLLN
Lecture Notes 5 Convergence and Limit Theorems Motivation Convergence with Probability Convergence in Mean Square Convergence in Probability, WLLN Convergence in Distribution, CLT EE 278: Convergence and
More informationSOLUTIONS TO ALGEBRAIC GEOMETRY AND ARITHMETIC CURVES BY QING LIU. I will collect my solutions to some of the exercises in this book in this document.
SOLUTIONS TO ALGEBRAIC GEOMETRY AND ARITHMETIC CURVES BY QING LIU CİHAN BAHRAN I will collect my olution to ome of the exercie in thi book in thi document. Section 2.1 1. Let A = k[[t ]] be the ring of
More informationMathematical Methods for Computer Science
Mathematical Methods for Computer Science Computer Science Tripos, Part IB Michaelmas Term 2016/17 R.J. Gibbens Problem sheets for Probability methods William Gates Building 15 JJ Thomson Avenue Cambridge
More information3 Conditional Expectation
3 Conditional Expectation 3.1 The Discrete case Recall that for any two events E and F, the conditional probability of E given F is defined, whenever P (F ) > 0, by P (E F ) P (E)P (F ). P (F ) Example.
More informationIEOR 3106: Fall 2013, Professor Whitt Topics for Discussion: Tuesday, November 19 Alternating Renewal Processes and The Renewal Equation
IEOR 316: Fall 213, Profeor Whitt Topic for Dicuion: Tueday, November 19 Alternating Renewal Procee and The Renewal Equation 1 Alternating Renewal Procee An alternating renewal proce alternate between
More informationarxiv: v1 [math.co] 17 Dec 2007
arxiv:07.79v [math.co] 7 Dec 007 The copies of any permutation pattern are asymptotically normal Milós Bóna Department of Mathematics University of Florida Gainesville FL 36-805 bona@math.ufl.edu Abstract
More information18.440: Lecture 28 Lectures Review
18.440: Lecture 28 Lectures 17-27 Review Scott Sheffield MIT 1 Outline Continuous random variables Problems motivated by coin tossing Random variable properties 2 Outline Continuous random variables Problems
More informationProblem 1. Construct a filtered probability space on which a Brownian motion W and an adapted process X are defined and such that
Stochatic Calculu Example heet 4 - Lent 5 Michael Tehranchi Problem. Contruct a filtered probability pace on which a Brownian motion W and an adapted proce X are defined and uch that dx t = X t t dt +
More informationPROBABILITY THEORY LECTURE 3
PROBABILITY THEORY LECTURE 3 Per Sidén Division of Statistics Dept. of Computer and Information Science Linköping University PER SIDÉN (STATISTICS, LIU) PROBABILITY THEORY - L3 1 / 15 OVERVIEW LECTURE
More informationExample: physical systems. If the state space. Example: speech recognition. Context can be. Example: epidemics. Suppose each infected
4. Markov Chains A discrete time process {X n,n = 0,1,2,...} with discrete state space X n {0,1,2,...} is a Markov chain if it has the Markov property: P[X n+1 =j X n =i,x n 1 =i n 1,...,X 0 =i 0 ] = P[X
More informationBogoliubov Transformation in Classical Mechanics
Bogoliubov Tranformation in Claical Mechanic Canonical Tranformation Suppoe we have a et of complex canonical variable, {a j }, and would like to conider another et of variable, {b }, b b ({a j }). How
More informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 2
MATH 56A: STOCHASTIC PROCESSES CHAPTER 2 2. Countable Markov Chains I started Chapter 2 which talks about Markov chains with a countably infinite number of states. I did my favorite example which is on
More informationMAT 135B Midterm 1 Solutions
MAT 35B Midterm Solutions Last Name (PRINT): First Name (PRINT): Student ID #: Section: Instructions:. Do not open your test until you are told to begin. 2. Use a pen to print your name in the spaces above.
More informationPart 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 informationCS145: Probability & Computing
CS45: Probability & Computing Lecture 5: Concentration Inequalities, Law of Large Numbers, Central Limit Theorem Instructor: Eli Upfal Brown University Computer Science Figure credits: Bertsekas & Tsitsiklis,
More informationLecture 8: Period Finding: Simon s Problem over Z N
Quantum Computation (CMU 8-859BB, Fall 205) Lecture 8: Period Finding: Simon Problem over Z October 5, 205 Lecturer: John Wright Scribe: icola Rech Problem A mentioned previouly, period finding i a rephraing
More informationLecture 3. January 9, 2018
Lecture 3 January 9, 208 Some complex analyi Although you might have never taken a complex analyi coure, you perhap till know what a complex number i. It i a number of the form z = x + iy, where x and
More informationTwelfth Problem Assignment
EECS 401 Not Graded PROBLEM 1 Let X 1, X 2,... be a sequence of independent random variables that are uniformly distributed between 0 and 1. Consider a sequence defined by (a) Y n = max(x 1, X 2,..., X
More informationStat 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 informationMath 510 midterm 3 answers
Math 51 midterm 3 answers Problem 1 (1 pts) Suppose X and Y are independent exponential random variables both with parameter λ 1. Find the probability that Y < 7X. P (Y < 7X) 7x 7x f(x, y) dy dx e x e
More informationHomework for 1/13 Due 1/22
Name: ID: Homework for 1/13 Due 1/22 1. [ 5-23] An irregularly shaped object of unknown area A is located in the unit square 0 x 1, 0 y 1. Consider a random point distributed uniformly over the square;
More informationProblem Set 8 Solutions
Deign and Analyi of Algorithm April 29, 2015 Maachuett Intitute of Technology 6.046J/18.410J Prof. Erik Demaine, Srini Devada, and Nancy Lynch Problem Set 8 Solution Problem Set 8 Solution Thi problem
More informationc n b n 0. c k 0 x b n < 1 b k b n = 0. } of integers between 0 and b 1 such that x = b k. b k c k c k
1. Exitence Let x (0, 1). Define c k inductively. Suppoe c 1,..., c k 1 are already defined. We let c k be the leat integer uch that x k An eay proof by induction give that and for all k. Therefore c n
More informationOnline Appendix for Managerial Attention and Worker Performance by Marina Halac and Andrea Prat
Online Appendix for Managerial Attention and Worker Performance by Marina Halac and Andrea Prat Thi Online Appendix contain the proof of our reult for the undicounted limit dicued in Section 2 of the paper,
More information6.207/14.15: Networks Lecture 3: Erdös-Renyi graphs and Branching processes
6.207/14.15: Networks Lecture 3: Erdös-Renyi graphs and Branching processes Daron Acemoglu and Asu Ozdaglar MIT September 16, 2009 1 Outline Erdös-Renyi random graph model Branching processes Phase transitions
More informationProbability 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 informationPrimitive Digraphs with the Largest Scrambling Index
Primitive Digraph with the Larget Scrambling Index Mahmud Akelbek, Steve Kirkl 1 Department of Mathematic Statitic, Univerity of Regina, Regina, Sakatchewan, Canada S4S 0A Abtract The crambling index of
More informationLecture 13. Poisson Distribution. Text: A Course in Probability by Weiss 5.5. STAT 225 Introduction to Probability Models February 16, 2014
Lecture 13 Text: A Course in Probability by Weiss 5.5 STAT 225 Introduction to Probability Models February 16, 2014 Whitney Huang Purdue University 13.1 Agenda 1 2 3 13.2 Review So far, we have seen discrete
More informationLecture 11: Introduction to Markov Chains. Copyright G. Caire (Sample Lectures) 321
Lecture 11: Introduction to Markov Chains Copyright G. Caire (Sample Lectures) 321 Discrete-time random processes A sequence of RVs indexed by a variable n 2 {0, 1, 2,...} forms a discretetime random process
More informationLecture 14. Text: A Course in Probability by Weiss 5.6. STAT 225 Introduction to Probability Models February 23, Whitney Huang Purdue University
Lecture 14 Text: A Course in Probability by Weiss 5.6 STAT 225 Introduction to Probability Models February 23, 2014 Whitney Huang Purdue University 14.1 Agenda 14.2 Review So far, we have covered Bernoulli
More information1 Generating functions
1 Generating functions Even quite straightforward counting problems can lead to laborious and lengthy calculations. These are greatly simplified by using generating functions. 2 Definition 1.1. Given a
More informationUNIT 15 RELIABILITY EVALUATION OF k-out-of-n AND STANDBY SYSTEMS
UNIT 1 RELIABILITY EVALUATION OF k-out-of-n AND STANDBY SYSTEMS Structure 1.1 Introduction Objective 1.2 Redundancy 1.3 Reliability of k-out-of-n Sytem 1.4 Reliability of Standby Sytem 1. Summary 1.6 Solution/Anwer
More informationMAT137 Calculus! Lecture 45
official website http://uoft.me/mat137 MAT137 Calculus! Lecture 45 Today: Taylor Polynomials Taylor Series Next: Taylor Series Power Series Definition (Power Series) A power series is a series of the form
More informationVariance reduction techniques
Variance reduction techniques Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/ moltchan/modsim/ http://www.cs.tut.fi/kurssit/tlt-2706/ OUTLINE: Simulation with a given confidence;
More informationFermi Distribution Function. n(e) T = 0 T > 0 E F
LECTURE 3 Maxwell{Boltzmann, Fermi, and Boe Statitic Suppoe we have a ga of N identical point particle in a box ofvolume V. When we ay \ga", we mean that the particle are not interacting with one another.
More informationMatrix analytic methods. Lecture 1: Structured Markov chains and their stationary distribution
1/29 Matrix analytic methods Lecture 1: Structured Markov chains and their stationary distribution Sophie Hautphenne and David Stanford (with thanks to Guy Latouche, U. Brussels and Peter Taylor, U. Melbourne
More informationStat 135, Fall 2006 A. Adhikari HOMEWORK 6 SOLUTIONS
Stat 135, Fall 2006 A. Adhikari HOMEWORK 6 SOLUTIONS 1a. Under the null hypothesis X has the binomial (100,.5) distribution with E(X) = 50 and SE(X) = 5. So P ( X 50 > 10) is (approximately) two tails
More informationHitting Probabilities
Stat25B: Probability Theory (Spring 23) Lecture: 2 Hitting Probabilities Lecturer: James W. Pitman Scribe: Brian Milch 2. Hitting probabilities Consider a Markov chain with a countable state space S and
More informationOn the Unit Groups of a Class of Total Quotient Rings of Characteristic p k with k 3
International Journal of Algebra, Vol, 207, no 3, 27-35 HIKARI Ltd, wwwm-hikaricom http://doiorg/02988/ija2076750 On the Unit Group of a Cla of Total Quotient Ring of Characteritic p k with k 3 Wanambii
More informationSTAT STOCHASTIC PROCESSES. Contents
STAT 3911 - STOCHASTIC PROCESSES ANDREW TULLOCH Contents 1. Stochastic Processes 2 2. Classification of states 2 3. Limit theorems for Markov chains 4 4. First step analysis 5 5. Branching processes 5
More information8. Statistical Equilibrium and Classification of States: Discrete Time Markov Chains
8. Statistical Equilibrium and Classification of States: Discrete Time Markov Chains 8.1 Review 8.2 Statistical Equilibrium 8.3 Two-State Markov Chain 8.4 Existence of P ( ) 8.5 Classification of States
More informationFormulas for probability theory and linear models SF2941
Formulas for probability theory and linear models SF2941 These pages + Appendix 2 of Gut) are permitted as assistance at the exam. 11 maj 2008 Selected formulae of probability Bivariate probability Transforms
More informationRELIABILITY OF REPAIRABLE k out of n: F SYSTEM HAVING DISCRETE REPAIR AND FAILURE TIMES DISTRIBUTIONS
www.arpapre.com/volume/vol29iue1/ijrras_29_1_01.pdf RELIABILITY OF REPAIRABLE k out of n: F SYSTEM HAVING DISCRETE REPAIR AND FAILURE TIMES DISTRIBUTIONS Sevcan Demir Atalay 1,* & Özge Elmataş Gültekin
More informationFactor Analysis with Poisson Output
Factor Analyi with Poion Output Gopal Santhanam Byron Yu Krihna V. Shenoy, Department of Electrical Engineering, Neurocience Program Stanford Univerity Stanford, CA 94305, USA {gopal,byronyu,henoy}@tanford.edu
More informationStat 100a, Introduction to Probability.
Stat 100a, Introduction to Probability. Outline for the day: 1. Geometric random variables. 2. Negative binomial random variables. 3. Moment generating functions. 4. Poisson random variables. 5. Continuous
More informationLecture 16: Hierarchical models and miscellanea
Lecture 16: Hierarchical models and miscellanea It is often easier to model a practical situation by thinking of things in a hierarchy. Example 4.4.1 (binomial-poisson hierarchy) An insect lays many eggs,
More informationLecture 7: Chapter 7. Sums of Random Variables and Long-Term Averages
Lecture 7: Chapter 7. Sums of Random Variables and Long-Term Averages ELEC206 Probability and Random Processes, Fall 2014 Gil-Jin Jang gjang@knu.ac.kr School of EE, KNU page 1 / 15 Chapter 7. Sums of Random
More informationP i [B k ] = lim. n=1 p(n) ii <. n=1. V i :=
2.7. Recurrence and transience Consider a Markov chain {X n : n N 0 } on state space E with transition matrix P. Definition 2.7.1. A state i E is called recurrent if P i [X n = i for infinitely many n]
More informationSECTION x2 x > 0, t > 0, (8.19a)
SECTION 8.5 433 8.5 Application of aplace Tranform to Partial Differential Equation In Section 8.2 and 8.3 we illutrated the effective ue of aplace tranform in olving ordinary differential equation. The
More informationLaplace Transformation
Univerity of Technology Electromechanical Department Energy Branch Advance Mathematic Laplace Tranformation nd Cla Lecture 6 Page of 7 Laplace Tranformation Definition Suppoe that f(t) i a piecewie continuou
More informationRiemann s Functional Equation is Not a Valid Function and Its Implication on the Riemann Hypothesis. Armando M. Evangelista Jr.
Riemann Functional Equation i Not a Valid Function and It Implication on the Riemann Hypothei By Armando M. Evangelita Jr. armando78973@gmail.com On Augut 28, 28 ABSTRACT Riemann functional equation wa
More informationHW 2 Solutions. The variance of the random walk is explosive (lim n Var (X n ) = ).
Stochastic Processews Prof Olivier Scaillet TA Adrien Treccani HW 2 Solutions Exercise. The process {X n, n } is a random walk starting at a (cf. definition in the course. [ n ] E [X n ] = a + E Z i =
More informationProving the central limit theorem
SOR3012: Stochastic Processes Proving the central limit theorem Gareth Tribello March 3, 2019 1 Purpose In the lectures and exercises we have learnt about the law of large numbers and the central limit
More informationMath 456: Mathematical Modeling. Tuesday, March 6th, 2018
Math 456: Mathematical Modeling Tuesday, March 6th, 2018 Markov Chains: Exit distributions and the Strong Markov Property Tuesday, March 6th, 2018 Last time 1. Weighted graphs. 2. Existence of stationary
More informationChapter Landscape of an Optimization Problem. Local Search. Coping With NP-Hardness. Gradient Descent: Vertex Cover
Coping With NP-Hardne Chapter 12 Local Search Q Suppoe I need to olve an NP-hard problem What hould I do? A Theory ay you're unlikely to find poly-time algorithm Mut acrifice one of three deired feature
More information(3) A bilinear map B : S(R n ) S(R m ) B is continuous (for the product topology) if and only if there exist C, N and M such that
The material here can be found in Hörmander Volume 1, Chapter VII but he ha already done almot all of ditribution theory by thi point(!) Johi and Friedlander Chapter 8. Recall that S( ) i a complete metric
More informationLecture 7: Testing Distributions
CSE 5: Sublinear (and Streaming) Algorithm Spring 014 Lecture 7: Teting Ditribution April 1, 014 Lecturer: Paul Beame Scribe: Paul Beame 1 Teting Uniformity of Ditribution We return today to property teting
More informationNonparametric hypothesis tests and permutation tests
Nonparametric hypothesis tests and permutation tests 1.7 & 2.3. Probability Generating Functions 3.8.3. Wilcoxon Signed Rank Test 3.8.2. Mann-Whitney Test Prof. Tesler Math 283 Fall 2018 Prof. Tesler Wilcoxon
More informationRecap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks
Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution
More informationLecture 10. Variance and standard deviation
18.440: Lecture 10 Variance and standard deviation Scott Sheffield MIT 1 Outline Defining variance Examples Properties Decomposition trick 2 Outline Defining variance Examples Properties Decomposition
More informationLINEAR ALGEBRA METHOD IN COMBINATORICS. Theorem 1.1 (Oddtown theorem). In a town of n citizens, no more than n clubs can be formed under the rules
LINEAR ALGEBRA METHOD IN COMBINATORICS 1 Warming-up example Theorem 11 (Oddtown theorem) In a town of n citizen, no more tha club can be formed under the rule each club have an odd number of member each
More informationSTAT 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 informationSome Applications of Spanning Trees in K s,t
Some Application of Spanning Tree in K,t L.H. Clark, A.T. Mohr, and T.D. Porter Department of Mathematic Southern Illinoi Univerity Carbondale, IL 62901-4408 tporter@math.iu.edu Abtract We partition the
More informationCSE 312 Final Review: Section AA
CSE 312 TAs December 8, 2011 General Information General Information Comprehensive Midterm General Information Comprehensive Midterm Heavily weighted toward material after the midterm Pre-Midterm Material
More informationLecture Notes 3 Convergence (Chapter 5)
Lecture Notes 3 Convergence (Chapter 5) 1 Convergence of Random Variables Let X 1, X 2,... be a sequence of random variables and let X be another random variable. Let F n denote the cdf of X n and let
More informationExam Stochastic Processes 2WB08 - March 10, 2009,
Exam Stochastic Processes WB8 - March, 9, 4.-7. The number of points that can be obtained per exercise is mentioned between square brackets. The maximum number of points is 4. Good luck!!. (a) [ pts.]
More informationList Coloring Graphs
Lit Coloring Graph February 6, 004 LIST COLORINGS AND CHOICE NUMBER Thomaen Long Grotzch girth 5 verion Thomaen Long Let G be a connected planar graph of girth at leat 5. Let A be a et of vertice in G
More informationLecture 28: Asymptotic confidence sets
Lecture 28: Asymptotic confidence sets 1 α asymptotic confidence sets Similar to testing hypotheses, in many situations it is difficult to find a confidence set with a given confidence coefficient or level
More informationZ a>2 s 1n = X L - m. X L = m + Z a>2 s 1n X L = The decision rule for this one-tail test is
M09_BERE8380_12_OM_C09.QD 2/21/11 3:44 PM Page 1 9.6 The Power of a Tet 9.6 The Power of a Tet 1 Section 9.1 defined Type I and Type II error and their aociated rik. Recall that a repreent the probability
More informationLecture 8. October 22, Department of Biostatistics Johns Hopkins Bloomberg School of Public Health Johns Hopkins University.
Lecture 8 Department of Biostatistics Johns Hopkins Bloomberg School of Public Health Johns Hopkins University October 22, 2007 1 2 3 4 5 6 1 Define convergent series 2 Define the Law of Large Numbers
More informationP (A G) dp G P (A G)
First homework assignment. Due at 12:15 on 22 September 2016. Homework 1. We roll two dices. X is the result of one of them and Z the sum of the results. Find E [X Z. Homework 2. Let X be a r.v.. Assume
More informationStatistics 253/317 Introduction to Probability Models. Winter Midterm Exam Friday, Feb 8, 2013
Statistics 253/317 Introduction to Probability Models Winter 2014 - Midterm Exam Friday, Feb 8, 2013 Student Name (print): (a) Do not sit directly next to another student. (b) This is a closed-book, closed-note
More informationNotes 18 : Optional Sampling Theorem
Notes 18 : Optional Sampling Theorem Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Wil91, Chapter 14], [Dur10, Section 5.7]. Recall: DEF 18.1 (Uniform Integrability) A collection
More informationHyperbolic Partial Differential Equations
Hyperbolic Partial Differential Equation Evolution equation aociated with irreverible phyical procee like diffuion heat conduction lead to parabolic partial differential equation. When the equation i a
More information3. DISCRETE RANDOM VARIABLES
IA Probability Lent Term 3 DISCRETE RANDOM VARIABLES 31 Introduction When an experiment is conducted there may be a number of quantities associated with the outcome ω Ω that may be of interest Suppose
More informationSOR201 Solutions to Examples 3
page 0SOR0(00) SOR0 lutions to Examples (a) An outcome is an unordered sample {i,, i n }, a subset of {,, N}, where the i j s are all different The random variable X can take the values n, n +,, N If X
More informationOn the Function ω(n)
International Mathematical Forum, Vol. 3, 08, no. 3, 07 - HIKARI Ltd, www.m-hikari.com http://doi.org/0.988/imf.08.708 On the Function ω(n Rafael Jakimczuk Diviión Matemática, Univeridad Nacional de Luján
More information18.175: Lecture 8 Weak laws and moment-generating/characteristic functions
18.175: Lecture 8 Weak laws and moment-generating/characteristic functions Scott Sheffield MIT 18.175 Lecture 8 1 Outline Moment generating functions Weak law of large numbers: Markov/Chebyshev approach
More informationFinal Examination Statistics 200C. T. Ferguson June 11, 2009
Final Examination Statistics 00C T. Ferguson June, 009. (a) Define: X n converges in probability to X. (b) Define: X m converges in quadratic mean to X. (c) Show that if X n converges in quadratic mean
More informationNote that in the example in Lecture 1, the state Home is recurrent (and even absorbing), but all other states are transient. f ii (n) f ii = n=1 < +
Random Walks: WEEK 2 Recurrence and transience Consider the event {X n = i for some n > 0} by which we mean {X = i}or{x 2 = i,x i}or{x 3 = i,x 2 i,x i},. Definition.. A state i S is recurrent if P(X n
More informationMATH2715: Statistical Methods
MATH2715: Statistical Methods Exercises V (based on lectures 9-10, work week 6, hand in lecture Mon 7 Nov) ALL questions count towards the continuous assessment for this module. Q1. If X gamma(α,λ), write
More information8 Laws of large numbers
8 Laws of large numbers 8.1 Introduction We first start with the idea of standardizing a random variable. Let X be a random variable with mean µ and variance σ 2. Then Z = (X µ)/σ will be a random variable
More informationMath 6810 (Probability) Fall Lecture notes
Math 6810 (Probability) Fall 2012 Lecture notes Pieter Allaart University of North Texas September 23, 2012 2 Text: Introduction to Stochastic Calculus with Applications, by Fima C. Klebaner (3rd edition),
More informationEC381/MN308 Probability and Some Statistics. Lecture 7 - Outline. Chapter Cumulative Distribution Function (CDF) Continuous Random Variables
EC38/MN38 Probability and Some Statitic Yanni Pachalidi yannip@bu.edu, http://ionia.bu.edu/ Lecture 7 - Outline. Continuou Random Variable Dept. of Manufacturing Engineering Dept. of Electrical and Computer
More informationTechnical Appendix: Auxiliary Results and Proofs
A Technical Appendix: Auxiliary Reult and Proof Lemma A. The following propertie hold for q (j) = F r [c + ( ( )) ] de- ned in Lemma. (i) q (j) >, 8 (; ]; (ii) R q (j)d = ( ) q (j) + R q (j)d ; (iii) R
More informationIntroduction to Probability
LECTURE NOTES Course 6.041-6.431 M.I.T. FALL 2000 Introduction to Probability Dimitri P. Bertsekas and John N. Tsitsiklis Professors of Electrical Engineering and Computer Science Massachusetts Institute
More informationMAS113 Introduction to Probability and Statistics. Proofs of theorems
MAS113 Introduction to Probability and Statistics Proofs of theorems Theorem 1 De Morgan s Laws) See MAS110 Theorem 2 M1 By definition, B and A \ B are disjoint, and their union is A So, because m is a
More information