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

Probability Commons

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

Articles 1 - 4 of 4

Full-Text Articles in Probability

Chase-Escape On Sparse Networks, Emma Sylvie Bernstein Jan 2020

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 …


Analyzing The Probabilistic Spread Of A Virus On Various Networks, Teagan Decusatis Jan 2018

Analyzing The Probabilistic Spread Of A Virus On Various Networks, Teagan Decusatis

Senior Projects Spring 2018

In this project we model the spread of a virus on networks as a probabilistic process. We assume the virus breaks out at one vertex on a network and then spreads to neighboring vertices in each time step with a certain probability. Our objective is to find probability distributions that describe the uncertain number of infected vertices at a given time step. The networks we consider are paths, cycles, star graphs, complete graphs, and broom graphs. Through the use of Markov chains and Jordan Normal Form we analyze the probability distribution of these graphs, characterizing the transition matrix for each …


Quantifying The Effect Of The Shift In Major League Baseball, Christopher John Hawke Jr. Jan 2017

Quantifying The Effect Of The Shift In Major League Baseball, Christopher John Hawke Jr.

Senior Projects Spring 2017

Baseball is a very strategic and abstract game, but the baseball world is strangely obsessed with statistics. Modern mainstream statisticians often study offensive data, such as batting average or on-base percentage, in order to evaluate player performance. However, this project observes the game from the opposite perspective: the defensive side of the game. In hopes of analyzing the game from a more concrete perspective, countless mathemeticians - most famously, Bill James - have developed numerous statistical models based on real life data of Major League Baseball (MLB) players. Large numbers of metrics go into these models, but what this project …


Random Walks On Thompson's Group F, Sarah C. Ghandour Jan 2016

Random Walks On Thompson's Group F, Sarah C. Ghandour

Senior Projects Fall 2016

In this paper we consider the statistical properties of random walks on Thompson’s group F . We use two-way forest diagrams to represent elements of F . First we describe the random walk of F by relating the steps of the walk to the possible interactions between two-way forest diagrams and the elements of {x0,x1}, the finite generating set of F, and their inverses. We then determine the long-term probabilistic and recurrence properties of the walk.