Probability Commons^™

Scaling Limits Of Critical Observables Through The High Dimensional Incipient Infinite Cluster, Pranav Chinmay

Dissertations, Theses, and Capstone Projects

We give a general construction of the incipient infinite cluster in high dimensional percolation, and use it as a decoupling tool to rigorize geometric heuristics for analyzing the asymptotics of observables at criticality. Examples include demonstrating the limiting distribution of the chemical distance and full-strength asymptotics for k-point functions, which constitute foundational inputs for scaling limit results associated to critical clusters.

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 …

One-Dimensional Excited Random Walk With Unboundedly Many Excitations Per Site, Omar Chakhtoun

Dissertations, Theses, and Capstone Projects

We study a discrete time excited random walk on the integers lattice requiring a tail decay estimate on the number of excitations per site and extend the existing framework, methods, and results to a wider class of excited random walks.

We give criteria for recurrence versus transience, ballisticity versus zero linear speed, completely classify limit laws in the transient regime, and establish a functional limit laws in the recurrence regime.

Stochastic Processes And Their Applications To Change Point Detection Problems, Heng Yang

Dissertations, Theses, and Capstone Projects

This dissertation addresses the change point detection problem when either the post-change distribution has uncertainty or the post-change distribution is time inhomogeneous. In the case of post-change distribution uncertainty, attention is drawn to the construction of a family of composite stopping times. It is shown that the proposed composite stopping time has third order optimality in the detection problem with Wiener observations and also provides information to distinguish the different values of post-change drift. In the case of post-change distribution uncertainty, a computationally efficient decision rule with low-complexity based on Cumulative Sum (CUSUM) algorithm is also introduced. In the time …