Probability Commons^™

Criticality In A Heterogeneous Neutron Transport Rod Model, Samuel Kaleb Crowford

All Graduate Reports and Creative Projects, Fall 2023 to Present

This work studies the stochastic behavior of neutron populations in a one-dimensional rod model using Monte Carlo simulation. The first part of this project reproduces the computational results of Dumonteil, Horton, Kyprianou, and Zoia (2025) by independently implementing the Monte Carlo algorithm described in their article, with the asymptotic behavior of the first moment analyzed in relation to the dominant eigenvalue and adjoint eigenfunction of the neutron transport operator. The model is then extended to a heterogeneous setting by introducing a central region where fission is suppressed. A global expectation over initial positions and directions is used to estimate the …

(R2077) Enhancing Queue Management: Dynamic Server Allocation And Optional Services In Stochastic Modeling, G. Ayyappan, S. Sankeetha

Applications and Applied Mathematics: An International Journal (AAM)

Consider a queueing system with a single server, where customer arrivals follow a Markovian arrival process and service times follow a phase-type distribution. The main server has the capability to recruit an additional server when the number of customers in the system exceeds a certain threshold, denoted as L. Both servers provide normal service to customers, and optional service is provided upon request. The main server takes multiple vacations, with the durations following an exponential distribution with rate parameter η, until there is at least one customer in the system. This system can be represented as a Markov chain process, …

(R2072) A Method To Sample From Transition Densities Of Diffusion Processes With Unknown Densities, Yasin Kikabi, Juma Kasozi

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, we present a reliable method that can be used to sample paths of a diffusion process described by a system of stochastic differential equations. These are types of processes whose transition density is not known in closed form. This reliable method involves solving a partial differential equation of the Fokker-Planck type by rejection sampling techniques applied to the associated densities. We then use the novel method to sample from the Ornstein-Uhlenbeck (OU) process whose transition density is known and has unbounded drift. The results obtained compare excellently with the analytical results, thus rendering the method reliable and …

Conditional Product Sampling For Gaussian Process Implicit Surfaces, Song Shi

Dartmouth College Master’s Theses

Gaussian Process Implicit Surfaces (GPISes) provide a powerful and unified stochastic geometry representation for rendering surfaces, volumes, and the rich continuum between them. Recent work has shown that GPISes can model a broad space of visual appearances under a unified light transport framework. However, practical rendering with GPISes remains challenging: existing estimators can become inefficient for particular correlation structures, and highly anisotropic or heightfield-like GPISes require specialized treatment to obtain robust variance reduction.

This thesis extends recent work on GPIS rendering by introducing a new next-event estimation (NEE) technique for anisotropic GPISes.We show that standard NEE provides diminishing benefits as …

A New Approach To Generate Combinatorial Patterns In Logical Analysis Of Data And Its Application To Predict College Retention, Salihah Ahmed E. Jaafari

Theses and Dissertations

Student retention and degree completion remain central challenges for higher-education institutions, with significant implications for student success, institutional effectiveness, and public accountability. While advances in predictive analytics have enabled earlier identification of students at risk of withdrawal, many commonly used machine learning approaches suffer from limited interpretability, constraining their practical usefulness for advising, intervention, and policy decision making. This dissertation addresses the problem of predicting student persistence by developing and evaluating optimization based, interpretable classification models within the Logical Analysis of Data (LAD) framework. Building on existing LAD formulations, this research introduces two novel pattern generation models, the Best Term …

Irreversible K-Threshold Dynamics On Corona And Base-B Corona Product Graphs, Eric J. Moon, Soumya Bhoumik, Paul Flesher

SACAD: Scholarly Activities

This poster studies the irreversible k-threshold process on corona-type graph products, where a vertex becomes colored once at least k of its neighbors are colored and then remains colored permanently. We focus on corona, double corona, and base-b corona product graphs built from cycles and complete graphs, with particular attention to how graph structure affects complete activation from a minimum seed set.

A generalized reduction lemma is used to relate threshold dynamics on layered corona graphs to smaller residual graphs, yielding explicit formulas for the irreversible k-threshold conversion number on both corona and double corona families. The …

Inhomogeneous Branching Random Walks: Incorporating Genealogy And Density Effects, Lauren Ajax, Beatrice Durham, Pratima Hebbar, Cade Johnston, Jiayi Zhang

Spora: A Journal of Biomathematics

We introduce a novel framework using inhomogeneous branching random walks (BRWs) to model biological processes, specifically by introducing genealogy-dependence in branching rates and displacement distributions to model bacterial colony growth. Current stochastic models often either assume independent and identical behavior of individual agents or incorporate only spatiotemporal inhomogeneity, ignoring the effect of genealogy-based inhomogeneity on the long-time behavior of these processes. Such asymptotics are of independent mathematical interest and are crucial in understanding the emergence of patterns. We propose several inhomogeneous BRW models in 2D space where displacement distributions and branching rates vary with time, space, and genealogy. A combined …

