Sökning: "Markov chain Monte Carlo"
Visar resultat 6 - 10 av 79 avhandlingar innehållade orden Markov chain Monte Carlo.
6. Rare-event simulation with Markov chain Monte Carlo
Sammanfattning : Stochastic simulation is a popular method for computing probabilities or expecta- tions where analytical answers are difficult to derive. It is well known that standard methods of simulation are inefficient for computing rare-event probabilities and there- fore more advanced methods are needed to those problems. LÄS MER
7. Correct and Efficient Monte Carlo Inference for Universal Probabilistic Programming Languages
Sammanfattning : Probabilistic programming languages (PPLs) allow users to express statistical inference problems that the PPL implementation then, ideally, solves automatically. In particular, PPL users can focus on encoding their inference problems, and need not concern themselves with the intricacies of inference. LÄS MER
8. Particle filters and Markov chains for learning of dynamical systems
Sammanfattning : Sequential Monte Carlo (SMC) and Markov chain Monte Carlo (MCMC) methods provide computational tools for systematic inference and learning in complex dynamical systems, such as nonlinear and non-Gaussian state-space models. This thesis builds upon several methodological advances within these classes of Monte Carlo methods. LÄS MER
9. On Bayesian graphical model determination
Sammanfattning : A graphical model specifies a graph representation of the independence structure of a multivariate distribution, where nodes represent variables and edges association between variables.This thesis introduces methodology for determination of graphical models for multivariate distributions within the exponential family. LÄS MER
10. Modelling Allelic and DNA Copy Number Variations using Continuous-index Hidden Markov Models
Sammanfattning : In human cells there are usually two copies of each chromosome, but in cancer cells abnormalities could exist. The differences consist of segments of chromosomes with an altered number of copies. There can be deletions as well as amplifications and the lengths of the segments can also vary. LÄS MER