Probability Commons^™

Comparing North American Professional Sports League Season Formats Using Monte Carlo Simulation, Lathan Gregg

Industrial Engineering Undergraduate Honors Theses

Each NFL, NBA, and MLB season consists of a regular season, in which teams play a set number of scheduled games and a playoff, in which qualifying teams compete for a championship. At the conclusion of each season, teams are ranked based on their performance throughout the season. This study aims to investigate the ability of each league's season format to accurately rank teams using Monte Carlo simulation. Matches between two teams are simulated by using the team’s assigned strength ranks to calculate a winning probability for each team. The winning probabilities are simulated with different skill values, dictating how …

Statistical Modeling, Learning And Computing For Stochastic Dynamics Of Complex Systems, Mohammadmahdi Hajiha

Graduate Theses and Dissertations

With the recent advances in sensor technology, it is much easier to collect and store streams of system operational and environmental (SOE) data. These data can be used as input to model the underlying behavior of complex engineered systems and phenomenons if appropriate algorithms with well-defined assumptions are developed. This dissertation is comprised of the research work to show the applicability of SOE data when fed into proposed tailored algorithms. The first purposes of these algorithms are to estimate and analyze the reliability of a system as elaborated in Chapter 2. This chapter provides the derivation of closed-form expressions that …

Evaluating The Efficiency Of Markov Chain Monte Carlo Algorithms, Thuy Scanlon

Graduate Theses and Dissertations

Markov chain Monte Carlo (MCMC) is a simulation technique that produces a Markov chain designed to converge to a stationary distribution. In Bayesian statistics, MCMC is used to obtain samples from a posterior distribution for inference. To ensure the accuracy of estimates using MCMC samples, the convergence to the stationary distribution of an MCMC algorithm has to be checked. As computation time is a resource, optimizing the efficiency of an MCMC algorithm in terms of effective sample size (ESS) per time unit is an important goal for statisticians. In this paper, we use simulation studies to demonstrate how the Gibbs …

Knowledge Discovery From Complex Event Time Data With Covariates, Samira Karimi

Graduate Theses and Dissertations

In particular engineering applications, such as reliability engineering, complex types of data are encountered which require novel methods of statistical analysis. Handling covariates properly while managing the missing values is a challenging task. These type of issues happen frequently in reliability data analysis. Specifically, accelerated life testing (ALT) data are usually conducted by exposing test units of a product to severer-than-normal conditions to expedite the failure process. The resulting lifetime and/or censoring data are often modeled by a probability distribution along with a life-stress relationship. However, if the probability distribution and life-stress relationship selected cannot adequately describe the underlying failure …

Improving Bayesian Graph Convolutional Networks Using Markov Chain Monte Carlo Graph Sampling, Aneesh Komanduri

Computer Science and Computer Engineering Undergraduate Honors Theses

In the modern age of social media and networks, graph representations of real-world phenomena have become incredibly crucial. Often, we are interested in understanding how entities in a graph are interconnected. Graph Neural Networks (GNNs) have proven to be a very useful tool in a variety of graph learning tasks including node classification, link prediction, and edge classification. However, in most of these tasks, the graph data we are working with may be noisy and may contain spurious edges. That is, there is a lot of uncertainty associated with the underlying graph structure. Recent approaches to modeling uncertainty have been …

Effect Of Predictor Dependence On Variable Selection For Linear And Log-Linear Regression, Apu Chandra Das

Graduate Theses and Dissertations

We propose a Bayesian approach to the Dirichlet-Multinomial (DM) regression model, which uses horseshoe, Laplace, and horseshoe plus priors for shrinkage and selection. The Dirichlet-Multinomial model can be used to find the significant association between a set of available covariates and taxa for a microbiome sample. We incorporate the covariates in a log-linear regression framework. We design a simulation study to make a comparison among the performance of the three shrinkage priors in terms of estimation accuracy and the ability to detect true signals. Our results have clearly separated the performance of the three priors and indicated that the horseshoe …

Probabilistic Models For Order-Picking Operations With Multiple In-The-Aisle Pick Positions, Jingming Liu

Graduate Theses and Dissertations

The development of probability density functions (pdfs) for travel time of a narrow aisle lift truck (NALT) and an automated storage and retrieval (AS/R) machine is the focus of the dissertation. The multiple in-the-aisle pick positions (MIAPP) order picking system can be modeled as an M/G/1 queueing problem in which storage and retrieval requests are the customers and the vehicle (NALT or AS/R machine) is the server. Service time is the sum of travel time and the deterministic time to pick up and deposit a pallet (TPD).

Our first contribution is the development of travel time pdfs for retrieval operations …