Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Markov Chains

Discipline
Institution
Publication Year
Publication
Publication Type

Articles 1 - 12 of 12

Full-Text Articles in Physical Sciences and Mathematics

Statistical Models For Decision-Making In Professional Soccer, Sean Hellingman Jan 2023

Statistical Models For Decision-Making In Professional Soccer, Sean Hellingman

Theses and Dissertations (Comprehensive)

As soccer is widely regarded as the most popular sport in the world there is high interest in methods of improving team performances. There are many ways teams and individual athletes can influence their own performances during competition. This thesis focuses on developing statistical methodologies for improving competition-based decision-making for soccer so as to allow professional soccer teams to make better informed decisions regarding player selection and in-game decision-making.

To properly capture the dynamic actions of professional soccer, Markov chains with increasing complexity are proposed. These models allow for the inclusion of potential changes in the process caused by goals …


Conditional And Marginal Imputation Models For Multilevel Data, Gang Liu Aug 2021

Conditional And Marginal Imputation Models For Multilevel Data, Gang Liu

Legacy Theses & Dissertations (2009 - 2024)

This dissertation study extends sequential hierarchical regression imputation (SHRIMP) methods to multilevel datasets with three levels of nesting and proposes a marginal method based on marginalized multilevel model (MMM) framework. Specifically, the proposed model consists of two levels such that the first level relates the marginal mean of responses with covariates through a generalized regression model and the second level includes subject specific random effects within the same generalized regression model. To draw the inference on the population-averaged or subject-specified coefficients, the hierarchical regression and/or MMM is applied as the imputation and estimation models. We employ Markov Chain Monte Carlo …


Distributed Load Testing By Modeling And Simulating User Behavior, Chester Ira Parrott Dec 2020

Distributed Load Testing By Modeling And Simulating User Behavior, Chester Ira Parrott

LSU Doctoral Dissertations

Modern human-machine systems such as microservices rely upon agile engineering practices which require changes to be tested and released more frequently than classically engineered systems. A critical step in the testing of such systems is the generation of realistic workloads or load testing. Generated workload emulates the expected behaviors of users and machines within a system under test in order to find potentially unknown failure states. Typical testing tools rely on static testing artifacts to generate realistic workload conditions. Such artifacts can be cumbersome and costly to maintain; however, even model-based alternatives can prevent adaptation to changes in a system …


Importance Sampling Of Interval Markov Chains, Cyrille Jegourel, Jingyi Wang, Jun Sun Jun 2019

Importance Sampling Of Interval Markov Chains, Cyrille Jegourel, Jingyi Wang, Jun Sun

Research Collection School Of Computing and Information Systems

In real-world systems, rare events often characterize critical situations like the probability that a system fails within some time bound and they are used to model some potentially harmful scenarios in dependability of safety-critical systems. Probabilistic Model Checking has been used to verify dependability properties in various types of systems but is limited by the state space explosion problem. An alternative is the recourse to Statistical Model Checking (SMC) that relies on Monte Carlo simulations and provides estimates within predefined error and confidence bounds. However, rare properties require a large number of simulations before occurring at least once. To tackle …


Boundary Problems For One And Two Dimensional Random Walks, Miky Wright May 2015

Boundary Problems For One And Two Dimensional Random Walks, Miky Wright

Masters Theses & Specialist Projects

This thesis provides a study of various boundary problems for one and two dimensional random walks. We first consider a one-dimensional random walk that starts at integer-valued height k > 0, with a lower boundary being the x-axis, and on each step moving downward with probability q being greater than or equal to the probability of going upward p. We derive the variance and the standard deviation of the number of steps T needed for the height to reach 0 from k, by first deriving the moment generating function of T. We then study two types of two-dimensional random walks with …


Self-Reported Head Injury And Risk Of Late-Life Impairment And Ad Pathology In An Ad Center Cohort, Erin L. Abner, Peter T. Nelson, Frederick A. Schmitt, Steven R. Browning, David W. Fardo, Lijie Wan, Gregory A. Jicha, Gregory E. Cooper, Charles D. Smith, Allison M. Caban-Holt, Linda J. Van Eldik, Richard J. Kryscio Jun 2014

Self-Reported Head Injury And Risk Of Late-Life Impairment And Ad Pathology In An Ad Center Cohort, Erin L. Abner, Peter T. Nelson, Frederick A. Schmitt, Steven R. Browning, David W. Fardo, Lijie Wan, Gregory A. Jicha, Gregory E. Cooper, Charles D. Smith, Allison M. Caban-Holt, Linda J. Van Eldik, Richard J. Kryscio

Sanders-Brown Center on Aging Faculty Publications

