Probability Commons^™

Application Of Randomness In Finance, Jose Sanchez, Daanial Ahmad, Satyanand Singh

Publications and Research

Brownian Motion which is also considered to be a Wiener process and can be thought of as a random walk. In our project we had briefly discussed the fluctuations of financial indices and related it to Brownian Motion and the modeling of Stock prices.

Zeta Function Regularization And Its Relationship To Number Theory, Stephen Wang

Electronic Theses and Dissertations

While the "path integral" formulation of quantum mechanics is both highly intuitive and far reaching, the path integrals themselves often fail to converge in the usual sense. Richard Feynman developed regularization as a solution, such that regularized path integrals could be calculated and analyzed within a strictly physics context. Over the past 50 years, mathematicians and physicists have retroactively introduced schemes for achieving mathematical rigor in the study and application of regularized path integrals. One such scheme was introduced in 2007 by the mathematicians Klaus Kirsten and Paul Loya. In this thesis, we reproduce the Kirsten and Loya approach to …

Markov Chains And Their Applications, Fariha Mahfuz

Math Theses

Markov chain is a stochastic model that is used to predict future events. Markov chain is relatively simple since it only requires the information of the present state to predict the future states. In this paper we will go over the basic concepts of Markov Chain and several of its applications including Google PageRank algorithm, weather prediction and gamblers ruin.

We examine on how the Google PageRank algorithm works efficiently to provide PageRank for a Google search result. We also show how can we use Markov chain to predict weather by creating a model from real life data.

Stochastic Navier-Stokes Equations With Markov Switching, Po-Han Hsu

LSU Doctoral Dissertations

This dissertation is devoted to the study of three-dimensional (regularized) stochastic Navier-Stokes equations with Markov switching. A Markov chain is introduced into the noise term to capture the transitions from laminar to turbulent flow, and vice versa. The existence of the weak solution (in the sense of stochastic analysis) is shown by studying the martingale problem posed by it. This together with the pathwise uniqueness yields existence of the unique strong solution (in the sense of stochastic analysis). The existence and uniqueness of a stationary measure is established when the noise terms are additive and autonomous. Certain exit time estimates …

Continuous-Time Controlled Branching Processes, Ines Garcia, George Yanev, Manuel Molina, Nikolay Yanev, Miguel Velasco

School of Mathematical and Statistical Sciences Faculty Publications and Presentations

Controlled branching processes with continuous time are introduced and limiting distributions are obtained in the critical case. An extension of this class as regenerative controlled branching processes with continuous time is proposed and some asymptotic properties are considered.

On The Evolution Equation For Modelling The Covid-19 Pandemic, Jonathan Blackledge

Books/Book chapters

The paper introduces and discusses the evolution equation, and, based exclusively on this equation, considers random walk models for the time series available on the daily confirmed Covid-19 cases for different countries. It is shown that a conventional random walk model is not consistent with the current global pandemic time series data, which exhibits non-ergodic properties. A self-affine random walk field model is investigated, derived from the evolutionary equation for a specified memory function which provides the non-ergodic fields evident in the available Covid-19 data. This is based on using a spectral scaling relationship of the type 1/ωα where ω …

Em Estimation For Zero- And K-Inflated Poisson Regression Model, Monika Arora, N. Rao Chaganty

Mathematics & Statistics Faculty Publications

Count data with excessive zeros are ubiquitous in healthcare, medical, and scientific studies. There are numerous articles that show how to fit Poisson and other models which account for the excessive zeros. However, in many situations, besides zero, the frequency of another count k tends to be higher in the data. The zero- and k-inflated Poisson distribution model (ZkIP) is appropriate in such situations The ZkIP distribution essentially is a mixture distribution of Poisson and degenerate distributions at points zero and k. In this article, we study the fundamental properties of this mixture distribution. Using stochastic representation, we …

Exponential And Hypoexponential Distributions: Some Characterizations, George Yanev

School of Mathematical and Statistical Sciences Faculty Publications and Presentations

