MIT基础数学讲义(计算机系)lecture 25

MIT Mathematics for Computer Science(1-26) MIT 给计算机系开的数学基础课的讲义 (1-26) 讲义涉及：组合 图论 基础算法 概率论等等

Massahucests Itstinutt oe Tfchneolgyo6 0.42/18.0J26: JMahtemtacis for oCmpture ScinceeP orfseors oTm Legihot

Lentcreu25 4 Dec 97 Le curt eNoets Tih lecturs iesd veted too neo arher gtenrel paroabbiltyiq estioun.Let A A12:::ANb emtualuly idenpendente evnts ove rte hame ssapml sepac. Lee tther naomd vraiabelT be hte unbmre ofth see veenst hat occutr. hWtais tehp orabbliit thayt t aealtsk e vetsno cuc?r hTt is,a hwta i sr(P k)? TThis uestqoi comnseup oft ne Fo. reaxplem, usppseo e wawntto kn wo ht perboabiliytt ht ata elastk h adse oce um inpN t osss of eac oi.nH ree Aii sth e venetth ta hatt tehcoin i shaesd n toe iht-ht ss,oT i steh otal tunbermo fh ead, ans dP(rT k) is the porabilbiyt thtaa telast kh edsa comeu . pAs saeocnd xemalep,sup opestha wet awntt ehp obrailbtyiof a tudsne tnaswerig ant elst kaqu stionesc rroctly enoan e xa mwti N hquseionts. I nths cias,e iAi s he etvet thant he studetnt aswner thsei-th uesqtionc orrcelty T i,sthe ttolan ubme orf qeutionssa nsewer cdorertlcy, andPr(T )k s tih perobbaliiyt tah tteh sutden tnawsrs atelea t s quketioss ncorecrtly. Terh esi a niportanm dt irence eetbewen htse eto exawmpels.T he rts xeapme li sas ecpilac aes i ntah tlal veets Ai nahve qeaul porbailitby hat ist,ht coin ei as slkiley to ocm ueph edsa o nonei aps onanother . n pIarictlaur,spuopes httat e chion omcs ue hpaed swthip orabibily p.tT hn eall eevnt Ai hase vropabilitb py, na d Tah tseh onw-faimilr bainmiaol idtribstuoni:! npk (1 ;p);nk=f k( P)(rT k)== kp neW tsduidet h eibomnia ldistirubtoine txnsevely itw weekos ag.oThe reoref,we lreaay davh an easwner o tteh uqseiot ponsed abveoin htes epialcca s wheeer allev ets ni Aahe equavlpr oabbiityl .I tnhe sceodnex ampl,e ohwvere,osm exema questiosn ighmt b moree di ulc thtan thero. Ifsquest ion 1i esaseirt hnaq estiun o, 2thne ht peroabblity oi evfetn A1 i srgaete tran hthepro babiltyio f evnte A2. hisTl ctuee rocusfseo quenstions of tish omregene al rypt inewh ih cheteven s Atim a yahe dv erenti porabbiitile.s

1 hTePro abibilty of at Lest aOneEve ntBefore ocpmuingt te hprbaboiity tlahta tlea stk ev ets onccu,rwe ilwlcon sier dantoehrsp cielac sae, anmelyt ehp obabirity ltha attl eat son eveen octcrus .hTa its, e wilw deletmirenP r(T )1 . 1. Markov1' sIenuqalti yW cen obaait n aewa bkonudon he ptobrailitb thyta tal eatsone of th eveens tA 1A2:::AN o ccur ssinug arMov'ks Teoremh :

第1页下一页