Jiaoyang Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jiaoyang Huang has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Horng-Tzer Yau
University of Pennsylvania Harvard University
5 shared publications - Daniel Zhengyu Huang
Beijing International Center for Mathematical Research, Center for Machine Learning Research, Peking University, Beijing, People’s Republic of China
4 shared publications - Yifan Chen
Courant Institute New York University NY USA
3 shared publications - Alice Guionnet
CNRS Université de Toulouse CNRS ENS Lyon
2 shared publications - Amol Aggarwal
Department of Mathematics, Columbia University and Clay Mathematics Institute
2 shared publications - Andrew M. Stuart
Caltech
2 shared publications
Latest Publications
- 13 July 2026
- Published by Society for Industrial & Applied Mathematics (SIAM)
- p. 43-63
Spectral Statistics of Sparse Random Graphs
- 13 July 2026
- Published by Society for Industrial & Applied Mathematics (SIAM)
- p. 43-63
Spectral Statistics of Sparse Random Graphs
- Open Access
- 6 June 2026
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 407 (7) , 135
Asymptotics of Symmetric Polynomials: A Dynamical Point of View
In this paper we study the asymptotic behavior of the (skew) Macdonald and Jack symmetric polynomials as the number of variables grows to infinity. We characterize their limits in terms of certain variational problems. As an intermediate step, we establish a large deviation principle for the $$\theta $$ analogue of non-intersecting Bernoulli random walks. When $$\theta =1$$ , these walks are equivalent to random Lozenges tilings of strip domains, where the variational principle (with general domains and boundary conditions) has been proven in the seminal work by Cohn et al. (J Am Math Soc 14(2):297–346, 2001). Our result gives a new argument of this variational principle, and also extends it to non-intersecting $$\theta $$ -Bernoulli random walks for any $$\theta \in (0,\infty )$$ . Remarkably, the rate functions remain identical, differing only by a factor of $$1/\theta $$ .- 6 June 2026
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 407 (7) , 135
Open AccessAsymptotics of Symmetric Polynomials: A Dynamical Point of View
In this paper we study the asymptotic behavior of the (skew) Macdonald and Jack symmetric polynomials as the number of variables grows to infinity. We characterize their limits in terms of certain variational problems. As an intermediate step, we establish a large deviation principle for the $$\theta $$ analogue of non-intersecting Bernoulli random walks. When $$\theta =1$$ , these walks are equivalent to random Lozenges tilings of strip domains, where the variational principle (with general domains and boundary conditions) has been proven in the seminal work by Cohn et al. (J Am Math Soc 14(2):297–346, 2001). Our result gives a new argument of this variational principle, and also extends it to non-intersecting $$\theta $$ -Bernoulli random walks for any $$\theta \in (0,\infty )$$ . Remarkably, the rate functions remain identical, differing only by a factor of $$1/\theta $$ . - Top Cited Papers
- 12 March 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematical Analysis
- Vol. 58 (2) , 1062-1099
Fisher-Rao Gradient Flow: Geodesic Convexity and Functional Inequalities
The dynamics of probability density functions have been extensively studied in computational science and engineering to understand physical phenomena and facilitate algorithmic design. Of particular interest are dynamics formulated as gradient flows of energy functionals under the Wasserstein metric. The development of functional inequalities, such as the log-Sobolev inequality, plays a pivotal role in analyzing the convergence of these dynamics. This paper aims to extend the success of functional inequality techniques to dynamics that are gradient flows under the Fisher–Rao metric, with various [Formula: see text]-divergences serving as energy functionals. Such dynamics take the form of nonlocal differential equations, for which existing analyses critically rely on explicit solution formulas in special cases. We provide a comprehensive study of functional inequalities and the relevant geodesic convexity for Fisher–Rao gradient flows under minimal assumptions. A notable feature of our functional inequalities is their independence from the log-concavity or log-Sobolev constants of the target distribution. Consequently, the convergence rate of the dynamics (assuming well-posedness) remains uniform across general target distributions.
- 12 March 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematical Analysis
- Vol. 58 (2) , 1062-1099
Top Cited PapersFisher-Rao Gradient Flow: Geodesic Convexity and Functional Inequalities
The dynamics of probability density functions have been extensively studied in computational science and engineering to understand physical phenomena and facilitate algorithmic design. Of particular interest are dynamics formulated as gradient flows of energy functionals under the Wasserstein metric. The development of functional inequalities, such as the log-Sobolev inequality, plays a pivotal role in analyzing the convergence of these dynamics. This paper aims to extend the success of functional inequality techniques to dynamics that are gradient flows under the Fisher–Rao metric, with various [Formula: see text]-divergences serving as energy functionals. Such dynamics take the form of nonlocal differential equations, for which existing analyses critically rely on explicit solution formulas in special cases. We provide a comprehensive study of functional inequalities and the relevant geodesic convexity for Fisher–Rao gradient flows under minimal assumptions. A notable feature of our functional inequalities is their independence from the log-concavity or log-Sobolev constants of the target distribution. Consequently, the convergence rate of the dynamics (assuming well-posedness) remains uniform across general target distributions.
- Open Access
Lecture Notes on Edge Universality for Random Regular Graphs
The purpose of this note is to explain the structure, general strategy, and main ideas of the proof in the work of Huang, McKenzie, and Yau (2024) on the Ramanujan property and edge universality of random regular graphs. The core of the argument is the derivation of self-consistent equations and a microscopic version of the loop equations for random $d$-regular graphs. We first recall the local law for random $d$-regular graphs, and then illustrate the main ideas behind the derivation of the self-consistent equations and the first loop equation.
Open AccessLecture Notes on Edge Universality for Random Regular Graphs
The purpose of this note is to explain the structure, general strategy, and main ideas of the proof in the work of Huang, McKenzie, and Yau (2024) on the Ramanujan property and edge universality of random regular graphs. The core of the argument is the derivation of self-consistent equations and a microscopic version of the loop equations for random $d$-regular graphs. We first recall the local law for random $d$-regular graphs, and then illustrate the main ideas behind the derivation of the self-consistent equations and the first loop equation.
- Open Access
Gaussian Waves and Edge Eigenvectors of Random Regular Graphs
Backhausz and Szegedy (2019) demonstrated that the almost eigenvectors of random regular graphs converge to Gaussian waves with variance $0\leq σ^2\leq 1$. In this paper, we present an alternative proof of this result for the edge eigenvectors of random regular graphs, establishing that the variance must be $σ^2=1$. Furthermore, we show that the eigenvalues and eigenvectors are asymptotically independent. Our approach introduces a simple framework linking the weak convergence of the imaginary part of the Green's function to the convergence of eigenvectors, which may be of independent interest.Open AccessGaussian Waves and Edge Eigenvectors of Random Regular Graphs
Backhausz and Szegedy (2019) demonstrated that the almost eigenvectors of random regular graphs converge to Gaussian waves with variance $0\leq σ^2\leq 1$. In this paper, we present an alternative proof of this result for the edge eigenvectors of random regular graphs, establishing that the variance must be $σ^2=1$. Furthermore, we show that the eigenvalues and eigenvectors are asymptotically independent. Our approach introduces a simple framework linking the weak convergence of the imaginary part of the Green's function to the convergence of eigenvectors, which may be of independent interest. - Open Access
The Spectral Distribution of Random Graphs with Given Degree Sequences
In this article, we study random graphs with a given degree sequence $d_1, d_2, \cdots, d_n$ from the configuration model. We show that under mild assumptions of the degree sequence, the spectral distribution of the normalized Laplacian matrix of such random graph converges in distribution to the semicircle distribution as the number of vertices $n\rightarrow \infty$. This extends work by McKay (1981) and Tran, Vu and Wang (2013) which studied random regular graphs ($d_1=d_2=\cdots=d_n=d$). Furthermore, we extend the assumption to show that a slightly more general condition is equivalent to the weak convergence to semicircle distribution. The equivalence is also illustrated by numerical simulations.Open AccessThe Spectral Distribution of Random Graphs with Given Degree Sequences
In this article, we study random graphs with a given degree sequence $d_1, d_2, \cdots, d_n$ from the configuration model. We show that under mild assumptions of the degree sequence, the spectral distribution of the normalized Laplacian matrix of such random graph converges in distribution to the semicircle distribution as the number of vertices $n\rightarrow \infty$. This extends work by McKay (1981) and Tran, Vu and Wang (2013) which studied random regular graphs ($d_1=d_2=\cdots=d_n=d$). Furthermore, we extend the assumption to show that a slightly more general condition is equivalent to the weak convergence to semicircle distribution. The equivalence is also illustrated by numerical simulations. - Open Access
A convergence framework for Airy$_β$ line ensemble via pole evolution
The Airy$_β$ line ensemble is an infinite sequence of random curves. It is a natural extension of the Tracy-Widom$_β$ distributions, and is expected to be the universal edge scaling limit of a range of models in random matrix theory and statistical mechanics. In this work, we provide a framework of proving convergence to the Airy$_β$ line ensemble, via a characterization through the pole evolution of meromorphic functions satisfying certain stochastic differential equations. Our framework is then applied to prove the universality of the Airy$_β$ line ensemble as the edge limit of various continuous time processes, including Dyson Brownian motions with general $β$ and potentials, Laguerre processes and Jacobi processes.Open AccessA convergence framework for Airy$_β$ line ensemble via pole evolution
The Airy$_β$ line ensemble is an infinite sequence of random curves. It is a natural extension of the Tracy-Widom$_β$ distributions, and is expected to be the universal edge scaling limit of a range of models in random matrix theory and statistical mechanics. In this work, we provide a framework of proving convergence to the Airy$_β$ line ensemble, via a characterization through the pole evolution of meromorphic functions satisfying certain stochastic differential equations. Our framework is then applied to prove the universality of the Airy$_β$ line ensemble as the edge limit of various continuous time processes, including Dyson Brownian motions with general $β$ and potentials, Laguerre processes and Jacobi processes. - Open Access
Extremal Eigenvalues of Random Kernel Matrices with Polynomial Scaling
We study the spectral norm of random kernel matrices with polynomial scaling, where the number of samples scales polynomially with the data dimension. In this regime, Lu and Yau (2022) proved that the empirical spectral distribution converges to the additive free convolution of a semicircle law and a Marcenko-Pastur law. We demonstrate that the random kernel matrix can be decomposed into a "bulk" part and a low-rank part. The spectral norm of the "bulk" part almost surely converges to the edge of the limiting spectrum. In the special case where the random kernel matrices correspond to the inner products of random tensors, the empirical spectral distribution converges to the Marcenko-Pastur law. We prove that the largest and smallest eigenvalues converge to the corresponding spectral edges of the Marcenko-Pastur law.
Open AccessExtremal Eigenvalues of Random Kernel Matrices with Polynomial Scaling
We study the spectral norm of random kernel matrices with polynomial scaling, where the number of samples scales polynomially with the data dimension. In this regime, Lu and Yau (2022) proved that the empirical spectral distribution converges to the additive free convolution of a semicircle law and a Marcenko-Pastur law. We demonstrate that the random kernel matrix can be decomposed into a "bulk" part and a low-rank part. The spectral norm of the "bulk" part almost surely converges to the edge of the limiting spectrum. In the special case where the random kernel matrices correspond to the inner products of random tensors, the empirical spectral distribution converges to the Marcenko-Pastur law. We prove that the largest and smallest eigenvalues converge to the corresponding spectral edges of the Marcenko-Pastur law.
- Open Access
Asymptotics of Symmetric Polynomials: A Dynamical Point of view
In this paper we study the asymptotic behavior of the (skew) Macdonald and Jack symmetric polynomials as the number of variables grows to infinity. We characterize their limits in terms of certain variational problems. As an intermediate step, we establish a large deviation principle for the $θ$ analogue of non-intersecting Bernoulli random walks. When $θ=1$, these walks are equivalent to random Lozenges tilings of strip domains, where the variational principle (with general domains and boundary conditions) has been proven in the seminal work by Cohn, Kenyon, and Propp. Our result gives a new argument of this variational principle, and also extends it to non-intersecting $θ$-Bernoulli random walks for any $θ\in (0,\infty)$. Remarkably, the rate functions remain identical, differing only by a factor of $1/θ$.Open AccessAsymptotics of Symmetric Polynomials: A Dynamical Point of view
In this paper we study the asymptotic behavior of the (skew) Macdonald and Jack symmetric polynomials as the number of variables grows to infinity. We characterize their limits in terms of certain variational problems. As an intermediate step, we establish a large deviation principle for the $θ$ analogue of non-intersecting Bernoulli random walks. When $θ=1$, these walks are equivalent to random Lozenges tilings of strip domains, where the variational principle (with general domains and boundary conditions) has been proven in the seminal work by Cohn, Kenyon, and Propp. Our result gives a new argument of this variational principle, and also extends it to non-intersecting $θ$-Bernoulli random walks for any $θ\in (0,\infty)$. Remarkably, the rate functions remain identical, differing only by a factor of $1/θ$. - Open Access
Fisher-Rao Gradient Flow: Geodesic Convexity and Functional Inequalities
The dynamics of probability density functions has been extensively studied in science and engineering to understand physical phenomena and facilitate algorithmic design. Of particular interest are dynamics that can be formulated as gradient flows of energy functionals under the Wasserstein metric. The development of functional inequalities, such as the log-Sobolev inequality, plays a pivotal role in analyzing the convergence of these dynamics. The goal of this paper is to parallel the success of techniques using functional inequalities, for dynamics that are gradient flows under the Fisher-Rao metric, with various $f$-divergences as energy functionals. Such dynamics take the form of a nonlocal differential equation, for which existing analysis critically relies on using the explicit solution formula in special cases. We provide a comprehensive study on functional inequalities and the relevant geodesic convexity for Fisher-Rao gradient flows under minimal assumptions. A notable feature of the obtained functional inequalities is that they do not depend on the log-concavity or log-Sobolev constants of the target distribution. Consequently, the convergence rate of the dynamics (assuming well-posed) is uniform across general target distributions, making them potentially desirable dynamics for posterior sampling applications in Bayesian inference.
Open AccessFisher-Rao Gradient Flow: Geodesic Convexity and Functional Inequalities
The dynamics of probability density functions has been extensively studied in science and engineering to understand physical phenomena and facilitate algorithmic design. Of particular interest are dynamics that can be formulated as gradient flows of energy functionals under the Wasserstein metric. The development of functional inequalities, such as the log-Sobolev inequality, plays a pivotal role in analyzing the convergence of these dynamics. The goal of this paper is to parallel the success of techniques using functional inequalities, for dynamics that are gradient flows under the Fisher-Rao metric, with various $f$-divergences as energy functionals. Such dynamics take the form of a nonlocal differential equation, for which existing analysis critically relies on using the explicit solution formula in special cases. We provide a comprehensive study on functional inequalities and the relevant geodesic convexity for Fisher-Rao gradient flows under minimal assumptions. A notable feature of the obtained functional inequalities is that they do not depend on the log-concavity or log-Sobolev constants of the target distribution. Consequently, the convergence rate of the dynamics (assuming well-posed) is uniform across general target distributions, making them potentially desirable dynamics for posterior sampling applications in Bayesian inference.