The (general) hypoexponential distribution is the distribution of a sum of independent exponential random variables. We consider the particular case when the involved exponential variables have distinct rate parameters. We prove that the following converse result is true. If for some n ≥ 2, X1, X2, . . . , Xn are independent copies of a random variable X with unknown distribution F and a specific linear combination of Xj ’s has hypoexponential distribution, then F is exponential. Thus, we obtain new characterizations of the exponential distribution. As corollaries of the main results, we extend some previous characterizations established recently …

Dynamic Neuromechanical Sets For Locomotion, Aravind Sundararajan

Doctoral Dissertations

Most biological systems employ multiple redundant actuators, which is a complicated problem of controls and analysis. Unless assumptions about how the brain and body work together, and assumptions about how the body prioritizes tasks are applied, it is not possible to find the actuator controls. The purpose of this research is to develop computational tools for the analysis of arbitrary musculoskeletal models that employ redundant actuators. Instead of relying primarily on optimization frameworks and numerical methods or task prioritization schemes used typically in biomechanics to find a singular solution for actuator controls, tools for feasible sets analysis are instead developed …

Applying The Data: Predictive Analytics In Sport, Anthony Teeter, Margo Bergman

Access*: Interdisciplinary Journal of Student Research and Scholarship

The history of wagering predictions and their impact on wide reaching disciplines such as statistics and economics dates to at least the 1700’s, if not before. Predicting the outcomes of sports is a multibillion-dollar business that capitalizes on these tools but is in constant development with the addition of big data analytics methods. Sportsline.com, a popular website for fantasy sports leagues, provides odds predictions in multiple sports, produces proprietary computer models of both winning and losing teams, and provides specific point estimates. To test likely candidates for inclusion in these prediction algorithms, the authors developed a computer model, and test …

Uniform Random Variate Generation With The Linear Congruential Method, Joseph Free

PANDION: The Osprey Journal of Research and Ideas

This report considers the issue of using a specific linear congruential generator (LCG) to create random variates from the uniform(0,1) distribution. The LCG is used to generate multiple samples of pseudo-random numbers and statistical computation techniques are used to assess whether those samples could have resulted from a uniform(0,1) distribution. Source code is included with this report in the appendix along with annotations.

Evaluating An Ordinal Output Using Data Modeling, Algorithmic Modeling, And Numerical Analysis, Martin Keagan Wynne Brown

Murray State Theses and Dissertations

Data and algorithmic modeling are two different approaches used in predictive analytics. The models discussed from these two approaches include the proportional odds logit model (POLR), the vector generalized linear model (VGLM), the classification and regression tree model (CART), and the random forests model (RF). Patterns in the data were analyzed using trigonometric polynomial approximations and Fast Fourier Transforms. Predictive modeling is used frequently in statistics and data science to find the relationship between the explanatory (input) variables and a response (output) variable. Both approaches prove advantageous in different cases depending on the data set. In our case, the data …

Chase-Escape On Sparse Networks, Emma Sylvie Bernstein

Senior Projects Spring 2020

Chase-escape is a competitive growth process in which prey spread through an environment while being chased and consumed by predators. The environment is typically modeled by a graph—such as a lattice, tree, or clique—and the species by particles competing to occupy sites. It is arguably more natural to study these dynamics in heterogeneous environments. To this end, we consider chase-escape on a canonical sparse random graph called the Erdo ̋s-R ́enyi graph. We show that if prey spreads too slowly then both species quickly die out. On the other hand, if prey spreads fast enough, then coexistence occurs. Concrete bounds …

Network Structure And Dynamics Of Biological Systems, Deena R. Schmidt

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

The Martingale Approach To Financial Mathematics, Jordan M. Rowley

Master's Theses

In this thesis, we will develop the fundamental properties of financial mathematics, with a focus on establishing meaningful connections between martingale theory, stochastic calculus, and measure-theoretic probability. We first consider a simple binomial model in discrete time, and assume the impossibility of earning a riskless profit, known as arbitrage. Under this no-arbitrage assumption alone, we stumble upon a strange new probability measure Q, according to which every risky asset is expected to grow as though it were a bond. As it turns out, this measure Q also gives the arbitrage-free pricing formula for every asset on our market. In …