All Games Have Equilibria, M. Ali Khan, Arthur Paul Pedersen, Maxwell B. Stinchcombe

Publications and Research

Research on Nash equilibrium existence for infinite games has grown into a patchwork of technical preconditions and counterexamples. This paper presents a unified program in equilibrium theory by revising the predominant model of mixed strategies based on countable additivity. A game is specified by a nonempty set of players and, for each player, a nonempty action set and a bounded von Neumann-Morgenstern utility function. Every such game is shown to admit a Nash equilibrium in finitely additive mixed strategies. In addition, the equilibrium correspondence for any such game is shown to be nonempty, compact-valued, and upper hemicontinuous, and the same …

All Games Have Equilibria, Arthur Paul Pedersen, M. Ali Khan, Maxwell B. Stinchcombe

Publications and Research

Research on Nash equilibrium existence for infinite games has grown into a patchwork of technical preconditions and counterexamples. This paper presents a unified program in equilibrium theory by revising the predominant model of mixed strategies based on countable additivity. A game is specified by a nonempty set of players and, for each player, a nonempty action set and a bounded von Neumann-Morgenstern utility function. Every such game is shown to admit a Nash equilibrium in finitely additive mixed strategies. In addition, the equilibrium correspondence for any such game is shown to be nonempty, compact-valued, and upper hemicontinuous, and the same …

A Leslie System For A Demographic Simulation: From An Actuarial Point Of View, David Kings

Electronic Theses and Dissertations

This thesis develops a discrete stochastic linear systems interpretation of age–stage demographic evolution grounded in Leslie operators and realized in a discrete-event simulation implemented with salabim. The central claim is that one annual cycle of the simulation constitutes a cone-preserving, stochastic affine transformation on a high- dimensional population state vector indexed by age, sex, marital status, household type, employment, and education, and that the composition of yearly operators yields a random matrix product whose top Lyapunov exponent is the stochastic counterpart of the Perron–Frobenius growth rate (Caswell, 2001; Tuljapurkar, 1997)[1, 2]. The actuarial bridge is constructed by mapping simulated survival …

The Odds Don’T Lie: Mathematical Reasoning And Societal Ignorance In Don’T Look Up, Nysa Vedwan, Shane Carey

LASER Journal

In Adam McKay’s 2021 satirical sci-fi movie Don’t Look Up, two astronomers discover a comet heading directly toward Earth. Despite overwhelming evidence and near-certainty of global extinction, their warnings are ignored and ridiculed. This paper discusses the mathematical and scientific foundations of the movie’s social and political reception, and specifically focuses on orbital prediction and probabilistic modeling as they relate to public understanding of risk. This paper shows how data is often undermined by political and social dynamics, by connecting the fictional events of the movie with real-world crises like the COVID-19 pandemic and the climate emergency. In Don’t Look …

On The H-Property For Step-Graphons: Residual Case, Wanting Gao

McKelvey School of Engineering Graduate Student Theses & Dissertations

We investigate the H-property for step-graphons. Specifically, we sample graphs Gn on n nodes from a step-graphon and evaluate the probability that Gn has a Hamiltonian decomposition in the asymptotic regime as n → ∞. It has been shown in Belabbas and Chen (2023); Belabbas et al. (2021) that for almost all step-graphons, this probability converges to either zero or one. We focus in this paper on the residual case where the zero-one law does not apply. We show that the limit of the probability still exists and provide an explicit expression of it. We present a complete proof of …

Decoding The Algorithm: The Mathematics Behind Tiktok’S Short-Form Content Success, Ashley N. Lynch

Honors Scholar Theses

Within the realm of social networks, TikTok has become the central hub for short-form video content. The network’s unique ability to capture individual preferences using predictive analytics has greatly contributed to its massive success, allowing the company to optimize its performance and content personalization. In an age where digital media have such a significant influence on society, it is essential that users develop an understanding of how social network algorithms function to make more informed online decisions. Although TikTok’s technological system is primarily undisclosed, the platform certifiably leverages several key mathematical principles within its algorithm to achieve its core goals …

Irreversible K-Threshold Number Ck(G) And Saturation Probability P[G] For Corona Product And Double Corona Product Graphs, Eric J. Moon, Soumya Bhoumik, Paul Flesher

SACAD: Scholarly Activities

We discuss the Irreversible k-conversion process for graphs, where a vertex becomes saturated and remains saturated indefinitely if at least k of its neighbors are saturated. We investigate sets S₀, which when initially saturated, lead to complete graph saturation. We are interested in the minimum |S₀| = C_k(G), called the k-threshold number. We consider the construction of the Corona Product Graphs (of C_n and K_p). Additionally, we extend our analysis by defining and exploring Double Corona Product Graphs (of C_n and K_p). Then we incorporate …

