Probability Commons^™

A Compact Representation Of Oscillatory Limits Via Asymptotic Value Distributions, Ibrahim Arnous, Eric M. Rodarte, Chirag Kumar

Discovery Day - Daytona Beach

Classical limits describe asymptotic behavior through convergence to a single value, but many important oscillatory functions do not converge in this sense. Standard examples such as sin(𝑥) as 𝑥→∞ and sin(1/x) as x→0 instead display stable distributions of values over time. This project examines how such behavior can be described using a measure-theoretic framework, particularly through occupation measures and, in sequence-based settings, Young measures. The objective is to present this perspective in a clear and accessible way while introducing the Ansatz representation, a compact notation for recording the support and density of an asymptotic value distribution when the limiting measure …

Machine Learning For Predictive Energy And Emissions Modeling Of Vehicles And Power Grids In The United States, S M Tanvir Faysal Alam Chowdhoury

Dissertations

The environmental benefits of electric vehicle (EV) adoption depend on more than replacing internal combustion engine vehicles with electric powertrains. EV adoption reshapes electricity demand, interacts with regional generation mixes, and influences travel behavior and congestion, creating a coupled transportation-energy system in which vehicle and power-plant emissions must be evaluated together. This dissertation develops machine-learning frameworks for predicting energy consumption and emissions from vehicles and power grids under rising EV adoption. The first component forecasts grid emissions from EV charging. Using simulation data from NREL's Cambium database, a Prophet-based time-series framework predicts carbon dioxide, nitrous oxide, and methane emission rates …

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 …

Effective Wordle Heuristics, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

While previous researchers have performed an exhaustive search to determine an optimal Wordle strategy, that computation is very time consuming and produced a strategy using words that are unfamiliar to most people. With Wordle solutions being gradually eliminated (with a new puzzle each day and no reuse), an improved strategy could be generated each day, but the computation time makes a daily exhaustive search impractical. This paper shows that simple heuristics allow for fast generation of effective strategies and that little is lost by guessing only words that are possible solution words rather than more obscure words.

Let's Play Uno! Training Mathematical Thinking With An Inclusive Card Game, Thierry Meyrath, Clara-Ioana Mincu, Antonella Perucca

Journal of Humanistic Mathematics

We explore probability exercises based on the game UNO. Excluding the Wild cards, the deck contains precisely 100 cards, which makes it convenient to express probabilities as percentages. We discuss the mathematical relation between cards that can be played after other cards. We also propose an algebraic exercise that relates several quantities, such as the number of cards left in the losing player’s hand. Finally, we argue that UNO is a very inclusive game: it is logistically easy to play, allows for players of different skill levels, and can be adapted to meet special needs. Beyond being playful exercises, our …

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 …

Entropic Dynamics Approach To The Classical Limit Of Quantum Mechanics: Decoupling Of The Center Of Mass Motion For A Mesoscopic Particle, Fatimah Judayba

Electronic Theses & Dissertations (2024 - present)

In the Entropic Dynamics (ED) approach, quantum mechanics is derived from the principles of entropic inference and information geometry. The ED approach differs from other interpretations by making a clear commitment to distinguishing which variables are ontic (real) and which are epistemic. The classical limit for the center of mass (CM) coordinate is achieved for a large number of particles, M →∞, while Planck’s constant ℏ remains finite. Typically, the emergence of the classical limit requires decoherence through interactions with the external environment. In this work, we investigate whether the classical behavior of the CM coordinate in a mesoscopic system …

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 …

Long-Term Behavior Of Subordinated Branching Processes With Prevailing Emigration, George Yanev

School of Mathematical & Statistical Sciences Faculty Publications

This paper deals into the long-term behavior of subordinated critical branching processes with migration. We focus on scenarios where emi­gration is the dominant factor and introduce additional randomness in timing through a subordination mechanism, involving renewal processes. The key findings highlight how the initial population size and the interar­rival mean time influence both asymptotic behavior of the non-extinction probability and corresponding Yaglom type limit theorems. We also study an alternating regenerative process, when the population cycles between zero and positive states. This research complements previous studies for processes when immigration prevails over emigration.

Dice Math And Probability, Warren Campbell

SEAS Faculty Publications

The manufacture of dice for tabletop games is a billion-dollar industry. In gaming circles and online forums, the concept of “cursed dice” is a popular topic. Dice are inherently unfair due to the difficulty of manufacturing them with perfect geometric tolerances and uniform material densities. A common method for testing dice fairness is the chi-square statistic, which is typically assumed to follow the chi-square distribution. However, this assumption is only asymptotically valid.

Exact distributions of the statistic can be computed for dice with few sides and a limited number of rolls—such as 2-sided (D2) and 4-sided (D4) dice—but the computational …

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 …

Robust Spacecraft Autonomy For Deep Space Exploration In Special Euclidean Group Se(3), Matthew Wittal

Doctoral Dissertations and Master's Theses

Over the past half-century, humanity has gained extensive experience conducting manned spaceflight near Earth. Arguably, "near Earth" could even include the Moon — the most distant destination humans have reached. However, "near" in this work primarily refers low Earth orbit (LEO). One could argue that we have not truly left Earth since the Apollo, as spacecraft in some LEOs remain subject to atmospheric drag thus emphasizing their continued connection to Earth's immediate environment. Reflecting on this, it becomes clear that humanity has largely remained bound to Earth’s immediate vicinity since the Apollo missions reached the Moon. However, that is set …

On Regularity And Convergence Of Solutions To The Boltzmann-Enskog Equations, Christian Ennis

LSU Doctoral Dissertations

