dc.contributor.advisor | Beneš, Viktor | |
dc.creator | Kocúrová, Barbora | |
dc.date.accessioned | 2017-03-29T13:24:16Z | |
dc.date.available | 2017-03-29T13:24:16Z | |
dc.date.issued | 2006 | |
dc.identifier.uri | http://hdl.handle.net/20.500.11956/5821 | |
dc.description.abstract | Na/ev praee: Coxfiv bodovy Autor: Barbara Kocnrova Katedra (ust.av): KalodrM pravdepodolmosli a uiatematicke statisiiky Vedonci bakalafske praee: Prof. KNDr. Viktor Beries, DrSe. e-mail vedonciho: Vikl nr.Benesviinlf.cuiti.e/ Abstrakt: V paidiozcur pr;ici st.ndujoinr bodovo prfjcesy. XabyvAine sr siniulac:i a, fil- trovannii Coxova bodovrlio proccsu ri/onclio Gauniia Onistehi-UhlonbeekovytTi jiro- tics^in. K odhadu uahodiir int.cn/ity C'oxova. pi'occsn jsnio zvolili bayesovsky jn'isiup s vynxitiui melody Mai'kov C'liain KJoiit.c C'urlo a Metrupolis-Hastiiigsova algoritinu rox(Mii a /.anikii pro bodovc Tit.k1: Cox point process Author: Harbora Kocnrova Dcparlinont: Dcpartinctit of Probability and Mnthrmatioa.j Statistics Supervisor: Prof. RiNDr. Viktor Hours, DrSc. Supervisor's e-uiail address Viktor.Benesf'inff.eniLi.c^ Abstract: hi the present work the spatial point processes, particularly Cox point pro- cess driven by Ganiina-Ornstoiu Uhlenberk process is studied. We also discuss how to simulate this Cox process and the tittering problem. To obtain the efficient [ilrored value we consider a Bayesiaii inference with using Markov C'liain Moult; Carlo me- thods and Birth-death Metropolis-Hastings algorithm. | en_US |
dc.description.abstract | Na/ev praee: Coxfiv bodovy Autor: Barbara Kocnrova Katedra (ust.av): KalodrM pravdepodolmosli a uiatematicke statisiiky Vedonci bakalafske praee: Prof. KNDr. Viktor Beries, DrSe. e-mail vedonciho: Vikl nr.Benesviinlf.cuiti.e/ Abstrakt: V paidiozcur pr;ici st.ndujoinr bodovo prfjcesy. XabyvAine sr siniulac:i a, fil- trovannii Coxova bodovrlio proccsu ri/onclio Gauniia Onistehi-UhlonbeekovytTi jiro- tics^in. K odhadu uahodiir int.cn/ity C'oxova. pi'occsn jsnio zvolili bayesovsky jn'isiup s vynxitiui melody Mai'kov C'liain KJoiit.c C'urlo a Metrupolis-Hastiiigsova algoritinu rox(Mii a /.anikii pro bodovc Tit.k1: Cox point process Author: Harbora Kocnrova Dcparlinont: Dcpartinctit of Probability and Mnthrmatioa.j Statistics Supervisor: Prof. RiNDr. Viktor Hours, DrSc. Supervisor's e-uiail address Viktor.Benesf'inff.eniLi.c^ Abstract: hi the present work the spatial point processes, particularly Cox point pro- cess driven by Ganiina-Ornstoiu Uhlenberk process is studied. We also discuss how to simulate this Cox process and the tittering problem. To obtain the efficient [ilrored value we consider a Bayesiaii inference with using Markov C'liain Moult; Carlo me- thods and Birth-death Metropolis-Hastings algorithm. | cs_CZ |
dc.language | Čeština | cs_CZ |
dc.language.iso | cs_CZ | |
dc.publisher | Univerzita Karlova, Matematicko-fyzikální fakulta | cs_CZ |
dc.title | Coxův bodový proces | cs_CZ |
dc.type | bakalářská práce | cs_CZ |
dcterms.created | 2006 | |
dcterms.dateAccepted | 2006-06-27 | |
dc.description.department | Katedra pravděpodobnosti a matematické statistiky | cs_CZ |
dc.description.department | Department of Probability and Mathematical Statistics | en_US |
dc.description.faculty | Matematicko-fyzikální fakulta | cs_CZ |
dc.description.faculty | Faculty of Mathematics and Physics | en_US |
dc.identifier.repId | 42966 | |
dc.title.translated | Cox point process | en_US |
dc.contributor.referee | Lechnerová, Radka | |
dc.identifier.aleph | 000833317 | |
thesis.degree.name | Bc. | |
thesis.degree.level | bakalářské | cs_CZ |
thesis.degree.discipline | General Mathematics | en_US |
thesis.degree.discipline | Obecná matematika | cs_CZ |
thesis.degree.program | Mathematics | en_US |
thesis.degree.program | Matematika | cs_CZ |
uk.thesis.type | bakalářská práce | cs_CZ |
uk.taxonomy.organization-cs | Matematicko-fyzikální fakulta::Katedra pravděpodobnosti a matematické statistiky | cs_CZ |
uk.taxonomy.organization-en | Faculty of Mathematics and Physics::Department of Probability and Mathematical Statistics | en_US |
uk.faculty-name.cs | Matematicko-fyzikální fakulta | cs_CZ |
uk.faculty-name.en | Faculty of Mathematics and Physics | en_US |
uk.faculty-abbr.cs | MFF | cs_CZ |
uk.degree-discipline.cs | Obecná matematika | cs_CZ |
uk.degree-discipline.en | General Mathematics | en_US |
uk.degree-program.cs | Matematika | cs_CZ |
uk.degree-program.en | Mathematics | en_US |
thesis.grade.cs | Výborně | cs_CZ |
thesis.grade.en | Excellent | en_US |
uk.abstract.cs | Na/ev praee: Coxfiv bodovy Autor: Barbara Kocnrova Katedra (ust.av): KalodrM pravdepodolmosli a uiatematicke statisiiky Vedonci bakalafske praee: Prof. KNDr. Viktor Beries, DrSe. e-mail vedonciho: Vikl nr.Benesviinlf.cuiti.e/ Abstrakt: V paidiozcur pr;ici st.ndujoinr bodovo prfjcesy. XabyvAine sr siniulac:i a, fil- trovannii Coxova bodovrlio proccsu ri/onclio Gauniia Onistehi-UhlonbeekovytTi jiro- tics^in. K odhadu uahodiir int.cn/ity C'oxova. pi'occsn jsnio zvolili bayesovsky jn'isiup s vynxitiui melody Mai'kov C'liain KJoiit.c C'urlo a Metrupolis-Hastiiigsova algoritinu rox(Mii a /.anikii pro bodovc Tit.k1: Cox point process Author: Harbora Kocnrova Dcparlinont: Dcpartinctit of Probability and Mnthrmatioa.j Statistics Supervisor: Prof. RiNDr. Viktor Hours, DrSc. Supervisor's e-uiail address Viktor.Benesf'inff.eniLi.c^ Abstract: hi the present work the spatial point processes, particularly Cox point pro- cess driven by Ganiina-Ornstoiu Uhlenberk process is studied. We also discuss how to simulate this Cox process and the tittering problem. To obtain the efficient [ilrored value we consider a Bayesiaii inference with using Markov C'liain Moult; Carlo me- thods and Birth-death Metropolis-Hastings algorithm. | cs_CZ |
uk.abstract.en | Na/ev praee: Coxfiv bodovy Autor: Barbara Kocnrova Katedra (ust.av): KalodrM pravdepodolmosli a uiatematicke statisiiky Vedonci bakalafske praee: Prof. KNDr. Viktor Beries, DrSe. e-mail vedonciho: Vikl nr.Benesviinlf.cuiti.e/ Abstrakt: V paidiozcur pr;ici st.ndujoinr bodovo prfjcesy. XabyvAine sr siniulac:i a, fil- trovannii Coxova bodovrlio proccsu ri/onclio Gauniia Onistehi-UhlonbeekovytTi jiro- tics^in. K odhadu uahodiir int.cn/ity C'oxova. pi'occsn jsnio zvolili bayesovsky jn'isiup s vynxitiui melody Mai'kov C'liain KJoiit.c C'urlo a Metrupolis-Hastiiigsova algoritinu rox(Mii a /.anikii pro bodovc Tit.k1: Cox point process Author: Harbora Kocnrova Dcparlinont: Dcpartinctit of Probability and Mnthrmatioa.j Statistics Supervisor: Prof. RiNDr. Viktor Hours, DrSc. Supervisor's e-uiail address Viktor.Benesf'inff.eniLi.c^ Abstract: hi the present work the spatial point processes, particularly Cox point pro- cess driven by Ganiina-Ornstoiu Uhlenberk process is studied. We also discuss how to simulate this Cox process and the tittering problem. To obtain the efficient [ilrored value we consider a Bayesiaii inference with using Markov C'liain Moult; Carlo me- thods and Birth-death Metropolis-Hastings algorithm. | en_US |
uk.file-availability | V | |
uk.publication.place | Praha | cs_CZ |
uk.grantor | Univerzita Karlova, Matematicko-fyzikální fakulta, Katedra pravděpodobnosti a matematické statistiky | cs_CZ |
dc.identifier.lisID | 990008333170106986 | |