Optimizing Decision-Making In A Cerebral Palsy Model Using Reinforcement Learning, Richard Ampah

Pitzer Senior Theses

This study presents an original interdisciplinary investigation into how reinforcement learning (RL) can model motor and cognitive defects and potentially improve motor and cognitive functions in individuals with cerebral palsy (CP), a non-progressive neurological disorder that impairs movement and adaptability. Integrating computational neuroscience and machine learning, the research applies policy gradient methods and Markov Decision Processes (MDPs) to simulate adaptive learning in agents with and without CP-related constraints.

The central aim is to compare the cumulative rewards of optimal policies, derived from value iteration, and human-like learning policies using the REINFORCE algorithm, both with and without the Bellman baseline. The …

Theory And Applications Surrounding Markov Chains, Joseph J. Quisito Jr., Gallean Brown, Elijah Yoder

Capstone Showcase

This capstone project explores the Markov Chain – a mathematical model used to describe systems that transition between states based on probabilities. It begins by introducing the fundamental concepts, including transition matrices, state classifications, and stationary distributions. The paper then applies Markov Chain theory to real-world scenarios, such as simulating Snakes and Ladders games, predicting soccer match outcomes for Manchester United, and generating texts from movie lines. Finally, it discusses key findings, challenges, and potential areas for future research in the field.

Solvability Of Stochastic Linear-Quadratic Optimal Control Problems Under Partial Stabilizability Conditions, Al-Sadh Rahman Imadh

Honors Undergraduate Theses

Optimal Control Theory, a branch of Control Theory, is applicable in fields such as engineering, operations research, and economics. Stochastic Optimal Control deals with noisy systems and data using Ito’s formulation. Given a noisy system and a cost functional, the goal is to find a control that will minimize the cost. This thesis focuses on linear quadratic stochastic optimal control, and we explore state equations that are not stabilizable. We first address measurability concerns arising from the semigroup property of the state trajectory. The notions of partial stability and partial stabilizability are introduced, and we formulate their corresponding Lyapunov and …

Theory And Algorithms To Learn, Propagate, And Exploit Uncertainty For Stochastic Optimal Control Of Dynamical Systems, Vignesh Sivaramakrishnan

Electrical and Computer Engineering ETDs

Non-Gaussian uncertainty frequently arises in learning and control problems involving stochastic dynamical systems, particularly in autonomous vehicles, UAVs, satellites, and robotics. In this dissertation, we propose a new framework that leverages characteristic functions that provides a frequency-domain representation of random variables. The dissertation is structured into three key areas. First, we address model-based stochastic optimal control for linear systems with non-Gaussian noise, demonstrating that characteristic functions can be used to enforce chance constraints and control systems toward desired distributions. Second, we explore data-driven stochastic control, utilizing empirical characteristic functions to handle systems with unknown disturbances. In addition, we derive several …

(R2098) Dynamic Analysis Of Stochastic Leslie-Gower Biological Predator-Prey Model With Prey Cannibalism, Sada Nand Prasad, Itendra Kumar Universiry Of Delhi, India, Pawan Kumar

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, we study the dynamical analysis of a stochastic Leslie–Gower biological predator– prey model. Earlier, the Leslie–Gower model was studied in the context of biological systems, including cases involving cannibalism. In our model, we investigate the dynamic properties of a stochastic Leslie–Gower predator–prey ecological system using the stability of invariant measures on invariant sets, where the invariant measures are shown to be ergodic. We also conduct a threshold analysis to study the stochastic persistence and extinction of species. Stochastic bifurcation is also examined. The theoretical results are supported by numerical simulations and examples. Intra-species competition is considered and …

Early Ctdna Kinetics As A Dynamic Biomarker Of Cancer Treatment Response, Aaron Li, Emil Lou, Kevin Leder, Jasmine Foo

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

Learning Problems Related To Stochastic Differential Equations, Jinpu Zhou

LSU Doctoral Dissertations

Stochastic differential equations (SDEs) are essential for modeling systems influenced by both deterministic dynamics and random fluctuations, with applications in a wide variety of disciplines. This thesis develops a Bayesian framework for nonparametric learning in SDEs, addressing key challenges in inference, particularly when dealing with complex systems and incomplete data. The thesis begins by establishing a theoretical foundation in optimization over Hilbert spaces, including a generalized representer theorem to address infinite-dimensional optimization problems encountered in nonparametric inference. Building on this, we introduce a Bayesian framework with shrinkage priors to learn drift functions from high-frequency data. Bayesian approach incorporates low-cost sparse …

