Please use this identifier to cite or link to this item:
Title: Evolució dels algorismes MCMC i la seva implementació en programació probabilı́stica
Author: Rosich Solé, Cristina
Director/Tutor: Vitrià i Marca, Jordi
Keywords: Algorismes computacionals
Treballs de fi de grau
Llenguatges de programació
Processos de Markov
Mètode de Montecarlo
Empreses familiars
Computer algorithms
Bachelor's thesis
Programming languages (Electronic computers)
Markov processes
Monte Carlo method
Family-owned business enterprises
Issue Date: 27-Jun-2018
Abstract: [en] The first goal of this paper is to explain how the Markov Chain Monte Carlo algorithms were born and follow their evolution throughout the 20th century to the present day. Firstly, we are going to discuss different types of MCMC algorithms and explain how they were created, and secondly, we are going to introduce the large amount of different applications they have. The other main goal is analyze their implementation in the field of programming, which has resulted in the creation of several probabilistic programming languages, and use them in a real case in which we are going to examine the client flow of a certain company.
Note: Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2018, Director: Jordi Vitrià i Marca
Appears in Collections:Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
memoria.pdfMemòria2.84 MBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons