Maximum Likelihood Estimation for Allele Frequencies. Biostatistics 666

Size: px
Start display at page:

Download "Maximum Likelihood Estimation for Allele Frequencies. Biostatistics 666"

Transcription

1 Mximum Likelihood Estimtion for Allele Frequencies Biosttistics 666

2 Previous Series of Lectures: Introduction to Colescent Models Comuttionlly efficient frmework Alterntive to forwrd simultions Amenble to nlyticl solutions Predictions bout sequence vrition Number of olymorhisms Frequency of olymorhisms Distribution of olymorhisms cross hlotyes

3 Next Series of Lectures Estimting llele nd hlotye frequencies from genotye dt Mximum likelihood roch Aliction of n E-M lgorithm Chllenges Using informtion from relted individuls Allowing for non-codominnt genotyes Allowing for mbiguity in hlotye ssignments

4 Mximum Likelihood A generl frmework for estimting model rmeters Find rmeter vlues tht mximize the robbility of the observed dt Lern bout oultion chrcteristics E.g. llele frequencies, oultion size Using secific smle E.g. set sequences, unrelted individuls, or even fmilies Alicble to mny different roblems

5 Exmle: Allele Frequencies Consider A smle of n chromosomes X of these re of tye Prmeter of interest is llele frequency L( n, X ) n X n X ( ) X

6 Evlute for vrious rmeters - L For n = 0 nd X = 4

7 Likelihood Plot 0.4 For n = 0 nd X = Likelihood Allele Frequency

8 In this cse The likelihood tells us the dt is most robble if = 0.4 The likelihood curve llows us to evlute lterntives Is = 0.8 ossibility? Is = 0. ossibility?

9 Exmle: Estimting 4N Consider S olymorhisms in smle of n sequences L( n, S) P ( S ) n Where P n is clculted using the Q n nd P functions defined reviously

10 Likelihood Likelihood Plot With n = 5, S = 0 MLE 4N

11 Mximum Likelihood Estimtion Two bsic stes ) Write down likelihood function L( x) f ( x ) b) Find vlue of ˆ tht mximizes L( x) In rincile, licble to ny roblem where likelihood function exists

12 MLEs Prmeter vlues tht mximize likelihood where observtions hve mximum robbility Finding MLEs is n otimiztion roblem How do MLEs comre to other estimtors?

13 Comring Estimtors How do MLEs rte in terms of Unbisedness Consistency Efficiency For review, see Grthwite, Jolliffe, Jones (995) Sttisticl Inference, Prentice Hll

14 Anlyticl Solutions Write out log-likelihood ( dt) ln L( dt) Clculte derivtive of likelihood d ( dt) d Find zeros for derivtive function