Time Scale Separation In Life-Long Ovarian Follicles Population Dynamics Model, Romain Yvinec, Frédérique Clément, Guillaume Ballif

Biology and Medicine Through Mathematics Conference

No abstract provided.

Multi-Type Branching Processes In Time-Varying Environments, Arash Jamshidpey

Biology and Medicine Through Mathematics Conference

No abstract provided.

Stability Of Predator-Prey Model For Worm Attack In Wireless Sensor Networks, Rajeev Kishore, Padam Singh

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, we propose a predator-prey mathematical model for analyzing the dynamical behaviors of the system. This system is an epidemic model, and it is capable of ascertaining the worm's spreading at the initial stage and improving the security of wireless sensor networks. We investigate different fixed points and examine the stability of the projected model.

Optimizing Sports Outcome Prediction Through Feature Engineering And Machine Learning, Vitor S. Freitas

Graduate Theses/Dissertations

The challenge of predicting the outcome of a team game lies in the high complexity and dynamics of the sports data. This thesis focuses on the aspect of using feature engineering and the genetic algorithm to predict the winner and the score of various sports events. Generally, it deals with how machine learning algorithms are combined with state-of-the-art feature engineering techniques in sports datasets derived from various sports disciplines. In this thesis, five different machine learning models have been applied, classification and regression trees (CART), random forest (RF), stochastic gradient boosting (SGB), eXtreme gradient boosting (XGBoost), and extreme learning machine …

Last Passage Time And Excursion Theory For Solvable Diffusions With Applications In Mathematical Finance, Yaode Sui

Theses and Dissertations (Comprehensive)

In this dissertation, we investigate the properties of last passage times and excursion theory in one-dimensional solvable diffusions, emphasizing their applications in financial modeling, particularly in option pricing. We derive closed-form formulas for the marginal distribution of last passage times and their joint distribution with process values, including the maximum and minimum of the process value. The focus is on time-homogeneous diffusions with various boundaries and imposed killing. Employing spectral expansion theory, we derive explicit formulas for distributions of last passage times in common processes such as Drifted Brownian Motion (BM), Squared Bessel (SQB), Ornstein-Uhlenbeck (OU), and Cox-Ingersoll-Ross (CIR) models. …

Multiscale Modelling Of Brain Networks And The Analysis Of Dynamic Processes In Neurodegenerative Disorders, Hina Shaheen

Theses and Dissertations (Comprehensive)

The complex nature of the human brain, with its intricate organic structure and multiscale spatio-temporal characteristics ranging from synapses to the entire brain, presents a major obstacle in brain modelling. Capturing this complexity poses a significant challenge for researchers. The complex interplay of coupled multiphysics and biochemical activities within this intricate system shapes the brain's capacity, functioning within a structure-function relationship that necessitates a specific mathematical framework. Advanced mathematical modelling approaches that incorporate the coupling of brain networks and the analysis of dynamic processes are essential for advancing therapeutic strategies aimed at treating neurodegenerative diseases (NDDs), which afflict millions of …

Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia

Journal of Nonprofit Innovation

Urban farming can enhance the lives of communities and help reduce food scarcity. This paper presents a conceptual prototype of an efficient urban farming community that can be scaled for a single apartment building or an entire community across all global geoeconomics regions, including densely populated cities and rural, developing towns and communities. When deployed in coordination with smart crop choices, local farm support, and efficient transportation then the result isn’t just sustainability, but also increasing fresh produce accessibility, optimizing nutritional value, eliminating the use of ‘forever chemicals’, reducing transportation costs, and fostering global environmental benefits.

Imagine Doris, who is …

Exploration And Statistical Modeling Of Profit, Caleb Gibson

Undergraduate Honors Theses

For any company involved in sales, maximization of profit is the driving force that guides all decision-making. Many factors can influence how profitable a company can be, including external factors like changes in inflation or consumer demand or internal factors like pricing and product cost. Understanding specific trends in one's own internal data, a company can readily identify problem areas or potential growth opportunities to help increase profitability.

In this discussion, we use an extensive data set to examine how a company might analyze their own data to identify potential changes the company might investigate to drive better performance. Based …

Stochastic Optimal Control Of Conditional Mckean-Vlasov Equations With Jump And Markovian Switching, Charles Samuel Conly Sharp

Theses and Dissertations

This thesis obtains a number of results in stochastic optimal control for conditional McKean-Vlasov equations with jump and Markovian switching. First, we prove the uniqueness of the solutions and derive a relevant version of Itô's formula. We provide the dynamic programming principle and prove the associated verification theorem. A stochastic maximum principle is established. Further, we derive the relationship between dynamic programming and the stochastic maximum principle. Additionally, we utilize our stochastic maximum principle result for a mean-variance portfolio selection problem.