Lingfu Zhang's Home Page

Lingfu Zhang (张灵夫)
Fine hall 410, Princeton, NJ 08544 USA
Email: lingfuz at math dot princeton dot edu
CV (Last update: Jun 9, 2021)

About me
I'm a PhD student at the Princeton University Mathematics Department, and my advisor is Professor Allan Sly. I will graduate in June 2022.
My primary interest is in probability theory. Problems/topics that I've been working on and/or interested in include: first and last passage percolation (either exactly solvable or not), the KPZ universality class, Anderson localization problems, interacting particle systems, mixing of Markov chains.
Education
Ph.D. in Mathematics, Princeton University (2017  present).
B.S. in Mathematics and B.S. in Computer Science (Course 18 and 63), MIT (2014  2017).
Research
My papers can also be found on arXiv here. See also my Google Scholar page.
Accepted for publication
A phase transition for repeated averages
(with Sourav Chatterjee, Persi Diaconis, and Allan Sly)
Ann. Probab. accepted.
arXiv
Slides
short online talk
Abstract
Let \(x_1,\ldots,x_n\) be a fixed sequence of real numbers.
At each stage, pick two indices \(I\) and \(J\) uniformly at random and replace \(x_I\), \(x_J\) by \((x_I+x_J)/2\), \((x_I+x_J)/2\).
Clearly all the coordinates converge to \((x_1+\cdots+x_n)/n\).
We determine the rate of convergence, establishing a sharp cutoff transition answering a question of Jean Bourgain.
AndersonBernoulli localization on the 3D lattice and discrete unique continuation principle
(with Linjun Li)
Duke Math. J. accepted.
arXiv
Slides
short online talk
Abstract
We consider the Anderson model with Bernoulli potential on \(\mathbb{{Z}}^{3}\), and prove localization of eigenfunctions corresponding to eigenvalues near zero, the lower boundary of the spectrum.
Our main contribution is the 3D discrete unique continuation, which says that any eigenfunction of harmonic operator with potential cannot be too small on a significant fractional portion of \(\mathbb{{Z}}^{3}\).
Temporal correlation in last passage percolation with flat initial condition via Brownian comparison
(with Riddhipratim Basu and Shirshendu Ganguly)
Comm. Math. Phys. 383, 1805–1888 (2021).
arXiv
Journal
Slides
online talk
related talk by Riddhipratim Basu (first half)
Abstract
We consider directed last passage percolation on \(\mathbb{{Z}}^2\) with exponential passage times on the vertices. A topic of great interest is the coupling structure of the weights of geodesics between points as they are varied in space and time with various initial conditions with a particular case of importance being the flat initial data which corresponds to linetopoint last passage times. Settling a conjecture by Ferrari and Spohn (SIGMA 2016), we show that for the passage times from the line \(x+y=0\) to the points \((r,r)\) and \((n,n)\), denoted \(X_{r}\) and \(X_{n}\) respectively, as \(n\to \infty\) and \(\frac{r}{n}\) is small but bounded away from zero, the covariance satisfies \(\mbox{Cov}(X_{r},X_{n})=\Theta((\frac{r}{n})^{4/3+o(1)} n^{2/3})\), thereby establishing \(4/3\) as the temporal covariance exponent. This differs from the corresponding exponent for the droplet initial condition recently rigorously established in Ferrari and Occelli (2018), Basu and Ganguly (2018), and requires novel arguments. Key ingredients include the understanding of geodesic geometry and recent advances in quantitative comparison of geodesic weight profiles to Brownian motion using the Brownian Gibbs property. The proof methods are expected to be applicable for a wider class of initial data.
Optimal exponent for coalescence of finite geodesics in exponential last passage percolation
Electron. Commun. Probab. 25 (2020), paper no. 74, 14 pp.
arXiv
Journal
Abstract
In this note,
we study the model of directed last passage percolation on \(\mathbb{{Z}}^2\), with i.i.d. exponential weight.
We consider the maximum paths from vertices \(\left(0, \left\lfloor k^{2/3} \right\rfloor\right)\) and \(\left(\left\lfloor k^{2/3} \right\rfloor, 0\right)\) to \((n, n)\), respectively.
For the coalescing point of these paths,
we show that the probability for it being \(kR\) far away from the origin is in the order of \(R^{2/3}\).
This is motivated by a recent work of Basu, Sarkar, and Sly, where the same estimate was obtained for semiinfinite geodesics, and the optimal exponent for the finite case was left open.
Interlacing adjacent levels of \(\beta\)Jacobi corners processes
(with Vadim Gorin)
Probab. Theory Relat. Fields 172, 915–981 (2018).
arXiv
Journal
Slides
Abstract
We study the asymptotic of the global fluctuations for the difference between two adjacent level in the \(\beta\)Jacobi corners process (multilevel and general \(\beta\) extension of the classical Jacobi ensemble of random matrices). The limit is identified with the derivative of the \(2d\) Gaussian Free Field. Our main tool is integral forms for the (Macdonaldtype) difference operators originating from the Shuffle algebra.
Preprint
Infinite order phase transition in the slow bond TASEP
(with Sourav Sarkar and Allan Sly), upcoming.
talk by Allan Sly
ShiftInvariance of the Colored TASEP and Finishing Times of the Oriented Swap Process
2021.
arXiv
Abstract
We prove a new shiftinvariance property of the colored TASEP. It is in the same spirit as recent results of BorodinGorinWheeler, Dauvergne, and Galashin, while out of the scope of the generality of their methods. Our proof takes shiftinvariance of the colored sixvertex model as an input, and uses analyticity of the probability functions and induction arguments. We apply our shiftinvariance to prove a distributional identity between the finishing times of the oriented swap process and the pointtoline passage times in exponential lastpassage percolation, which is conjectured by BisiCundenGibbonsRomik and BufetovGorinRomik, and is also equivalent to a purely combinatorial identity in relation with the EdelmanGreene correspondence. With known results from lastpassage percolation, this also implies new asymptotic results on the finishing times of the oriented swap process.
Convergence of the environment seen from geodesics in exponential last passage percolation
(with James B. Martin and Allan Sly), 2021. In submission.
arXiv
Slides
talk by James Martin
Abstract
A wellknown question in the planar firstpassage percolation model concerns the convergence of the empirical distribution along geodesics.
We demonstrate this convergence for an explicit model, directed lastpassage percolation on \(\mathbb{Z}^2\) with i.i.d. exponential weights, and provide explicit formulae for the limiting distributions, which depend on the asymptotic direction.
For example, for geodesics in the direction of the diagonal, the limiting weight distribution has density \((1/4+x/2+x^2/8)e^{x}\), and so is a mixture of Gamma(1,1), Gamma(2,1) and Gamma(3,1) distributions with weights 1/4, 1/2, and 1/4 respectively.
More generally, we study the local environment as seen from vertices along the geodesics
(including information about the shape of the path and about the weights on and off the path
in a local neighborhood).
We consider finite geodesics from (0,0) to \(n\boldsymbol{\rho}\) for some vector \(\boldsymbol{\rho}\) in the first quadrant, in the limit as \(n\to\infty\), as well as the semiinfinite geodesic in direction \(\boldsymbol{\rho}\).
We show almost sure convergence of the empirical
distributions along the geodesic, as well as convergence of the distribution around a typical point, and we give an explicit description of the limiting distribution.
We make extensive use of a correspondence
with TASEP as seen from a single secondclass
particle for which we prove new results concerning
ergodicity and convergence to equilibrium.
Our analysis relies on geometric arguments involving estimates for the lastpassage time, available from the integrable probability literature.
Mean Field Behavior during the Big Bang for Coalescing Random Walk
(with Jonathan Hermon, Shuangping Li, and Dong Yao), 2021. In submission.
arXiv
Abstract
In this paper we consider the coalescing random walk model on general graphs \(G=(V,E)\).
We set up a unified framework to study the leading order of decay rate of \(P_t\), the expectation of the fraction of occupied sites at time $t$, particularly for the `Big Bang' regime where \(t \ll t_{coal}:=\mathbb{E}[\inf\{s:\text{There is only one particle at time }s \}]\).
Our results show that \(P_t\) satisfies certain `mean field behavior', if the graphs satisfy certain `transiencelike' conditions.
We apply this framework to two families of graphs: (1) graphs given by configuration model with degree \(\ge 3\), and (2) finite and infinite vertextransitive graphs.
In the first case, we show that for \(1 \ll t \ll V\), \(P_t\) decays in the order of \(t^{1}\), and \((tP_t)^{1}\) is approximately the probability that two particles starting from the root of the corresponding unimodular GaltonWatson tree never collide after one of them leaves the root, which is also roughly \(V/(2t_{meet})\), where \(t_{meet}\) is the mean meeting time of two independent walkers.
By taking the local weak limit, for the corresponding unimodular GaltonWatson tree we prove convergence of \(tP_t\) as \(t\to\infty\).
For the second family of graphs, if we take a growing sequence of finite vertextransitive graphs \(G_n=(V_n, E_n)\), such that \(t_{meet}=O(V_n)\), and the inverse of the spectral gap \(t_{rel}\) is \(o(V_n)\), we show for
\(t_{rel} \ll t \ll t_{coal}\), \((tP_t)^{1}\) is approximately the probability that two random walks never meet before time \(t\), and also \(V/(2t_{meet})\).
In addition, we define a certain natural `uniform transience' condition, and show that in the transitive setup it implies the above for all \(1 \ll t\ll t_{coal}\).
Such estimates of \(tP_t\) are also obtained for all infinite transient transitive unimodular graphs, in particular, all transient transitive amenable graphs.
Disjoint optimizers and the directed landscape
(with Duncan Dauvergne), 2021. In submission.
arXiv
related talk by Duncan Dauvergne (second half)
Abstract
We study maximal length collections of disjoint paths, or `disjoint optimizers', in the directed landscape. We show that disjoint optimizers always exist, and that their lengths can be used to construct an extended directed landscape. The extended directed landscape can be built from an independent collection of extended Airy sheets, which we define via last passage percolation across the Airy line ensemble. We show that the extended directed landscape and disjoint optimizers are scaling limits of the corresponding objects in Brownian last passage percolation. As two consequences of this work, we show that one direction of the RobinsonSchenstedKnuth bijection passes to the KPZ limit, and we find a criterion for geodesic disjointness in the directed landscape that uses only a single Airy line ensemble.
The Ising model on trees and factor of IID
(with Danny Nam and Allan Sly), 2020. In submission.
arXiv
Slides
online talk (with Allan Sly)
Abstract
We study the ferromagnetic Ising model on the infinite \(d\)regular tree under the free boundary condition. This model is known to be a factor of IID in the uniqueness regime, when the inverse temperature \(\beta\ge 0\) satisfies \(\tanh \beta \le (d1)^{1} \). However, in the reconstruction regime (\(\tanh \beta > (d1)^{\frac{1}{2}}\) ), it is not a factor of IID. We construct a factor of IID for the Ising model beyond the uniqueness regime via a strong solution to an infinite dimensional stochastic differential equation which partially answers a question of Lyons. The solution \(\{X_t(v) \}\) of the SDE is distributed as \(X_t(v) = t\tau_v + B_t(v)\), where \(\{\tau_v \}\) is an Ising sample and \(\{B_t(v) \}\) are independent Brownian motions indexed by the vertices in the tree. Our construction holds whenever \(\tanh \beta \le c(d1)^{\frac{1}{2}}\), where \(c>0\) is an absolute constant.
Stationary distributions for the Voter Model in \(d\geq 3\) are factors of IID
(with Allan Sly), 2019. In submission.
arXiv
Slides
Abstract
For the Voter Model on \(\mathbb{{Z}}^d\), \(d\geq 3\),
we show that the (extremal) stationary distributions are Bernoulli shifts, and answer an open question asked by Steif and Tykesson.
The proof is by explicit constructing the stationary distributions as factors of IID processes on \(\mathbb{{Z}}^d\).
Refinements of the 2dimensional Strichartz estimate on the maximum wavepacket
(with Hong Wang), 2016.
arXiv
Abstract
The Strichartz estimates for Schrödinger equations can be improved when the data is spread out in either physical or frequency space. In this paper we give refinements of the 2dimensional homogeneous Strichartz estimate on the maximum size of a single wave packet. Different approaches are used in the proofs, including arithmetic approaches, polynomial partitioning, and the \(l^2\) Decoupling Theorem, for different cases. We also give examples to show that the refinements we obtain cannot be further improved when \(2 \leq p \leq 4\) and \(p = 6\).
Honors and Awards
2017 Centennial Fellowship, Princeton University.
2016 The Hartley Rogers Jr. Prize, MIT.
2015 Putnam Fellow, the 75th William Lowell Putnam Math Competition.
2013 Gold Medal, the 54th International Mathematical Olympiad (IMO).
Presentations
[Online] ColumbiaPrinceton Probability Day, May 7, 2021.
[Online] UC San Diego Group Actions Seminar, May 4, 2021.
[Online] UC Berkeley Probability Seminar, Apr 21, 2021.
[Online] ETH/Geneva/Cambridge Percolation Today Webinar, Feb 16, 2021.
[Online] Junior Integrable Probability Seminar, Dec 17, 2020.
[Online] 19th Northeast Probability Seminar, Nov 20, 2020 (Contributed).
[Online] Integrable probability miniworkshop at Online Open Probability School, Jun 12, 2020.
[Online] University of Kansas Probability and Statistics Seminar, Apr 29, 2020.
Stanford University (Stanford, CA) Applied Math Seminar, Dec 4, 2019.
Duke University (Durham, NC) Probability Seminar, Oct 24, 2019.
ICTS, Tata Institute of Fundamental Research (Bangalore, India): Universality in random structures: Interfaces, Matrices, Sandpiles, Jan 25, 2019.
MIT (Cambridge, MA) Integrable Probability Working Group, Nov 29, 2016.
MIT (Cambridge, MA) Summer Program for Undergraduate Research Conference, Aug 5, 2016 (Contributed).
Teaching and Grading
MAT 385 Probability Theory, Spring 2021, Assistant Instructor.
MAT 104 Calculus II, Fall 2020, Preceptor.
MAT 385 Probability Theory, Spring 2020, Assistant Instructor.
MAT 216 Accelerated Honors Analysis I, Fall 2019, Assistant Instructor.
MAT 375 Introduction to Graph Theory, Spring 2019, Assistant Instructor.
MAT 204 Advanced Linear Algebra with Applications, Fall 2018, Assistant Instructor.
Last updated on Jul 15, 2021