15 Informtion The second derivtive is lso extremely useful The seed t which log-likelihood decreses Provides n symtotic vrince for estimtes I V d dt d E I ) ( ˆ

16 Allele Frequency Estimtion When individul chromosomes re observed this is not so tricky Wht bout with genotyes? Wht bout with rent-offsring irs?

17 Coming u We will wlk through llele frequency estimtion in three distinct settings: Smles single chromosomes Smles of unrelted Individuls Smles of rents nd offsring

18 I. Single Alleles Observed Consider A smle of n chromosomes X of these re of tye Prmeter of interest is llele frequency L( n, X ) n X n X ( ) X

19 Some Notes The following two likelihoods re just s good: For ML estimtion, constnt fctors in likelihood don t mtter n i x x n X n X i i n x x x L X n n X L ) ( ),..., ; ( ) ( ), ; (

20 Anlytic Solution The log-likelihood ln L( The derivtive n, X ) ln n X X ln ( n X )ln( ) d ln L( d X ) X n X Find zero

21 Smles of Individul Chromosomes The nturl estimtor (where we count the roortion of sequences of rticulr tye) nd the MLE give identicl solutions Mximum likelihood rovides justifiction for using the nturl estimtor

22 II. Genotyes Observed Use nottion n ij to denote the number of individuls with genotye i / j Smle of n individuls Genotye Counts Genotye A A A A A A Totl Observed Counts n n n n=n +n +n Frequency.0

23 Allele Frequencies by Counting A nturl estimte for llele frequencies is to clculte the roortion of individuls crrying ech llele Allele Counts Genotye A A Totl Observed Counts n = n + n n = n + n n=n +n Frequency =n /n =n /n.0

24 MLE using genotye dt Consider smle such s... Genotye Counts Genotye A A A A A A Totl Observed Counts n n n n=n +n +n Frequency.0 The likelihood s function of llele frequencies is L( ; n) n n!! n! n! n n ² ² n q q

25 Which gives Log-likelihood nd its derivtive ln d d L n n n ln n n n n n ( ) ln( ) C Giving the MLE s ˆ n n n n n

26 Smles of Unrelted Individuls Agin, nturl estimtor (where we count the roortion of lleles of rticulr tye) nd the MLE give identicl solutions Mximum likelihood rovides justifiction for using the nturl estimtor

27 III. Prent-Offsring Pirs Child Prent A A A A A A A A 0 + A A A A N irs

28 Probbility for Ech Observtion Child Prent A A A A A A A A A A A A.0

29 Probbility for Ech Observtion Child Prent A A A A A A A A 3 0 A A A A 0 3.0

30 Which gives C B B C B ˆ 3 3 ln L

31 Which gives C B B C B C B ˆ 3 3 ) ln( ln constnt ln ln ln ln ln ln L

32 Smles of Prent Offsring-Pirs The nturl estimtor (where we count the roortion of lleles of rticulr tye) nd the MLE no longer give identicl solutions In this cse, we exect the MLE to be more ccurte

33 Comring Smling Strtegies We cn comre smling strtegies by clculting the informtion for ech one Which one to you exect to be most informtive? I V d dt d E I ) ( ˆ

34 How informtive is ech setting? Single chromosomes Vr( ) N q chromosomes Unrelted individuls Vr( ) N q individuls Prent offsring irs Vr( ) 3N q irs 4

35 Other Likelihoods Allele frequencies when individuls re Dignosed for Mendelin disorder Genotyed t two neighboring loci Phenotyed for the ABO blood grous Mny other interesting roblems but some hve no nlyticl solution

36 Tody s Summry Exmles of Mximum Likelihood Allele Frequency Estimtion Allele counts Genotye counts Pirs of Individuls

37 Tke home reding Excoffier nd Sltkin (995) Mol Biol Evol :9-97 Introduces the E-M lgorithm Widely used for mximizing likelihoods in genetic roblems

38 Proerties of Estimtors For Review

39 Unbisedness An estimtor is unbised if E( ˆ) bis( ˆ) E( ˆ) Multile unbised estimtors my exist Other roerties my be desirble

40 Consistency An estimtor is consistent if for ny P ˆ 0 s n Estimte converges to true vlue in robbility with incresing smle size

41 Men Squred Error MSE is defined s If MSE 0 s n then the estimtor must be consistent

42 Efficiency The reltive efficiency of two estimtors is the rtio of their vrinces vr( ˆ ) if then ˆ vr( ˆ ) ismore efficient Comrison only meningful for estimtors with equl bises

43 Sufficiency Consider Observtions X, X, X n Sttistic T(X, X, X n ) T is sufficient sttistic if it includes ll informtion bout rmeter in the smle Distribution of X i conditionl on T is indeendent of Posterior distribution of conditionl on T is indeendent of X i

44 Miniml Sufficient Sttistic There cn be mny lterntive sufficient sttistics. A sttistic is miniml sufficient sttistic if it cn be exressed s function of every other sufficient sttistic.

45 Tyicl Proerties of MLEs Bis Cn be bised or unbised Consistency Subject to regulrity conditions, MLEs re consistent Efficiency Tyiclly, MLEs re symtoticlly efficient estimtors Sufficiency Often, but not lwys Cox nd Hinkley, 974

46 Strtegies for Likelihood Otimiztion For Review

47 Generic Aroches Suitble for when nlyticl solutions re imrcticl Brcketing Simlex Method Newton-Rhson

48 Brcketing Find 3 oints such tht < b < c L( b ) > L( ) nd L( b ) > L( c ) Serch for mximum by Select tril oint in intervl Kee mximum nd flnking oints

49 Brcketing

50 The Simlex Method Clculte likelihoods t simlex vertices Geometric she with k+ corners E.g. tringle in k = dimensions At ech ste, move the high vertex in the direction of lower oints

51 The Simlex Method II high reflection Originl Simlex low contrction reflection nd exnsion multile contrction

52 One rmeter mximiztion Simle but inefficient roch Consider Prmeters = (,,, k ) Likelihood function L (; x) Mximize with resect to ech i in turn Cycle through rmeters

53 The Inefficiency

54 Steeest Descent Consider Prmeters = (,,, k ) Likelihood function L (; x) Score vector S d ln( L) d d ln( L) d,..., d ln( L) d k Find mximum long + S

55 Still inefficient Consecutive stes re erendiculr!

56 Locl Aroximtions to Log-Likelihood Function informtion mtrix the observed is ) ( ² vector the score is ) ( the loglikelihoodfunction is ) ( ln ) ( where ) ( ) ( ) ( ) ( ) ( the neighboorhoodof In i i i t i i i i d d L S θ I θ S θ θ θ θ I θ θ θ θ θ θ θ

57 Newton s Method S I θ θ 0 θ θ I S θ θ I θ θ θ θ S θ θ oint new tril nd get ) ( to zero... by setting its derivtive ) ( ) ( ) ( ) ( ) ( the roximtion Mximize i i i i t i i i

58 Fisher Scoring Use exected informtion mtrix insted of observed informtion: d ( ) E d insted of d ( dt) d Comred to Newton-Rhson: Converges fster when estimtes re oor. Converges slower when close to MLE.

Haplotype Frequencies and Linkage Disequilibrium. Biostatistics 666

Haplotype Frequencies and Linkage Disequilibrium. Biostatistics 666 Hlotye Frequencies nd Linkge isequilirium iosttistics 666 Lst Lecture Genotye Frequencies llele Frequencies Phenotyes nd Penetrnces Hrdy-Weinerg Equilirium Simle demonstrtion Exercise: NO2 nd owel isese

More information

Tests for the Ratio of Two Poisson Rates

Tests for the Ratio of Two Poisson Rates Chpter 437 Tests for the Rtio of Two Poisson Rtes Introduction The Poisson probbility lw gives the probbility distribution of the number of events occurring in specified intervl of time or spce. The Poisson

More information

Data Assimilation. Alan O Neill Data Assimilation Research Centre University of Reading

Data Assimilation. Alan O Neill Data Assimilation Research Centre University of Reading Dt Assimiltion Aln O Neill Dt Assimiltion Reserch Centre University of Reding Contents Motivtion Univrite sclr dt ssimiltion Multivrite vector dt ssimiltion Optiml Interpoltion BLUE 3d-Vritionl Method

More information

The p-folded Cumulative Distribution Function and the Mean Absolute Deviation from the p-quantile

The p-folded Cumulative Distribution Function and the Mean Absolute Deviation from the p-quantile The -folded Cumultive Distribution Function nd the Men Absolute Devition from the -quntile Jing-Ho Xue,, D. Michel Titterington b Dertment of Sttisticl Science, University College London, London WC1E 6BT,

More information

The steps of the hypothesis test

The steps of the hypothesis test ttisticl Methods I (EXT 7005) Pge 78 Mosquito species Time of dy A B C Mid morning 0.0088 5.4900 5.5000 Mid Afternoon.3400 0.0300 0.8700 Dusk 0.600 5.400 3.000 The Chi squre test sttistic is the sum of

More information

Math 1B, lecture 4: Error bounds for numerical methods

Math 1B, lecture 4: Error bounds for numerical methods Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the

More information

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn

More information

Recitation 3: More Applications of the Derivative

Recitation 3: More Applications of the Derivative Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech

More information

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17 EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,

More information

USA Mathematical Talent Search Round 1 Solutions Year 25 Academic Year

USA Mathematical Talent Search Round 1 Solutions Year 25 Academic Year 1/1/5. Alex is trying to oen lock whose code is sequence tht is three letters long, with ech of the letters being one of A, B or C, ossibly reeted. The lock hs three buttons, lbeled A, B nd C. When the

More information

Families of Solutions to Bernoulli ODEs

Families of Solutions to Bernoulli ODEs In the fmily of solutions to the differentil eqution y ry dx + = it is shown tht vrition of the initil condition y( 0 = cuses horizontl shift in the solution curve y = f ( x, rther thn the verticl shift

More information

Lecture 21: Order statistics

Lecture 21: Order statistics Lecture : Order sttistics Suppose we hve N mesurements of sclr, x i =, N Tke ll mesurements nd sort them into scending order x x x 3 x N Define the mesured running integrl S N (x) = 0 for x < x = i/n for

More information

Non-Linear & Logistic Regression

Non-Linear & Logistic Regression Non-Liner & Logistic Regression If the sttistics re boring, then you've got the wrong numbers. Edwrd R. Tufte (Sttistics Professor, Yle University) Regression Anlyses When do we use these? PART 1: find

More information

Review of Calculus, cont d

Review of Calculus, cont d Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some

More information

Solution for Assignment 1 : Intro to Probability and Statistics, PAC learning

Solution for Assignment 1 : Intro to Probability and Statistics, PAC learning Solution for Assignment 1 : Intro to Probbility nd Sttistics, PAC lerning 10-701/15-781: Mchine Lerning (Fll 004) Due: Sept. 30th 004, Thursdy, Strt of clss Question 1. Bsic Probbility ( 18 pts) 1.1 (

More information

Student Activity 3: Single Factor ANOVA

Student Activity 3: Single Factor ANOVA MATH 40 Student Activity 3: Single Fctor ANOVA Some Bsic Concepts In designed experiment, two or more tretments, or combintions of tretments, is pplied to experimentl units The number of tretments, whether

More information

CS 188 Introduction to Artificial Intelligence Fall 2018 Note 7

CS 188 Introduction to Artificial Intelligence Fall 2018 Note 7 CS 188 Introduction to Artificil Intelligence Fll 2018 Note 7 These lecture notes re hevily bsed on notes originlly written by Nikhil Shrm. Decision Networks In the third note, we lerned bout gme trees

More information

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as Improper Integrls Two different types of integrls cn qulify s improper. The first type of improper integrl (which we will refer to s Type I) involves evluting n integrl over n infinite region. In the grph

More information

Z b. f(x)dx. Yet in the above two cases we know what f(x) is. Sometimes, engineers want to calculate an area by computing I, but...

Z b. f(x)dx. Yet in the above two cases we know what f(x) is. Sometimes, engineers want to calculate an area by computing I, but... Chpter 7 Numericl Methods 7. Introduction In mny cses the integrl f(x)dx cn be found by finding function F (x) such tht F 0 (x) =f(x), nd using f(x)dx = F (b) F () which is known s the nlyticl (exct) solution.

More information

Math 360: A primitive integral and elementary functions

Math 360: A primitive integral and elementary functions Mth 360: A primitive integrl nd elementry functions D. DeTurck University of Pennsylvni October 16, 2017 D. DeTurck Mth 360 001 2017C: Integrl/functions 1 / 32 Setup for the integrl prtitions Definition:

More information

Chapters 4 & 5 Integrals & Applications

Chapters 4 & 5 Integrals & Applications Contents Chpters 4 & 5 Integrls & Applictions Motivtion to Chpters 4 & 5 2 Chpter 4 3 Ares nd Distnces 3. VIDEO - Ares Under Functions............................................ 3.2 VIDEO - Applictions

More information

Now, given the derivative, can we find the function back? Can we antidifferenitate it?

Now, given the derivative, can we find the function back? Can we antidifferenitate it? Fundmentl Theorem of Clculus. Prt I Connection between integrtion nd differentition. Tody we will discuss reltionship between two mjor concepts of Clculus: integrtion nd differentition. We will show tht

More information

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17 CS 70 Discrete Mthemtics nd Proility Theory Summer 2014 Jmes Cook Note 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion, y tking

More information

Estimation of Binomial Distribution in the Light of Future Data

Estimation of Binomial Distribution in the Light of Future Data British Journl of Mthemtics & Computer Science 102: 1-7, 2015, Article no.bjmcs.19191 ISSN: 2231-0851 SCIENCEDOMAIN interntionl www.sciencedomin.org Estimtion of Binomil Distribution in the Light of Future

More information

Sections 5.2: The Definite Integral

Sections 5.2: The Definite Integral Sections 5.2: The Definite Integrl In this section we shll formlize the ides from the lst section to functions in generl. We strt with forml definition.. The Definite Integrl Definition.. Suppose f(x)

More information

Antiderivatives Introduction

Antiderivatives Introduction Antierivtives 0. Introuction So fr much of the term hs been sent fining erivtives or rtes of chnge. But in some circumstnces we lrey know the rte of chnge n we wish to etermine the originl function. For

More information

Lumpability and Absorbing Markov Chains

Lumpability and Absorbing Markov Chains umbility nd Absorbing rov Chins By Ahmed A.El-Sheih Dertment of Alied Sttistics & Econometrics Institute of Sttisticl Studies & Reserch (I.S.S.R Ciro University Abstrct We consider n bsorbing rov Chin

More information

Properties of Lorenz Curves for Transformed Income Distributions

Properties of Lorenz Curves for Transformed Income Distributions Theoreticl Economics etters 22 2 487-493 htt://ddoiorg/4236/tel22259 Published Online December 22 (htt://wwwscirporg/journl/tel) Proerties of orenz Curves for Trnsformed Income Distributions John Fellmn

More information

Partial Derivatives. Limits. For a single variable function f (x), the limit lim

Partial Derivatives. Limits. For a single variable function f (x), the limit lim Limits Prtil Derivtives For single vrible function f (x), the limit lim x f (x) exists only if the right-hnd side limit equls to the left-hnd side limit, i.e., lim f (x) = lim f (x). x x + For two vribles

More information

f(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral

f(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral Improper Integrls Every time tht we hve evluted definite integrl such s f(x) dx, we hve mde two implicit ssumptions bout the integrl:. The intervl [, b] is finite, nd. f(x) is continuous on [, b]. If one

More information

Section Areas and Distances. Example 1: Suppose a car travels at a constant 50 miles per hour for 2 hours. What is the total distance traveled?

Section Areas and Distances. Example 1: Suppose a car travels at a constant 50 miles per hour for 2 hours. What is the total distance traveled? Section 5. - Ares nd Distnces Exmple : Suppose cr trvels t constnt 5 miles per hour for 2 hours. Wht is the totl distnce trveled? Exmple 2: Suppose cr trvels 75 miles per hour for the first hour, 7 miles

More information

LECTURE NOTE #12 PROF. ALAN YUILLE

LECTURE NOTE #12 PROF. ALAN YUILLE LECTURE NOTE #12 PROF. ALAN YUILLE 1. Clustering, K-mens, nd EM Tsk: set of unlbeled dt D = {x 1,..., x n } Decompose into clsses w 1,..., w M where M is unknown. Lern clss models p(x w)) Discovery of

More information

Quantum Physics II (8.05) Fall 2013 Assignment 2

Quantum Physics II (8.05) Fall 2013 Assignment 2 Quntum Physics II (8.05) Fll 2013 Assignment 2 Msschusetts Institute of Technology Physics Deprtment Due Fridy September 20, 2013 September 13, 2013 3:00 pm Suggested Reding Continued from lst week: 1.

More information

X Z Y Table 1: Possibles values for Y = XZ. 1, p

X Z Y Table 1: Possibles values for Y = XZ. 1, p ECE 534: Elements of Informtion Theory, Fll 00 Homework 7 Solutions ll by Kenneth Plcio Bus October 4, 00. Problem 7.3. Binry multiplier chnnel () Consider the chnnel Y = XZ, where X nd Z re independent

More information

38 Riemann sums and existence of the definite integral.

38 Riemann sums and existence of the definite integral. 38 Riemnn sums nd existence of the definite integrl. In the clcultion of the re of the region X bounded by the grph of g(x) = x 2, the x-xis nd 0 x b, two sums ppered: ( n (k 1) 2) b 3 n 3 re(x) ( n These

More information

CMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature

CMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature CMDA 4604: Intermedite Topics in Mthemticl Modeling Lecture 19: Interpoltion nd Qudrture In this lecture we mke brief diversion into the res of interpoltion nd qudrture. Given function f C[, b], we sy

More information

Chapter 9: Inferences based on Two samples: Confidence intervals and tests of hypotheses

Chapter 9: Inferences based on Two samples: Confidence intervals and tests of hypotheses Chpter 9: Inferences bsed on Two smples: Confidence intervls nd tests of hypotheses 9.1 The trget prmeter : difference between two popultion mens : difference between two popultion proportions : rtio of

More information

MATH 144: Business Calculus Final Review

MATH 144: Business Calculus Final Review MATH 144: Business Clculus Finl Review 1 Skills 1. Clculte severl limits. 2. Find verticl nd horizontl symptotes for given rtionl function. 3. Clculte derivtive by definition. 4. Clculte severl derivtives

More information

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl

More information

The Multiperiod Network Design Problem: Lagrangian-based Solution Approaches 2

The Multiperiod Network Design Problem: Lagrangian-based Solution Approaches 2 Konrd-Zuse-Zentrum für Informtionstechnik Berlin Tkustrße 7 D-14195 Berlin-Dhlem Germny ANASTASIOS GIOVANIDIS 1 JONAD PULAJ 1 The ultieriod Network Design Problem: Lgrngin-bsed Solution Aroches 2 1 Zuse

More information

Supplement 4 Permutations, Legendre symbol and quadratic reciprocity

Supplement 4 Permutations, Legendre symbol and quadratic reciprocity Sulement 4 Permuttions, Legendre symbol nd qudrtic recirocity 1. Permuttions. If S is nite set contining n elements then ermuttion of S is one to one ming of S onto S. Usully S is the set f1; ; :::; ng

More information

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite

More information

Best Approximation. Chapter The General Case

Best Approximation. Chapter The General Case Chpter 4 Best Approximtion 4.1 The Generl Cse In the previous chpter, we hve seen how n interpolting polynomil cn be used s n pproximtion to given function. We now wnt to find the best pproximtion to given

More information

Chapter 6 Notes, Larson/Hostetler 3e

Chapter 6 Notes, Larson/Hostetler 3e Contents 6. Antiderivtives nd the Rules of Integrtion.......................... 6. Are nd the Definite Integrl.................................. 6.. Are............................................ 6. Reimnn

More information

Main topics for the First Midterm

Main topics for the First Midterm Min topics for the First Midterm The Midterm will cover Section 1.8, Chpters 2-3, Sections 4.1-4.8, nd Sections 5.1-5.3 (essentilly ll of the mteril covered in clss). Be sure to know the results of the

More information

Math 31S. Rumbos Fall Solutions to Assignment #16

Math 31S. Rumbos Fall Solutions to Assignment #16 Mth 31S. Rumbos Fll 2016 1 Solutions to Assignment #16 1. Logistic Growth 1. Suppose tht the growth of certin niml popultion is governed by the differentil eqution 1000 dn N dt = 100 N, (1) where N(t)

More information

CS 188: Artificial Intelligence Spring 2007

CS 188: Artificial Intelligence Spring 2007 CS 188: Artificil Intelligence Spring 2007 Lecture 3: Queue-Bsed Serch 1/23/2007 Srini Nrynn UC Berkeley Mny slides over the course dpted from Dn Klein, Sturt Russell or Andrew Moore Announcements Assignment

More information

FINALTERM EXAMINATION 2011 Calculus &. Analytical Geometry-I

FINALTERM EXAMINATION 2011 Calculus &. Analytical Geometry-I FINALTERM EXAMINATION 011 Clculus &. Anlyticl Geometry-I Question No: 1 { Mrks: 1 ) - Plese choose one If f is twice differentible function t sttionry point x 0 x 0 nd f ''(x 0 ) > 0 then f hs reltive...

More information

DERIVATIVES NOTES HARRIS MATH CAMP Introduction

DERIVATIVES NOTES HARRIS MATH CAMP Introduction f DERIVATIVES NOTES HARRIS MATH CAMP 208. Introduction Reding: Section 2. The derivtive of function t point is the slope of the tngent line to the function t tht point. Wht does this men, nd how do we

More information

The practical version

The practical version Roerto s Notes on Integrl Clculus Chpter 4: Definite integrls nd the FTC Section 7 The Fundmentl Theorem of Clculus: The prcticl version Wht you need to know lredy: The theoreticl version of the FTC. Wht

More information

1 Probability Density Functions

1 Probability Density Functions Lis Yn CS 9 Continuous Distributions Lecture Notes #9 July 6, 28 Bsed on chpter by Chris Piech So fr, ll rndom vribles we hve seen hve been discrete. In ll the cses we hve seen in CS 9, this ment tht our

More information

ROB EBY Blinn College Mathematics Department

ROB EBY Blinn College Mathematics Department ROB EBY Blinn College Mthemtics Deprtment Mthemtics Deprtment 5.1, 5.2 Are, Definite Integrls MATH 2413 Rob Eby-Fll 26 Weknowthtwhengiventhedistncefunction, wecnfindthevelocitytnypointbyfindingthederivtiveorinstntneous

More information

Overview of Calculus I

Overview of Calculus I Overview of Clculus I Prof. Jim Swift Northern Arizon University There re three key concepts in clculus: The limit, the derivtive, nd the integrl. You need to understnd the definitions of these three things,

More information

Numerical Analysis: Trapezoidal and Simpson s Rule

Numerical Analysis: Trapezoidal and Simpson s Rule nd Simpson s Mthemticl question we re interested in numericlly nswering How to we evlute I = f (x) dx? Clculus tells us tht if F(x) is the ntiderivtive of function f (x) on the intervl [, b], then I =

More information

We know that if f is a continuous nonnegative function on the interval [a, b], then b

We know that if f is a continuous nonnegative function on the interval [a, b], then b 1 Ares Between Curves c 22 Donld Kreider nd Dwight Lhr We know tht if f is continuous nonnegtive function on the intervl [, b], then f(x) dx is the re under the grph of f nd bove the intervl. We re going

More information

The EbayesThresh Package

The EbayesThresh Package The EbyesThresh Pckge Mrch 26, 2005 Title Empiricl Byes thresholding nd relted methods Version 1.3.0 Dte 2005-03-24 Author Bernrd W. Silvermn Mintiner Bernrd W. Silvermn

More information

INTRODUCTION TO INTEGRATION

INTRODUCTION TO INTEGRATION INTRODUCTION TO INTEGRATION 5.1 Ares nd Distnces Assume f(x) 0 on the intervl [, b]. Let A be the re under the grph of f(x). b We will obtin n pproximtion of A in the following three steps. STEP 1: Divide

More information

= a. P( X µ X a) σ2 X a 2. = σ2 X

= a. P( X µ X a) σ2 X a 2. = σ2 X Co902 problem sheet, solutions. () (Mrkov inequlity) LetX be continuous, non-negtive rndom vrible (RV) ndpositive constnt. Show tht: P(X ) E[X] Solution: Let p(x) represent the pdf of RVX. Then: E[X] =

More information

2008 Mathematical Methods (CAS) GA 3: Examination 2

2008 Mathematical Methods (CAS) GA 3: Examination 2 Mthemticl Methods (CAS) GA : Exmintion GENERAL COMMENTS There were 406 students who st the Mthemticl Methods (CAS) exmintion in. Mrks rnged from to 79 out of possible score of 80. Student responses showed

More information

4.1. Probability Density Functions

4.1. Probability Density Functions STT 1 4.1-4. 4.1. Proility Density Functions Ojectives. Continuous rndom vrile - vers - discrete rndom vrile. Proility density function. Uniform distriution nd its properties. Expected vlue nd vrince of

More information

4.4 Areas, Integrals and Antiderivatives

4.4 Areas, Integrals and Antiderivatives . res, integrls nd ntiderivtives 333. Ares, Integrls nd Antiderivtives This section explores properties of functions defined s res nd exmines some connections mong res, integrls nd ntiderivtives. In order

More information

f(a+h) f(a) x a h 0. This is the rate at which

f(a+h) f(a) x a h 0. This is the rate at which M408S Concept Inventory smple nswers These questions re open-ended, nd re intended to cover the min topics tht we lerned in M408S. These re not crnk-out-n-nswer problems! (There re plenty of those in the

More information

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O 1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the

More information

Lecture 3 Gaussian Probability Distribution

Lecture 3 Gaussian Probability Distribution Introduction Lecture 3 Gussin Probbility Distribution Gussin probbility distribution is perhps the most used distribution in ll of science. lso clled bell shped curve or norml distribution Unlike the binomil

More information

Chapter 3 MATRIX. In this chapter: 3.1 MATRIX NOTATION AND TERMINOLOGY

Chapter 3 MATRIX. In this chapter: 3.1 MATRIX NOTATION AND TERMINOLOGY Chpter 3 MTRIX In this chpter: Definition nd terms Specil Mtrices Mtrix Opertion: Trnspose, Equlity, Sum, Difference, Sclr Multipliction, Mtrix Multipliction, Determinnt, Inverse ppliction of Mtrix in

More information

Continuous Random Variables

Continuous Random Variables STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht

More information

Interpreting Integrals and the Fundamental Theorem

Interpreting Integrals and the Fundamental Theorem Interpreting Integrls nd the Fundmentl Theorem Tody, we go further in interpreting the mening of the definite integrl. Using Units to Aid Interprettion We lredy know tht if f(t) is the rte of chnge of

More information

Monte Carlo method in solving numerical integration and differential equation

Monte Carlo method in solving numerical integration and differential equation Monte Crlo method in solving numericl integrtion nd differentil eqution Ye Jin Chemistry Deprtment Duke University yj66@duke.edu Abstrct: Monte Crlo method is commonly used in rel physics problem. The

More information

Reinforcement learning II

Reinforcement learning II CS 1675 Introduction to Mchine Lerning Lecture 26 Reinforcement lerning II Milos Huskrecht milos@cs.pitt.edu 5329 Sennott Squre Reinforcement lerning Bsics: Input x Lerner Output Reinforcement r Critic

More information

Physics 202H - Introductory Quantum Physics I Homework #08 - Solutions Fall 2004 Due 5:01 PM, Monday 2004/11/15

Physics 202H - Introductory Quantum Physics I Homework #08 - Solutions Fall 2004 Due 5:01 PM, Monday 2004/11/15 Physics H - Introductory Quntum Physics I Homework #8 - Solutions Fll 4 Due 5:1 PM, Mondy 4/11/15 [55 points totl] Journl questions. Briefly shre your thoughts on the following questions: Of the mteril

More information

Information synergy, part 3:

Information synergy, part 3: Informtion synergy prt : belief updting These notes describe belief updting for dynmic Kelly-Ross investments where initil conditions my mtter. This note diers from the first two notes on informtion synergy

More information

( dg. ) 2 dt. + dt. dt j + dh. + dt. r(t) dt. Comparing this equation with the one listed above for the length of see that

( dg. ) 2 dt. + dt. dt j + dh. + dt. r(t) dt. Comparing this equation with the one listed above for the length of see that Arc Length of Curves in Three Dimensionl Spce If the vector function r(t) f(t) i + g(t) j + h(t) k trces out the curve C s t vries, we cn mesure distnces long C using formul nerly identicl to one tht we

More information

Lecture 1. Functional series. Pointwise and uniform convergence.

Lecture 1. Functional series. Pointwise and uniform convergence. 1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is

More information

FINALTERM EXAMINATION 9 (Session - ) Clculus & Anlyticl Geometry-I Question No: ( Mrs: ) - Plese choose one f ( x) x According to Power-Rule of differentition, if d [ x n ] n x n n x n n x + ( n ) x n+

More information

Logarithmic Functions

Logarithmic Functions Logrithmic Functions Definition: Let > 0,. Then log is the number to which you rise to get. Logrithms re in essence eponents. Their domins re powers of the bse nd their rnges re the eponents needed to

More information

The graphs of Rational Functions

The graphs of Rational Functions Lecture 4 5A: The its of Rtionl Functions s x nd s x + The grphs of Rtionl Functions The grphs of rtionl functions hve severl differences compred to power functions. One of the differences is the behvior

More information

Computing the Optimal Global Alignment Value. B = n. Score of = 1 Score of = a a c g a c g a. A = n. Classical Dynamic Programming: O(n )

Computing the Optimal Global Alignment Value. B = n. Score of = 1 Score of = a a c g a c g a. A = n. Classical Dynamic Programming: O(n ) Alignment Grph Alignment Mtrix Computing the Optiml Globl Alignment Vlue An Introduction to Bioinformtics Algorithms A = n c t 2 3 c c 4 g 5 g 6 7 8 9 B = n 0 c g c g 2 3 4 5 6 7 8 t 9 0 2 3 4 5 6 7 8

More information

CS667 Lecture 6: Monte Carlo Integration 02/10/05

CS667 Lecture 6: Monte Carlo Integration 02/10/05 CS667 Lecture 6: Monte Crlo Integrtion 02/10/05 Venkt Krishnrj Lecturer: Steve Mrschner 1 Ide The min ide of Monte Crlo Integrtion is tht we cn estimte the vlue of n integrl by looking t lrge number of

More information

Quadratic Residues. Chapter Quadratic residues

Quadratic Residues. Chapter Quadratic residues Chter 8 Qudrtic Residues 8. Qudrtic residues Let n>be given ositive integer, nd gcd, n. We sy tht Z n is qudrtic residue mod n if the congruence x mod n is solvble. Otherwise, is clled qudrtic nonresidue

More information

The final exam will take place on Friday May 11th from 8am 11am in Evans room 60.

The final exam will take place on Friday May 11th from 8am 11am in Evans room 60. Mth 104: finl informtion The finl exm will tke plce on Fridy My 11th from 8m 11m in Evns room 60. The exm will cover ll prts of the course with equl weighting. It will cover Chpters 1 5, 7 15, 17 21, 23

More information

Lecture 20: Numerical Integration III

Lecture 20: Numerical Integration III cs4: introduction to numericl nlysis /8/0 Lecture 0: Numericl Integrtion III Instructor: Professor Amos Ron Scribes: Mrk Cowlishw, Yunpeng Li, Nthnel Fillmore For the lst few lectures we hve discussed

More information

1 Online Learning and Regret Minimization

1 Online Learning and Regret Minimization 2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in

More information

Review of basic calculus

Review of basic calculus Review of bsic clculus This brief review reclls some of the most importnt concepts, definitions, nd theorems from bsic clculus. It is not intended to tech bsic clculus from scrtch. If ny of the items below

More information

Module 6: LINEAR TRANSFORMATIONS

Module 6: LINEAR TRANSFORMATIONS Module 6: LINEAR TRANSFORMATIONS. Trnsformtions nd mtrices Trnsformtions re generliztions of functions. A vector x in some set S n is mpped into m nother vector y T( x). A trnsformtion is liner if, for

More information

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1 Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the

More information

Testing categorized bivariate normality with two-stage. polychoric correlation estimates

Testing categorized bivariate normality with two-stage. polychoric correlation estimates Testing ctegorized bivrite normlity with two-stge polychoric correltion estimtes Albert Mydeu-Olivres Dept. of Psychology University of Brcelon Address correspondence to: Albert Mydeu-Olivres. Fculty of

More information

Math 113 Exam 2 Practice

Math 113 Exam 2 Practice Mth Em Prctice Februry, 8 Em will cover sections 6.5, 7.-7.5 nd 7.8. This sheet hs three sections. The first section will remind you bout techniques nd formuls tht you should know. The second gives number

More information

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)

More information

Numerical Integration

Numerical Integration Chpter 1 Numericl Integrtion Numericl differentition methods compute pproximtions to the derivtive of function from known vlues of the function. Numericl integrtion uses the sme informtion to compute numericl

More information

MATH 115 FINAL EXAM. April 25, 2005

MATH 115 FINAL EXAM. April 25, 2005 MATH 115 FINAL EXAM April 25, 2005 NAME: Solution Key INSTRUCTOR: SECTION NO: 1. Do not open this exm until you re told to begin. 2. This exm hs 9 pges including this cover. There re 9 questions. 3. Do

More information

MATH SS124 Sec 39 Concepts summary with examples

MATH SS124 Sec 39 Concepts summary with examples This note is mde for students in MTH124 Section 39 to review most(not ll) topics I think we covered in this semester, nd there s exmples fter these concepts, go over this note nd try to solve those exmples

More information

The First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a).

The First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a). The Fundmentl Theorems of Clculus Mth 4, Section 0, Spring 009 We now know enough bout definite integrls to give precise formultions of the Fundmentl Theorems of Clculus. We will lso look t some bsic emples

More information

Chapter 5 : Continuous Random Variables

Chapter 5 : Continuous Random Variables STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 216 Néhémy Lim Chpter 5 : Continuous Rndom Vribles Nottions. N {, 1, 2,...}, set of nturl numbers (i.e. ll nonnegtive integers); N {1, 2,...}, set of ll

More information

8 Laplace s Method and Local Limit Theorems

8 Laplace s Method and Local Limit Theorems 8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved

More information

TImath.com Algebra 2. Constructing an Ellipse

TImath.com Algebra 2. Constructing an Ellipse TImth.com Algebr Constructing n Ellipse ID: 9980 Time required 60 minutes Activity Overview This ctivity introduces ellipses from geometric perspective. Two different methods for constructing n ellipse

More information

Tutorial 4. b a. h(f) = a b a ln 1. b a dx = ln(b a) nats = log(b a) bits. = ln λ + 1 nats. = log e λ bits. = ln 1 2 ln λ + 1. nats. = ln 2e. bits.

Tutorial 4. b a. h(f) = a b a ln 1. b a dx = ln(b a) nats = log(b a) bits. = ln λ + 1 nats. = log e λ bits. = ln 1 2 ln λ + 1. nats. = ln 2e. bits. Tutoril 4 Exercises on Differentil Entropy. Evlute the differentil entropy h(x) f ln f for the following: () The uniform distribution, f(x) b. (b) The exponentil density, f(x) λe λx, x 0. (c) The Lplce

More information

APPROXIMATE INTEGRATION

APPROXIMATE INTEGRATION APPROXIMATE INTEGRATION. Introduction We hve seen tht there re functions whose nti-derivtives cnnot be expressed in closed form. For these resons ny definite integrl involving these integrnds cnnot be

More information

Review of Probability Distributions. CS1538: Introduction to Simulations

Review of Probability Distributions. CS1538: Introduction to Simulations Review of Proility Distriutions CS1538: Introduction to Simultions Some Well-Known Proility Distriutions Bernoulli Binomil Geometric Negtive Binomil Poisson Uniform Exponentil Gmm Erlng Gussin/Norml Relevnce

More information

Definition of Continuity: The function f(x) is continuous at x = a if f(a) exists and lim

Definition of Continuity: The function f(x) is continuous at x = a if f(a) exists and lim Mth 9 Course Summry/Study Guide Fll, 2005 [1] Limits Definition of Limit: We sy tht L is the limit of f(x) s x pproches if f(x) gets closer nd closer to L s x gets closer nd closer to. We write lim f(x)

More information

A recursive construction of efficiently decodable list-disjunct matrices

A recursive construction of efficiently decodable list-disjunct matrices CSE 709: Compressed Sensing nd Group Testing. Prt I Lecturers: Hung Q. Ngo nd Atri Rudr SUNY t Bufflo, Fll 2011 Lst updte: October 13, 2011 A recursive construction of efficiently decodble list-disjunct

More information