Essays about: "Markov Chain"
Showing result 1 - 5 of 126 essays containing the words Markov Chain.
-
1. Branching Out with Mixtures: Phylogenetic Inference That’s Not Afraid of a Little Uncertainty
University essay from KTH/Matematisk statistikAbstract : Phylogeny, the study of evolutionary relationships among species and other taxa, plays a crucial role in understanding the history of life. Bayesian analysis using Markov chain Monte Carlo (MCMC) is a widely used approach for inferring phylogenetic trees, but it suffers from slow convergence in higher dimensions and is slow to converge. READ MORE
-
2. Stock market analysis with a Markovian approach: Properties and prediction of OMXS30
University essay from KTH/Matematisk statistikAbstract : This paper investigates how Markov chain modelling can be applied to the Swedish stock index OMXS30. The investigation is two-fold. Firstly, a Markov chain is based on index data from recent years, where properties such as transition matrix, stationary distribution and hitting time are studied. READ MORE
-
3. On Predicting Price Volatility from Limit Order Books
University essay from Uppsala universitet/Matematiska institutionenAbstract : Accurate forecasting of stock price movements is crucial for optimizing trade execution and mitigating risk in automated trading environments, especially when leveraging Limit Order Book (LOB) data. However, developing predictive models from LOB data presents substantial challenges due to its inherent complexities and high-frequency nature. READ MORE
-
4. Optimal Order Placement Using Markov Models of Limit Order Books
University essay from KTH/Matematik (Avd.)Abstract : We study optimal order placement in a limit order book. By modelling the limit order book dynamics as a Markov chain, we can frame the purchase of a single share as a Markov Decision Process. Within the framework of the model, we can estimate optimal decision policies numerically. The trade rate is varied using a running cost control variable. READ MORE
-
5. GPU-Based Path Optimization Algorithm in High-Resolution Cost Map with Kinodynamic Constraints : Using Non-Reversible Parallel Tempering
University essay from Karlstads universitet/Fakulteten för hälsa, natur- och teknikvetenskap (from 2013)Abstract : This thesis introduces a GPU-accelerated algorithm for path planning under kinodynamic constraints, focusing on navigation of flying vehicles within a high-resolution cost map. The algorithm operates by creating dynamically feasible initial paths, and a non-reversible parallel tempering Markov chain Monte Carlo scheme to optimize the paths while adhering to the nonholonomic kinodynamical constraints. READ MORE