An Epidemiological Model With Simultaneous Recoveries, Ariel B. Farber

Electronic Theses and Dissertations

Epidemiological models are an essential tool in understanding how infection spreads throughout a population. Exploring the effects of varying parameters provides insight into the driving forces of an outbreak. In this thesis, an SIS (susceptible-infectious-susceptible) model is built partnering simulation methods, differential equations, and transition matrices with the intent to describe how simultaneous recoveries influence the spread of a disease in a well-mixed population. Individuals in the model transition between only two states; an individual is either susceptible — able to be infected, or infectious — able to infect others. Events in this model (infections and recoveries) occur by way …

Characterizing The Permanence And Stationary Distribution For A Family Of Malaria Stochastic Models, Divine Wanduku

Biology and Medicine Through Mathematics Conference

No abstract provided.

Generalizations Of The Arcsine Distribution, Rebecca Rasnick

Electronic Theses and Dissertations

The arcsine distribution looks at the fraction of time one player is winning in a fair coin toss game and has been studied for over a hundred years. There has been little further work on how the distribution changes when the coin tosses are not fair or when a player has already won the initial coin tosses or, equivalently, starts with a lead. This thesis will first cover a proof of the arcsine distribution. Then, we explore how the distribution changes when the coin the is unfair. Finally, we will explore the distribution when one person has won the first …

Dynamic Attribute-Level Best Worst Discrete Choice Experiments, Amanda Working, Mohammed Alqawba, Norou Diawara

Mathematics & Statistics Faculty Publications

Dynamic modelling of decision maker choice behavior of best and worst in discrete choice experiments (DCEs) has numerous applications. Such models are proposed under utility function of decision maker and are used in many areas including social sciences, health economics, transportation research, and health systems research. After reviewing references on the study of such experiments, we present example in DCE with emphasis on time dependent best-worst choice and discrimination between choice attributes. Numerical examples of the dynamic DCEs are simulated, and the associated expected utilities over time of the choice models are derived using Markov decision processes. The estimates are …

Unified Methods For Feature Selection In Large-Scale Genomic Studies With Censored Survival Outcomes, Lauren Spirko-Burns, Karthik Devarajan

COBRA Preprint Series

One of the major goals in large-scale genomic studies is to identify genes with a prognostic impact on time-to-event outcomes which provide insight into the disease's process. With rapid developments in high-throughput genomic technologies in the past two decades, the scientific community is able to monitor the expression levels of tens of thousands of genes and proteins resulting in enormous data sets where the number of genomic features is far greater than the number of subjects. Methods based on univariate Cox regression are often used to select genomic features related to survival outcome; however, the Cox model assumes proportional hazards …

Counting And Coloring Sudoku Graphs, Kyle Oddson

Mathematics and Statistics Dissertations, Theses, and Final Project Papers

A sudoku puzzle is most commonly a 9 × 9 grid of 3 × 3 boxes wherein the puzzle player writes the numbers 1 - 9 with no repetition in any row, column, or box. We generalize the notion of the n² × n² sudoku grid for all n ϵ Z ^≥2 and codify the empty sudoku board as a graph. In the main section of this paper we prove that sudoku boards and sudoku graphs exist for all such n we prove the equivalence of [3]'s construction using unions and products of graphs to the definition of …

Modeling Stochastically Intransitive Relationships In Paired Comparison Data, Ryan Patrick Alexander Mcshane

Statistical Science Theses and Dissertations

If the Warriors beat the Rockets and the Rockets beat the Spurs, does that mean that the Warriors are better than the Spurs? Sophisticated fans would argue that the Warriors are better by the transitive property, but could Spurs fans make a legitimate argument that their team is better despite this chain of evidence?

We first explore the nature of intransitive (rock-scissors-paper) relationships with a graph theoretic approach to the method of paired comparisons framework popularized by Kendall and Smith (1940). Then, we focus on the setting where all pairs of items, teams, players, or objects have been compared to …