Aims: To evaluate the relationship between self-reported head injury and cognitive impairment, dementia, mortality, and Alzheimer's disease (AD)-type pathological changes. Methods: Clinical and neuropathological data from participants enrolled in a longitudinal study of aging and cognition (n = 649) were analyzed to assess the chronic effects of self-reported head injury. Results: The effect of self-reported head injury on the clinical state depended on the age at assessment: for a 1-year increase in age, the OR for the transition to clinical mild cognitive impairment (MCI) at the next visit for participants with a history of head injury was 1.21 and 1.34 …


A Topics Analysis Model For Health Insurance Claims, Jared Anthony Webb Oct 2013

A Topics Analysis Model For Health Insurance Claims, Jared Anthony Webb

Theses and Dissertations

Mathematical probability has a rich theory and powerful applications. Of particular note is the Markov chain Monte Carlo (MCMC) method for sampling from high dimensional distributions that may not admit a naive analysis. We develop the theory of the MCMC method from first principles and prove its relevance. We also define a Bayesian hierarchical model for generating data. By understanding how data are generated we may infer hidden structure about these models. We use a specific MCMC method called a Gibbs' sampler to discover topic distributions in a hierarchical Bayesian model called Topics Over Time. We propose an innovative use …


Investigating Graph Clustering For The Power Grid, Gabriela Radu, Emilie Hogan Aug 2013

Investigating Graph Clustering For The Power Grid, Gabriela Radu, Emilie Hogan

STAR Program Research Presentations

Given time series data from multiple power generators containing measurements of phase angle taken at many points in time. The goal is to cluster together generators which have similar phase angle behavior.

In order to achieve this goal, Fast Fourier Transforms and Euclidean distances were used to quantify similarities between generators. A graph was created in which two generators were connected if they were sufficiently similar (known as a nearest neighbor graph). Using different nearest neighbor values, matrices were generated based on similarities between generators. Specific time intervals were taken from the large data set to assess the time dependency …


Spectral Analysis Of Randomly Generated Networks With Prescribed Degree Sequences, Clifford Davis Gaddy Jan 2013

Spectral Analysis Of Randomly Generated Networks With Prescribed Degree Sequences, Clifford Davis Gaddy

Theses and Dissertations

Network science attempts to capture real-world phenomenon through mathematical models. The underlying model of a network relies on a mathematical structure called a graph. Having seen its early beginnings in the 1950's, the field has seen a surge of interest over the last two decades, attracting interest from a range of scientists including computer scientists, sociologists, biologists, physicists, and mathematicians. The field requires a delicate interplay between real-world modeling and theory, as it must develop accurate probabilistic models and then study these models from a mathematical perspective. In my thesis, we undertake a project involving computer programming in which we …


Generalized Crowding For Genetic Algorithms, Ole J. Mengshoel, Severino F. Galan Jun 2010

Generalized Crowding For Genetic Algorithms, Ole J. Mengshoel, Severino F. Galan

Ole J Mengshoel

Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offspring with a similar individual in the current population (pairing phase) and deciding which of the two will remain in the population (replacement phase). The present work focuses on the replacement phase of crowding, which usually has been carried out by one of the following three approaches: Deterministic, Probabilistic, and Simulated Annealing. These approaches present some limitations regarding the way replacement is conducted. On the one hand, the first two apply the same …


Understanding The Role Of Noise In Stochastic Local Search: Analysis And Experiments, Ole J. Mengshoel Apr 2008

Understanding The Role Of Noise In Stochastic Local Search: Analysis And Experiments, Ole J. Mengshoel

Ole J Mengshoel

Stochastic local search (SLS) algorithms have recently been proven to be among the best approaches to solving computationally hard problems. SLS algorithms typically have a number of parameters, optimized empirically, that characterize and determine their performance. In this article, we focus on the noise parameter. The theoretical foundation of SLS, including an understanding of how to the optimal noise varies with problem difficulty, is lagging compared to the strong empirical results obtained using these algorithms. A purely empirical approach to understanding and optimizing SLS noise, as problem instances vary, can be very computationally intensive. To complement existing experimental results, we …


Analysis Of Case Histories By Markov Chains Using Juvenile Court Data Of State Of Utah, Soo-Hong Uh May 1973

Analysis Of Case Histories By Markov Chains Using Juvenile Court Data Of State Of Utah, Soo-Hong Uh

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The purpose of this paper is to analyze juvenile court data using Markov Chains. A computer program was generalized with a single array orientation for analyzing realizations of a Markov Chain to the kth order within machine limitations. The data used in this paper were gathered by the Juvenile Court of the State of Utah for administrative purposes and limited to District II. The results from the paper, "Statistical Inference About Markov Chains" by Anderson and Goodman, were applied for testing hypotheses. The paper is divided into five chapters: introduction, statistical background, methodology, analysis and summary, conclusions.