The Boltzmann equation describes the time evolution of the density function in position-velocity space for a classical particle subjected to possible collisions by other particles in a diluted gas that expands in vacuum for a given initial distribution. While many authors have studied the probabilistic interpretation of the spatially homogeneous Boltzmann equation, there is a dearth of articles on the stochastic framework of the full (that is, spatially inhomogeneous) Boltzmann equation. In this thesis, we examine a stochastic process, developed by S. Albevario, B. Ruediger, and P. Sundar, whose law is a weak solution to a mollified Boltzmann equation. This …

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 …

Local Limit Theorems On Finitely Generated Abelian Groups, Yutong Yan

Honors Theses

In this thesis, we classify the pointwise behavior of finite-range random walks on finitely generated abelian groups in terms of local limit theorems. Random walks are central objects of research in probability theory, and the theory has found applications in statistics, physics, and even card shuffling. One significant topic in this line of study is random walks on finitely generated groups. Starting from the pioneering work of G. Pólya and H. Kesten, random walks on finitely generated groups have been studied extensively. However, many notable results on the subject (local limit theorems, for example) make assumptions about periodicity and irreducibility …

Action This Day: The Mathematics And Machinations That Bested The German Enigma, Jonah Weinbaum

Dartmouth College Master’s Theses

This thesis presents a comprehensive and chronological overview of cryptographic techniques designed to break Enigma, beginning in 1932 and culminating in the creation of the Turing-Welchman Bombe. We discuss the mathematical theory and electromechanical implements used to decode one of history's greatest ciphers.

Reexamining the Bombe through the lens of modern group theory, we critique Alan Turing's estimation of the number of "stops" that the Bombe produces for various plaintext-ciphertext pairing structures. To address its limitations, we introduce a new framework for estimating the number of stops by extending John Dixon's theorem concerning the probability that uniformly distributed elements of …

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 …

Limit Theorems For L-Functions In Analytic Number Theory, Asher Roberts

Dissertations, Theses, and Capstone Projects

We use the method of Radziwill and Soundararajan to prove Selberg’s central limit theorem for the real part of the logarithm of the Riemann zeta function on the critical line in the multivariate case. This gives an alternate proof of a result of Bourgade. An upshot of the method is to determine a rate of convergence in the sense of the Dudley distance. This is the same rate Selberg claims using the Kolmogorov distance. We also achieve the same rate of convergence in the case of Dirichlet L-functions. Assuming the Riemann hypothesis, we improve the rate of convergence by using …

Big Two And N-Card Poker Probabilities, Brian Wu, Chai Wah Wu

Communications on Number Theory and Combinatorial Theory

Between the poker hands of straight, flush, and full house, which hand is more common? In standard 5-card poker, the order from most common to least common is straight, flush, full house. The same order is true for 7-card poker such as Texas hold'em. However, is the same true for n-card poker for larger n? We study the probability of obtaining these various hands for n-card poker for various values of n≥5. In particular, we derive closed expressions for the probabilities of flush, straight and full house and show that the probability of a flush is less than a straight …

Exchangeability And A Model Of Biological Evolution, Renee Haddad

Honors Scholar Theses

A sequence of random variables (RVs) is exchangeable if its distribution is invariant under permutations. For example, every sequence of independent and identically distributed (IID) RVs is exchangeable. The main result on exchangeable sequences of random variables is de Finetti's theorem, which identifies exchangeable sequences as conditionally IID. In this thesis, we explore exchangeability, provide an elementary proof of de Finetti's theorem, and present two applications: the classical Polya's urn model and a toy model for biological evolution.

Optimizing Buying Strategies In Dominion, Nikolas A. Koutroulakis

Rose-Hulman Undergraduate Mathematics Journal

Dominion is a deck-building card game that simulates competing lords growing their kingdoms. Here we wish to optimize a strategy called Big Money by modeling the game as a Markov chain and utilizing the associated transition matrices to simulate the game. We provide additional analysis of a variation on this strategy known as Big Money Terminal Draw. Our results show that player's should prioritize buying provinces over improving their deck. Furthermore, we derive heuristics to guide a player's decision making for a Big Money Terminal Draw Deck. In particular, we show that buying a second Smithy is always more optimal …

Machine Learning Approaches For Cyberbullying Detection, Roland Fiagbe

Data Science and Data Mining

Cyberbullying refers to the act of bullying using electronic means and the internet. In recent years, this act has been identifed to be a major problem among young people and even adults. It can negatively impact one’s emotions and lead to adverse outcomes like depression, anxiety, harassment, and suicide, among others. This has led to the need to employ machine learning techniques to automatically detect cyberbullying and prevent them on various social media platforms. In this study, we want to analyze the combination of some Natural Language Processing (NLP) algorithms (such as Bag-of-Words and TFIDF) with some popular machine learning …

Utility In Time Description In Priority Best-Worst Discrete Choice Models: An Empirical Evaluation Using Flynn's Data, Sasanka Adikari, Norou Diawara

Mathematics & Statistics Faculty Publications

Discrete choice models (DCMs) are applied in many fields and in the statistical modelling of consumer behavior. This paper focuses on a form of choice experiment, best-worst scaling in discrete choice experiments (DCEs), and the transition probability of a choice of a consumer over time. The analysis was conducted by using simulated data (choice pairs) based on data from Flynn's (2007) 'Quality of Life Experiment'. Most of the traditional approaches assume the choice alternatives are mutually exclusive over time, which is a questionable assumption. We introduced a new copula-based model (CO-CUB) for the transition probability, which can handle the dependent …

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 …

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.