LEADER 04152nam a22003613i 4500
006 m d
007 cr un
008 180619t20182018cau om 000 0 eng d
a| CSt b| eng e| rda c| CSt
a| Zhai, Alex, e| author. ?| UNAUTHORIZED
a| Asymptotics of Gaussian processes and Markov chains / c| Alex Zhai.
a| [Stanford, California] : b| [Stanford University], c| 2018.
a| 1 online resource.
a| text 2| rdacontent
a| computer 2| rdamedia
a| online resource 2| rdacarrier
a| Submitted to the Department of Mathematics.
g| Thesis b| Ph.D. c| Stanford University d| 2018.
a| In this thesis, we present several results on the asymptotic behavior of Gaussian processes and Markov chains. In the first part, focused on Gaussian processes, we prove a central limit theorem for the sum of i.i.d. high-dimensional random vectors. Surprisingly, not much is known about the optimal dependence of the convergence rate on the dimension of the vectors. Our main contribution is to prove a convergence rate in quadratic transportation distance that is close to optimal in both the dimension and the number of summands. We next prove a result (based on joint work with Jian Ding and Ronen Eldan) about general Gaussian processes: we show that if the maximum of a Gaussian process is strongly concentrated around its expectation (called "superconcentration"), then with high probability the process has many near-maximal values with low pairwise correlations (called "multiple peaks"). Such phenomena naturally arise in the analysis of disordered systems in statistical physics, where the Gaussian process values correspond to energy levels. Our result adds to an overall picture of the behavior of superconcentrated Gaussian processes described by Chatterjee. The second part of the thesis contains results concerning asymptotic behavior of Markov chains. For random walk on a graph, we prove a sharpening of a relationship established by Ding, Lee, and Peres between the cover time and the Gaussian free field. In particular, our estimate implies that in families of graphs (of size growing to infinity) where the hitting time is asymptotically much smaller than the cover time, the cover time is exponentially concentrated around its expectation, and this expectation has a simple asymptotic formula in terms of the Gaussian free field. We also analyze the mixing time of a Markov chain, known as the product replacement walk, on n-tuples of elements of some finite group. One step of the walk involves randomly choosing two of the elements a and b and multiplying a by either b or the inverse of b, with equal probability. The product replacement walk has been extensively studied in the context of random generation of group elements and is part of a larger class of Markov chains that includes random walks on matrix groups over finite fields and certain interacting particle system models. Based on joint work with Yuval Peres and Ryokichi Tanaka, we prove that the product replacement walk exhibits a cutoff phenomenon as n goes to infinity: the chain rapidly transitions from being unmixed to mixed after around 3/2 n log(n) steps.
a| Dembo, Amir, e| degree supervisor. 4| ths 0| http://id.loc.gov/authorities/names/n92067509 =| ^A798907
a| Peres, Y. q| (Yuval), e| degree supervisor. 4| ths 0| http://id.loc.gov/authorities/names/n99830878 =| ^A1407904
a| Chatterjee, Sourav, e| degree committee member. 4| ths 0| http://id.loc.gov/authorities/names/no2014055348 =| ^A3194396
a| Stanford University. b| Department of Mathematics. 0| http://id.loc.gov/authorities/names/no97020214 =| ^A1236201
a| 21 22
u| http://purl.stanford.edu/dr538yj7802 x| SDR-PURL x| item
a| DATE CATALOGED b| 20180622
a| 3781 2018 Z w| ALPHANUM c| 1 i| 36105227893091 l| UARCH-30 m| SPEC-COLL r| Y s| Y t| NONCIRC u| 6/20/2018
a| INTERNET RESOURCE w| ASIS c| 1 i| 12684949-2001 l| INTERNET m| SUL r| Y s| Y t| SUL u| 6/20/2018 x| E-THESIS