Yelp’S Review Filtering Algorithm, Yao Yao, Ivelin Angelov, Jack Rasmus-Vorrath, Mooyoung Lee, Daniel W. Engels

SMU Data Science Review

In this paper, we present an analysis of features influencing Yelp's proprietary review filtering algorithm. Classifying or misclassifying reviews as recommended or non-recommended affects average ratings, consumer decisions, and ultimately, business revenue. Our analysis involves systematically sampling and scraping Yelp restaurant reviews. Features are extracted from review metadata and engineered from metrics and scores generated using text classifiers and sentiment analysis. The coefficients of a multivariate logistic regression model were interpreted as quantifications of the relative importance of features in classifying reviews as recommended or non-recommended. The model classified review recommendations with an accuracy of 78%. We found that reviews …

The Expected Number Of Patterns In A Random Generated Permutation On [N] = {1,2,...,N}, Evelyn Fokuoh

Electronic Theses and Dissertations

Previous work by Flaxman (2004) and Biers-Ariel et al. (2018) focused on the number of distinct words embedded in a string of words of length n. In this thesis, we will extend this work to permutations, focusing on the maximum number of distinct permutations contained in a permutation on [n] = {1,2,...,n} and on the expected number of distinct permutations contained in a random permutation on [n]. We further considered the problem where repetition of subsequences are as a result of the occurrence of (Type A and/or Type B) replications. Our method of enumerating the Type A replications causes double …

Excess Versions Of The Minkowski And Hölder Inequalities, Iosif Pinelis

Iosif Pinelis

No abstract provided.

Asymptotic Behavior Of The Random Logistic Model And Of Parallel Bayesian Logspline Density Estimators, Konstandinos Kotsiopoulos

Doctoral Dissertations

This dissertation is comprised of two separate projects. The first concerns a Markov chain called the Random Logistic Model. For r in (0,4] and x in [0,1] the logistic map f_r(x) = rx(1 - x) defines, for positive integer t, the dynamical system x_r(t + 1) = f(x_r(t)) on [0,1], where x_r(1) = x. The interplay between this dynamical system and the Markov chain x_r,N(t) defined by perturbing the logistic map by truncated Gaussian noise scaled by N^-1/2, where N -> infinity, is studied. A natural question is …

Golden Arm: A Probabilistic Study Of Dice Control In Craps, Donald R. Smith, Robert Scott Iii

UNLV Gaming Research & Review Journal

This paper calculates how much control a craps shooter must possess on dice outcomes to eliminate the house advantage. A golden arm is someone who has dice control (or a rhythm roller or dice influencer). There are various strategies for dice control in craps. We discuss several possibilities of dice control that would result in several different mathematical models of control. We do not assert whether dice control is possible or not (there is a lack of published evidence). However, after studying casino-legal methods described by dice-control advocates, we can see only one realistic mathematical model that describes the resulting …

On Passing The Buck, Adam J. Hammett, Anna Joy Yang

The Research and Scholarship Symposium (2013-2019)

Imagine there are n>1 people seated around a table, and person S starts with a fair coin they will flip to decide whom to hand the coin next -- if "heads" they pass right, and if "tails" they pass left. This process continues until all people at the table have "touched" the coin. Curiously, it turns out that all people seated at the table other than S have the same probability 1/(n-1) of being last to touch the coin. In fact, Lovasz and Winkler ("A note on the last new vertex visited by a random walk," J. Graph Theory, …

Predicting The Next Us President By Simulating The Electoral College, Boyan Kostadinov

Journal of Humanistic Mathematics

We develop a simulation model for predicting the outcome of the US Presidential election based on simulating the distribution of the Electoral College. The simulation model has two parts: (a) estimating the probabilities for a given candidate to win each state and DC, based on state polls, and (b) estimating the probability that a given candidate will win at least 270 electoral votes, and thus win the White House. All simulations are coded using the high-level, open-source programming language R. One of the goals of this paper is to promote computational thinking in any STEM field by illustrating how probabilistic …

Some Applications Of Sophisticated Mathematics To Randomized Computing, Ronald I. Greenberg

Ronald Greenberg

No abstract provided.