Probability Generating Functions
|
|
- Merilyn Sims
- 5 years ago
- Views:
Transcription
1 Probability Generating Functions Andreas Klappenecker Texas A&M University 2018 by Andreas Klappenecker. All rights reserved. 1 / 27
2 Probability Generating Functions Definition Let X be a discrete random variable defined on a probability space with probability measure Pr. Assume that X has non-negative integer values. The probability generating function of X is defined by G X pzq Erz X s PrrX ksz k. k 0 This series converges for all z with z ď 1. 2 / 27
3 Expected Value Expectation The expectation value can be expressed by ErX s k PrrX ks GX 1 p1q, (1) where G 1 X pzq denotes the derivative of G X pzq. Indeed, G 1 X pzq k PrrX ksz k 1 k 0 k PrrX ksz k 1. 3 / 27
4 Second Moment Second Moment ErX 2 s G 2 X p1q ` G 1 X p1q Indeed, GX 1 pzq k PrrX ksz k 1 and GX 2 pzq kpk 1q PrrX ksz k 2 pk 2 kq PrrX ksz k 1. k 2 k 2 4 / 27
5 Variance Variance VarrX s ErX 2 s ErX s 2 G 2 X p1q ` G 1 X p1q G 1 X p1q 2. 5 / 27
6 Bernoulli Variables Example Let X be a random variable that has Bernoulli distribution with parameter p. The probability generating function is given by G X pzq p1 pq ` pz. Hence G 1 X pzq p, and G 2 pzq 0. We obtain ErX s G 1 X p1q p and VarrX s G 2 X p1q ` G 1 X p1q G 1 X p1q 2 0 ` p p 2 pp1 pq. 6 / 27
7 Geometric Random Variables Example The probability generating function of a geometrically distributed random variable X is Gpzq pp1 pq k 1 z k pz Some calculus shows that G 1 pzq p1 pq k z k k 0 p p1 p1 pqzq 2, G 2 pzq pz 1 p1 pqz. 2pp1 pq p1 p1 pqzq 3. Therefore, the expectation value is ErX s GX 1 p1q 1{p. The variance is given by VarrX s G 2 p1q ` G 1 p1q G 1 p1q 2 2p1 pq p 2 ` 1 p 1 p 2 1 p p 2. 7 / 27
8 Sums of Independent Random Variables Proposition Let X 1,..., X n be independent Z ě-valued random variables with probability generating functions G X1 pzq,..., G Xn pzq. The probability generating function of X X 1 ` ` X n is given by the product G X pzq nź G Xk pzq. 8 / 27
9 Proof. It suffices to show this for two random variables X and Y. The general case can be established by a straightforward induction proof. k k G X pzqg Y pzq PrrX ksz PrrY ksz k 0 k 0 PrrX ls PrrY k ls kÿ z k k 0 l 0 PrrX l, Y k ls kÿ z k k 0 l 0 kÿ PrrX ` Y ksz k G X `Y pzq k 0 l 0 9 / 27
10 Binomial Distribution Example Recall that the Bernoulli distribution with parameter p has generating function p1 pq ` pz. If X 1,..., X n are independent random variables that are Bernoulli distributed with parameter p, then X X 1 ` ` X n is, by definition, binomially distributed with parameters n and p. The generating function of X is G X pzq pp1 pq ` pzq n nÿ k 0 ˆn k p1 pq n k p k z k. 10 / 27
11 Binomial Distribution Example (Continued.) We have G 1 X pzq nppp1 pq ` pzq n 1 The expected value is given by ErX s G 1 X p1q np. 11 / 27
12 Binomial Distribution Example (Continued.) We have G 1 X pzq nppp1 pq ` pzq n 1 and G 2 X pzq npn 1qp 2 pp1 pq ` pzq n 2. The expected value is given by VarrX s GX 2 p1q ` GX 1 p1q GX 1 p1q 2 pn 2 nqp 2 ` np n 2 p 2 np 2 ` np npp1 pq 12 / 27
13 Uniqueness Theorem Proposition Let X and Y be discrete random variables with probability generating functions G X pzq and G Y pzq, respectively. Then the probability generating function G X pzq G Y pzq if and only if the probability distributions for all integers k ě 0. PrrX ks PrrY ks 13 / 27
14 Proof. If the probability distributions are the same, then evidently G X pzq G Y pzq. Conversely, suppose that the generating functions G X pzq and G Y pzq are the same. Since the radius of convergence is at least 1, we can expand the two generating funcions into power series G X pzq G Y pzq PrrX ksz k k 0 PrrY ksz k k 0 These two power series must have identical coefficients, since the generating functions are the same. Therefore, PrrX ks PrrY ks for all k ě 0, as claimed. 14 / 27
15 Number of Inversions 15 / 27
16 Inversion of a Permutation Definition Let pa 1, a 2,..., a n q be a permutation of the set t1, 2,..., nu. The pair pa i, a j q is called an inversion if and only if i ă j and a i ą a j. Example The permutation p3, 4, 1, 2q has the inversions tp3, 1q, p3, 2q, p4, 1q, p4, 2qu. 16 / 27
17 Number of Inversions Definition Let I n pkq denote the number of permutations on n points with k inversions. Example We have I n p0q 1, since only the identity has no inversions. Example We have I n p1q n 1. Indeed, a permutation π can have a single inversion if and only if π is equal to a transposition of neighboring elements pk ` 1, kq for some k in the range 1 ď k ď n / 27
18 Number of Inversions Example Since no permutation can have more than `n 2 inversions, we have ˆn I n pkq 0 for all k ą. 2 Example By reversal of the permutations, we have the symmetry ˆˆn I n k I n pkq 2 18 / 27
19 Probability Generating Function Suppose that we choose permutations π uniformly at random from the symmetric group S n. Let X n denote the random variable on S n that assigns a permutation π its number of inversions. Then the probability generating function is given by G Xn pzq p n 2q ÿ k 0 G Xn pzq PrrX n ksz k p n 2q ÿ k I n pkq z k. n! 19 / 27
20 Probability Generating Function Question Can we relate the generating functions G Xn pzq and G Xn 1 pzq? 20 / 27
21 Probability Generating Function Question Can we relate the generating functions G Xn pzq and G Xn 1 pzq? Observation Suppose that we have a permutation π n 1 on t1, 2,..., n 1u. If we insert the element n at position j with 1 ď j ď n, then we get an additional n j inversions. Example / 27
22 Probability Generating Function Example additional inversions: additional inversions: additional inversions: 7 Observation We need to insert n uniformly at random to obtain a uniformly distributed permutation on n elements from uniformly distributed permutations on n 1 elements. 21 / 27
23 Probability Generating Function Proposition $ & p1 ` z ` z 2 ` ` z n 1 q G G Xn pzq n Xn 1 pzq if n ą 1, % 1 if n / 27
24 Probability Generating Function Corollary G Xn pzq 1 n! nź nź p1 ` z ` z 2 ` ` z n 1 q 1 z k kp1 zq 1 n! nź 1 z k 1 z 23 / 27
25 Factorization: Expected Value In other words, the generating function G Xn pzq is the product of generating functions of discrete uniform random variables U k on t0, 1,..., k 1u, G Xn pzq nź G Uk pzq, where G Uk pzq 1 ` z ` ` z k 1. k By the product rule for n functions, we have nź nÿ GU 1 n pzq G Uk pzq l 1 1 p1 ` 2z ` 3z 2 ` ` ` pl 1qz l 2 q n. G Ul pzq Then ErX n s G 1 U n p1q nÿ k 1 2 npn 1q / 27
26 Expected Value (Alternative Way) Example (Creating a Permutation by Inserting One Element at a Time) Observation X n U 1 ` U 2 ` ` U n ErX n s ErU 1 s ` ErU 2 s ` ` ErU n s 25 / 27
27 Expected Value Proposition ErX n s nÿ ErU k s nÿ k 1 2 npn 1q / 27
28 Variance Proposition VarrX n s 2n3 ` 3n 2 5n. 72 Proof. Since X n U 1 ` U 2 ` ` U n and the U k are mutually independent, we get nÿ nÿ k 2 nÿ 1 VarrX n s VarrU n s 1 k 2 n ˆ2n3 ` 3n 2 ` n n n3 ` 3n 2 5n / 27
Markov Chains. Andreas Klappenecker by Andreas Klappenecker. All rights reserved. Texas A&M University
Markov Chains Andreas Klappenecker Texas A&M University 208 by Andreas Klappenecker. All rights reserved. / 58 Stochastic Processes A stochastic process X tx ptq: t P T u is a collection of random variables.
More informationRandom Variables. Andreas Klappenecker. Texas A&M University
Random Variables Andreas Klappenecker Texas A&M University 1 / 29 What is a Random Variable? Random variables are functions that associate a numerical value to each outcome of an experiment. For instance,
More informationArea of left square = Area of right square c 2 + (4 Area of (a, b)-triangle) = a 2 + b 2 + (4 Area of (a, b)-triangle) c 2 = a 2 + b 2.
Worksheet Proof (of Pythagoras Theorem). The proof can be shown using the two squares in Figure 19.3. To draw the first square begin by drawing a general triangle with sides a and b and then extend these
More informationAsymptotic Analysis 1: Limits and Asymptotic Equality
Asymptotic Analysis 1: Limits and Asymptotic Equality Andreas Klappenecker and Hyunyoung Lee Texas A&M University 1 / 15 Motivation In asymptotic analysis, our goal is to compare a function f pnq with
More informationGenerating and characteristic functions. Generating and Characteristic Functions. Probability generating function. Probability generating function
Generating and characteristic functions Generating and Characteristic Functions September 3, 03 Probability generating function Moment generating function Power series expansion Characteristic function
More informationDiscrete Distributions Chapter 6
Discrete Distributions Chapter 6 Negative Binomial Distribution section 6.3 Consider k r, r +,... independent Bernoulli trials with probability of success in one trial being p. Let the random variable
More informationHEAGAN & CO., OPP. f>, L. & W. DEPOT, DOYER, N. J, OUR MOTTO! ould Iwv ia immediate vltlui. VEEY BEST NEW Creamery Butter 22c ib,
#4 NN N G N N % XX NY N Y FY N 2 88 N 28 k N k F P X Y N Y /» 2«X ««!!! 8 P 3 N 0»9! N k 25 F $ 60 $3 00 $3000 k k N 30 Y F00 6 )P 0» «{ N % X zz» «3 0««5 «N «XN» N N 00/ N 4 GN N Y 07 50 220 35 2 25 0
More informationLecture 19 - Covariance, Conditioning
THEORY OF PROBABILITY VLADIMIR KOBZAR Review. Lecture 9 - Covariance, Conditioning Proposition. (Ross, 6.3.2) If X,..., X n are independent normal RVs with respective parameters µ i, σi 2 for i,..., n,
More informationStat 134 Fall 2011: Notes on generating functions
Stat 3 Fall 0: Notes on generating functions Michael Lugo October, 0 Definitions Given a random variable X which always takes on a positive integer value, we define the probability generating function
More informationMTH 224: Probability and Statistics Fall 2017
MTH 224: Probability and Statistics Fall 2017 Course Notes 3 Drew Armstrong Nov 9 We have finished the first two thirds of the course, which in retrospect I would label as Part I: Introduction to Probability
More informationRandom Variable. Pr(X = a) = Pr(s)
Random Variable Definition A random variable X on a sample space Ω is a real-valued function on Ω; that is, X : Ω R. A discrete random variable is a random variable that takes on only a finite or countably
More informationThe Riemann Roch theorem for metric graphs
The Riemann Roch theorem for metric graphs R. van Dobben de Bruyn 1 Preface These are the notes of a talk I gave at the graduate student algebraic geometry seminar at Columbia University. I present a short
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationNotes 6 : First and second moment methods
Notes 6 : First and second moment methods Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Roc, Sections 2.1-2.3]. Recall: THM 6.1 (Markov s inequality) Let X be a non-negative
More informationCSC 344 Algorithms and Complexity. Proof by Mathematical Induction
CSC 344 Algorithms and Complexity Lecture #1 Review of Mathematical Induction Proof by Mathematical Induction Many results in mathematics are claimed true for every positive integer. Any of these results
More informationCopyright c 2006 Jason Underdown Some rights reserved. choose notation. n distinct items divided into r distinct groups.
Copyright & License Copyright c 2006 Jason Underdown Some rights reserved. choose notation binomial theorem n distinct items divided into r distinct groups Axioms Proposition axioms of probability probability
More informationDS-GA 1002: PREREQUISITES REVIEW SOLUTIONS VLADIMIR KOBZAR
DS-GA 2: PEEQUISIES EVIEW SOLUIONS VLADIMI KOBZA he following is a selection of questions (drawn from Mr. Bernstein s notes) for reviewing the prerequisites for DS-GA 2. Questions from Ch, 8, 9 and 2 of
More informationINDUCTION AND RECURSION. Lecture 7 - Ch. 4
INDUCTION AND RECURSION Lecture 7 - Ch. 4 4. Introduction Any mathematical statements assert that a property is true for all positive integers Examples: for every positive integer n: n!
More informationMTH 224: Probability and Statistics Fall 2017
MTH 224: Probability and Statistics Fall 2017 Course Notes 2 Drew Armstrong Oct 17 We have finished covering the basics of probability. The next section of the course is all about random variables. What
More informationCSCE 222 Discrete Structures for Computing. Dr. Hyunyoung Lee
CSCE 222 Discrete Structures for Computing Sequences and Summations Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Sequences 2 Sequences A sequence is a function from a subset of the set of
More informationBasics of Probability Theory
Basics of Probability Theory Andreas Klappenecker Texas A&M University 2018 by Andreas Klappenecker. All rights reserved. 1 / 39 Terminology The probability space or sample space Ω is the set of all possible
More informationThe Minimal Rank Problem for Finite Fields. Wayne Barrett (BYU) Hein van der Holst (Eindhoven) Raphael Loewy (Technion) Don March (BYU)
The Minimal Rank Problem for Finite Fields Wayne Barrett (BYU) Hein van der Holst (Eindhoven) Raphael Loewy (Technion) Don March (BYU) 12th ILAS Meeting - Regina June 26-29, 2005 References [BvdHL1] Barrett,
More informationAPPROXIMATE HOMOMORPHISMS BETWEEN THE BOOLEAN CUBE AND GROUPS OF PRIME ORDER
APPROXIMATE HOMOMORPHISMS BETWEEN THE BOOLEAN CUBE AND GROUPS OF PRIME ORDER TOM SANDERS The purpose of this note is to highlight a question raised by Shachar Lovett [Lov], and to offer some motivation
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationProbability and Statistics
Probability and Statistics 1 Contents some stochastic processes Stationary Stochastic Processes 2 4. Some Stochastic Processes 4.1 Bernoulli process 4.2 Binomial process 4.3 Sine wave process 4.4 Random-telegraph
More information1 (1 x) 4 by taking derivatives and rescaling appropriately. Conjecture what the general formula for the series for 1/(1 x) n.
Math 365 Wednesday 3/20/9 8.2 and 8.4 Exercise 35. Consider the recurrence relation a n =8a n 2 6a n 4 + F (n). (a) Write the associated homogeneous recursion relation and solve for its general solution
More informationKousha Etessami. U. of Edinburgh, UK. Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 7) 1 / 13
Discrete Mathematics & Mathematical Reasoning Chapter 7 (continued): Markov and Chebyshev s Inequalities; and Examples in probability: the birthday problem Kousha Etessami U. of Edinburgh, UK Kousha Etessami
More informationarxiv: v1 [math.nt] 23 May 2017
arxiv:1705.08232v1 [math.nt] 23 May 2017 An equation about sum of primes with digital sum constraints Haifeng Xu February 12, 2018 Abstract We know that any prime number of form 4s ` 1 can be written as
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 informationSystem Identification
System Identification Lecture : Statistical properties of parameter estimators, Instrumental variable methods Roy Smith 8--8. 8--8. Statistical basis for estimation methods Parametrised models: G Gp, zq,
More informationChapter 6 Expectation and Conditional Expectation. Lectures Definition 6.1. Two random variables defined on a probability space are said to be
Chapter 6 Expectation and Conditional Expectation Lectures 24-30 In this chapter, we introduce expected value or the mean of a random variable. First we define expectation for discrete random variables
More informationThe Class Equation X = Gx. x X/G
The Class Equation 9-9-2012 If X is a G-set, X is partitioned by the G-orbits. So if X is finite, X = x X/G ( x X/G means you should take one representative x from each orbit, and sum over the set of representatives.
More informationn! (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 informationProof by Induction. Andreas Klappenecker
Proof by Induction Andreas Klappenecker 1 Motivation Induction is an axiom which allows us to prove that certain properties are true for all positive integers (or for all nonnegative integers, or all integers
More informationADVANCE TOPICS IN ANALYSIS - REAL. 8 September September 2011
ADVANCE TOPICS IN ANALYSIS - REAL NOTES COMPILED BY KATO LA Introductions 8 September 011 15 September 011 Nested Interval Theorem: If A 1 ra 1, b 1 s, A ra, b s,, A n ra n, b n s, and A 1 Ě A Ě Ě A n
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.co] 11 Oct 2016
ON SUBSEQUENCES OF QUIDDITY CYCLES AND NICHOLS ALGEBRAS arxiv:1610.043v [math.co] 11 Oct 016 M. CUNTZ Abstract. We provide a tool to obtain local descriptions of quiddity cycles. As an application, we
More information4 Sums of Independent Random Variables
4 Sums of Independent Random Variables Standing Assumptions: Assume throughout this section that (,F,P) is a fixed probability space and that X 1, X 2, X 3,... are independent real-valued random variables
More informationSlides 8: Statistical Models in Simulation
Slides 8: Statistical Models in Simulation Purpose and Overview The world the model-builder sees is probabilistic rather than deterministic: Some statistical model might well describe the variations. An
More information1 Inverse Transform Method and some alternative algorithms
Copyright c 2016 by Karl Sigman 1 Inverse Transform Method and some alternative algorithms Assuming our computer can hand us, upon demand, iid copies of rvs that are uniformly distributed on (0, 1), it
More informationSobolev-Type Extremal Polynomials
Soolev-Type Extremal Polyomials (case of the sigular measures) Ael Díaz-Gozález Joi with Héctor Pijeira-Carera ULL 2016 Soolev-Type Extremal Polyomials adiazgo@math.uc3m.es 1 / 18 Moic extremal polyomials
More informationMathematical Finance
ETH Zürich, HS 2017 Prof. Josef Teichmann Matti Kiiski Mathematical Finance Solution sheet 14 Solution 14.1 Denote by Z pz t q tpr0,t s the density process process of Q with respect to P. (a) The second
More informationp. 4-1 Random Variables
Random Variables A Motivating Example Experiment: Sample k students without replacement from the population of all n students (labeled as 1, 2,, n, respectively) in our class. = {all combinations} = {{i
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 informationProbability Theory Overview and Analysis of Randomized Algorithms
Probability Theory Overview and Analysis of Randomized Algorithms Analysis of Algorithms Prepared by John Reif, Ph.D. Probability Theory Topics a) Random Variables: Binomial and Geometric b) Useful Probabilistic
More informationMATHEMATICS AND STATISTICS
011-AS-M & S 44 INTRODUCTION MATHEMATICS AND STATISTICS ADVANCED SUPPLEMENTARY LEVEL This syllabus has been designed mainly for candidates who wish to further their study of mathematics beyond the Certificate
More informationSequences and Series of Functions
Chapter 13 Sequences and Series of Functions These notes are based on the notes A Teacher s Guide to Calculus by Dr. Louis Talman. The treatment of power series that we find in most of today s elementary
More informationGap probabilities in tiling models and Painlevé equations
Gap probabilities in tiling models and Painlevé equations Alisa Knizel Columbia University Painlevé Equations and Applications: A Workshop in Memory of A. A. Kapaev August 26, 2017 1 / 17 Tiling model
More informationarxiv: v6 [math.nt] 6 Nov 2015
arxiv:1406.0429v6 [math.nt] 6 Nov 2015 Periodicity related to a sieve method of producing primes Haifeng Xu, Zuyi Zhang, Jiuru Zhou November 9, 2015 Abstract In this paper we consider a slightly different
More informationFoundation of Cryptography, Lecture 4 Pseudorandom Functions
Foundation of Cryptography, Lecture 4 Pseudorandom Functions Handout Mode Iftach Haitner, Tel Aviv University Tel Aviv University. March 11, 2014 Iftach Haitner (TAU) Foundation of Cryptography March 11,
More informationHUB HUB RESEARCH PAPER. A Markov Binomial Distribution. Hogeschool Universiteit Brussel. E. Omey, J. Santos and S. Van Gulck
HUB HUB RESEARCH PAPER A Markov Binomial Distribution E. Omey, J. Santos and S. Van Gulck HUB RESEARCH PAPER 2007/5. SEPTEMBER 2007 Hogeschool Universiteit Brussel Stormstraat 2, 000 Brussel, Belgium T:
More information3 Multiple Discrete Random Variables
3 Multiple Discrete Random Variables 3.1 Joint densities Suppose we have a probability space (Ω, F,P) and now we have two discrete random variables X and Y on it. They have probability mass functions f
More informationChapter 3, 4 Random Variables ENCS Probability and Stochastic Processes. Concordia University
Chapter 3, 4 Random Variables ENCS6161 - Probability and Stochastic Processes Concordia University ENCS6161 p.1/47 The Notion of a Random Variable A random variable X is a function that assigns a real
More informationCharacterizing Cycle Partition in 2-Row Bulgarian Solitaire
Saint Peter s University Honors Thesis Characterizing Cycle Partition in 2-Row Bulgarian Solitaire Author: Sabin K Pradhan Advisor: Dr Brian Hopkins A thesis submitted in partial fulfillment of the requirements
More informationarxiv: v6 [math.nt] 16 May 2017
arxiv:5.038v6 [math.nt] 6 May 207 An alternative proof of the Dirichlet prime number theorem Haifeng Xu May 7, 207 Abstract Dirichlet s theorem on arithmetic progressions called as Dirichlet prime number
More informationDiscrete Random Variables
Discrete Random Variables An Undergraduate Introduction to Financial Mathematics J. Robert Buchanan Introduction The markets can be thought of as a complex interaction of a large number of random processes,
More informationn! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2
Order statistics Ex. 4.1 (*. Let independent variables X 1,..., X n have U(0, 1 distribution. Show that for every x (0, 1, we have P ( X (1 < x 1 and P ( X (n > x 1 as n. Ex. 4.2 (**. By using induction
More informationMathematical Induction. How does discrete math help us. How does discrete math help (CS160)? How does discrete math help (CS161)?
How does discrete math help us Helps create a solution (program) Helps analyze a program How does discrete math help (CS160)? Helps create a solution (program) q Logic helps you understand conditionals
More informationSome Congruences for the Partial Bell Polynomials
3 47 6 3 Journal of Integer Seuences, Vol. 009), Article 09.4. Some Congruences for the Partial Bell Polynomials Miloud Mihoubi University of Science and Technology Houari Boumediene Faculty of Mathematics
More informationGaussian vectors and central limit theorem
Gaussian vectors and central limit theorem Samy Tindel Purdue University Probability Theory 2 - MA 539 Samy T. Gaussian vectors & CLT Probability Theory 1 / 86 Outline 1 Real Gaussian random variables
More informationFor example, p12q p2x 1 x 2 ` 5x 2 x 2 3 q 2x 2 x 1 ` 5x 1 x 2 3. (a) Let p 12x 5 1x 7 2x 4 18x 6 2x 3 ` 11x 1 x 2 x 3 x 4,
SOLUTIONS Math A4900 Homework 5 10/4/2017 1. (DF 2.2.12(a)-(d)+) Symmetric polynomials. The group S n acts on the set tx 1, x 2,..., x n u by σ x i x σpiq. That action extends to a function S n ˆ A Ñ A,
More informationMath Bootcamp 2012 Miscellaneous
Math Bootcamp 202 Miscellaneous Factorial, combination and permutation The factorial of a positive integer n denoted by n!, is the product of all positive integers less than or equal to n. Define 0! =.
More informationLOWELL WEEKLY JOURNAL.
Y $ Y Y 7 27 Y 2» x 7»» 2» q» ~ [ } q q $ $ 6 2 2 2 2 2 2 7 q > Y» Y >» / Y» ) Y» < Y»» _»» < Y > Y Y < )»» >» > ) >» >> >Y x x )»» > Y Y >>»» }> ) Y < >» /» Y x» > / x /»»»»» >» >» >»» > > >» < Y /~ >
More informationarxiv:alg-geom/ v2 30 Jul 1996
ON AN UNUSUAL CONJECTURE OF KONTSEVICH AND VARIANTS OF CASTELNUOVO S LEMMA arxiv:alg-geom/9604023v2 30 Jul 996 J.M. Landsberg July 30, 996 Abstract. Let A = (a i j ) be an orthogonal matrix (over R or
More informationNOTES WEEK 15 DAY 1 SCOT ADAMS
NOTES WEEK 15 DAY 1 SCOT ADAMS We fix some notation for the entire class today: Let n P N, W : R n, : 2 P N pw q, W : LpW, W q, I : id W P W, z : 0 W 0 n. Note that W LpR n, R n q. Recall, for all T P
More informationExam 2 Solutions. In class questions
Math 5330 Spring 2018 Exam 2 Solutions In class questions 1. (15 points) Solve the following congruences. Put your answer in the form of a congruence. I usually find it easier to go from largest to smallest
More information1 Hypothesis testing for a single mean
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike License. Your use of this material constitutes acceptance of that license and the conditions of use of materials on this
More informationConvergence of Infinite Composition of Entire Functions
arxiv:009.2833v [math.cv] 5 Sep 200 Convergence of Infinite Composition of Entire Functions Shota Kojima Abstract The purpose of the present article is to obtain the condition that the function defined
More informationDiscrete Random Variables (cont.) Discrete Distributions the Geometric pmf
Discrete Random Variables (cont.) ECE 313 Probability with Engineering Applications Lecture 10 - September 29, 1999 Professor Ravi K. Iyer University of Illinois the Geometric pmf Consider a sequence of
More information1 Presessional Probability
1 Presessional Probability Probability theory is essential for the development of mathematical models in finance, because of the randomness nature of price fluctuations in the markets. This presessional
More informationInner Product Spaces
Inner Product Spaces Introduction Recall in the lecture on vector spaces that geometric vectors (i.e. vectors in two and three-dimensional Cartesian space have the properties of addition, subtraction,
More informationPRINCIPLES OF ANALYSIS - LECTURE NOTES
PRINCIPLES OF ANALYSIS - LECTURE NOTES PETER A. PERRY 1. Constructions of Z, Q, R Beginning with the natural numbers N t1, 2, 3,...u we can use set theory to construct, successively, Z, Q, and R. We ll
More informationOrder Statistics. The order statistics of a set of random variables X 1, X 2,, X n are the same random variables arranged in increasing order.
Order Statistics The order statistics of a set of random variables 1, 2,, n are the same random variables arranged in increasing order. Denote by (1) = smallest of 1, 2,, n (2) = 2 nd smallest of 1, 2,,
More informationMath 651 Introduction to Numerical Analysis I Fall SOLUTIONS: Homework Set 1
ath 651 Introduction to Numerical Analysis I Fall 2010 SOLUTIONS: Homework Set 1 1. Consider the polynomial f(x) = x 2 x 2. (a) Find P 1 (x), P 2 (x) and P 3 (x) for f(x) about x 0 = 0. What is the relation
More informationMULTI-RESTRAINED STIRLING NUMBERS
MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained
More informationGenealogy of Pythagorean triangles
Chapter 0 Genealogy of Pythagorean triangles 0. Two ternary trees of rational numbers Consider the rational numbers in the open interval (0, ). Each of these is uniquely in the form q, for relatively prime
More informationChapter 2. Real Numbers. 1. Rational Numbers
Chapter 2. Real Numbers 1. Rational Numbers A commutative ring is called a field if its nonzero elements form a group under multiplication. Let (F, +, ) be a filed with 0 as its additive identity element
More informationSome Results Concerning Uniqueness of Triangle Sequences
Some Results Concerning Uniqueness of Triangle Sequences T. Cheslack-Postava A. Diesl M. Lepinski A. Schuyler August 12 1999 Abstract In this paper we will begin by reviewing the triangle iteration. We
More informationUniversal examples. Chapter The Bernoulli process
Chapter 1 Universal examples 1.1 The Bernoulli process First description: Bernoulli random variables Y i for i = 1, 2, 3,... independent with P [Y i = 1] = p and P [Y i = ] = 1 p. Second description: Binomial
More informationSuppose that you have three coins. Coin A is fair, coin B shows heads with probability 0.6 and coin C shows heads with probability 0.8.
Suppose that you have three coins. Coin A is fair, coin B shows heads with probability 0.6 and coin C shows heads with probability 0.8. Coin A is flipped until a head appears, then coin B is flipped until
More informationThe Union and Intersection for Different Configurations of Two Events Mutually Exclusive vs Independency of Events
Section 1: Introductory Probability Basic Probability Facts Probabilities of Simple Events Overview of Set Language Venn Diagrams Probabilities of Compound Events Choices of Events The Addition Rule Combinations
More informationSDS 321: Introduction to Probability and Statistics
SDS 321: Introduction to Probability and Statistics Lecture 13: Expectation and Variance and joint distributions Purnamrita Sarkar Department of Statistics and Data Science The University of Texas at Austin
More information8. Prime Factorization and Primary Decompositions
70 Andreas Gathmann 8. Prime Factorization and Primary Decompositions 13 When it comes to actual computations, Euclidean domains (or more generally principal ideal domains) are probably the nicest rings
More informationSobolev Spaces. Chapter 10
Chapter 1 Sobolev Spaces We now define spaces H 1,p (R n ), known as Sobolev spaces. For u to belong to H 1,p (R n ), we require that u L p (R n ) and that u have weak derivatives of first order in L p
More informationADVANCED PROBLEMS AND SOLUTIONS
Edited by Raymond E. Whitney Please send all communications concerning ADVANCED PROBLEMS AND SOLUTIONS to RAYMOND E. WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HA VEN, PA 17745. This
More informationMATH 387 ASSIGNMENT 2
MATH 387 ASSIGMET 2 SAMPLE SOLUTIOS BY IBRAHIM AL BALUSHI Problem 4 A matrix A ra ik s P R nˆn is called symmetric if a ik a ki for all i, k, and is called positive definite if x T Ax ě 0 for all x P R
More informationModern Discrete Probability Branching processes
Modern Discrete Probability IV - Branching processes Review Sébastien Roch UW Madison Mathematics November 15, 2014 1 Basic definitions 2 3 4 Galton-Watson branching processes I Definition A Galton-Watson
More informationCS 173 Lecture 7: Arithmetic (II)
CS 173 Lecture 7: Arithmetic (II) José Meseguer University of Illinois at Urbana-Champaign 1 The Fundamental Theorem of Arithmetic (Part II) Fundamental Theorem of Arithmetic (Part II). Every natural number
More informationRuns of Identical Outcomes in a Sequence of Bernoulli Trials
Western Kentucky University TopSCHOLAR Masters Theses & Specialist Projects Graduate School Spring 2018 Runs of Identical Outcomes in a Sequence of Bernoulli Trials Matthew Riggle Western Kentucky University,
More informationTopic 3: The Expectation of a Random Variable
Topic 3: The Expectation of a Random Variable Course 003, 2017 Page 0 Expectation of a discrete random variable Definition (Expectation of a discrete r.v.): The expected value (also called the expectation
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 32 Proofs Proofs
More informationCombinatorial Analysis of the Geometric Series
Combinatorial Analysis of the Geometric Series David P. Little April 7, 205 www.math.psu.edu/dlittle Analytic Convergence of a Series The series converges analytically if and only if the sequence of partial
More information6 CARDINALITY OF SETS
6 CARDINALITY OF SETS MATH10111 - Foundations of Pure Mathematics We all have an idea of what it means to count a finite collection of objects, but we must be careful to define rigorously what it means
More informationMAIN THEOREM OF GALOIS THEORY
MAIN THEOREM OF GALOIS THEORY Theorem 1. [Main Theorem] Let L/K be a finite Galois extension. and (1) The group G = Gal(L/K) is a group of order [L : K]. (2) The maps defined by and f : {subgroups of G}!
More informationAsymptotic Statistics-III. Changliang Zou
Asymptotic Statistics-III Changliang Zou The multivariate central limit theorem Theorem (Multivariate CLT for iid case) Let X i be iid random p-vectors with mean µ and and covariance matrix Σ. Then n (
More informationPerhaps 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 informationExam 1 Solutions. Solution: The 16 contributes 5 to the total and contributes 2. All totaled, there are 5 ˆ 2 10 abelian groups.
Math 5372 Spring 2014 Exam 1 Solutions 1. (15 points) How many abelian groups are there of order: (a) 16 For any prime p, there are as many groups of order p k as there are partitions of k. The number
More informationLEGENDRE POLYNOMIALS AND APPLICATIONS. We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.
LEGENDRE POLYNOMIALS AND APPLICATIONS We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.. Legendre equation: series solutions The Legendre equation is
More informationExtensive Form Abstract Economies and Generalized Perfect Recall
Extensive Form Abstract Economies and Generalized Perfect Recall Nicholas Butler Princeton University July 30, 2015 Nicholas Butler (Princeton) EFAE and Generalized Perfect Recall July 30, 2015 1 / 1 Motivation
More information