Research

PhD Thesis- Two Problems in Applied Stochastic Processes: Scaling Limits of the Multiple Range in 1D Random Walk and Uncertainty Quantification in Satellite Imagery

In this thesis, we discuss two problems in applied stochastic processes. The first is to show novel scaling limits for the multiple range of random walk in an interval. The second is  uncertainty quantification of satellite imagery via deep learning.

We first consider a symmetric simple random walk moving on the one dimensional interval $\{0, ..., N\}$.  Let $\tau_N$ be the time when the random walk reaches either 0 or N for the first time.  The $p$-multiple-range $R^{(p)}_N$ is the number of locations that the random walk visits exactly $p$ times.  It turns out that the expected orders of $R^{(p)}_N$ is $O(\log(N))$.  We compute, by the method of moments, that the joint scaled limits of $(R^{(1)}_N, ... R^{(m)}_N)/\log(N)$ is of the form $(Z, ... Z)$ where $Z$ is an exponential(2) random variable.  In particular, the limit is totally correlated over its components.

We then consider the binary segmentation of buildings and roads in Sentinel-2 satellite imagery using deep learning models. We evaluate three models: a convolutional neural network (CNN), a Bayesian convolutional neural network (BCNN), and a Monte Carlo dropout neural network (MCDN). Our primary aim is to assess both the segmentation accuracy and the uncertainty quantification capabilities of these models. We leverage Sentinel-2 data, which consists of 13 multispectral bands at varying spatial resolutions, to examine the impact of different band subsets on segmentation performance and uncertainty quantification. The models are evaluated using standard segmentation metrics, such as the F1 score, along with novel approaches we have developed for quantifying uncertainty for binary image segmentation.

Masters Thesis- Gambler's Ruin: The Limiting Distribution of Points Visited Exactly Once of a Simple Random Walk up to Time of Exit and the Influencer Voter Model

This thesis is the combination of two projects. In the first we derived the scaling distribution for the points visited exactly once up to time of exit from the domain  [0,N] . In the second project, we created a variant of the classical voter model on the complete graph, called the influencer voter model, which allows us to model influence without relying on the degree distribution. We derive a deterministic fluid limit for the process, the probability of consensus given an initial configuration of opinions, and the expected time to consensus.