Lior Alon
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Lior Alon has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Cynthia Vinzant
University of Washington, Seattle, USA
3 shared publications - Mark Goresky
Institute for Advanced Study, Princeton, USA
3 shared publications - John Urschel
Department of Mathematics Massachusetts Institute of Technology 02139 Cambridge MA USA
2 shared publications - Mario Kummer
Technische Universität Dresden, Dresden, Germany
2 shared publications - Pavel Kurasov
Stockholm University
2 shared publications Alex Cohen
1 shared publication
Latest Publications
- Open Access
Nodal Count for Orthogonally Invariant Ensembles
We investigate the nodal count of eigenvectors of random matrices interpreted as operators on signed complete graphs. Our focus is on orthogonally invariant ensembles, with particular attention to the Gaussian Orthogonal Ensemble (GOE). We establish that, as the matrix size tends to infinity, the distribution of nodal counts converges to the same limiting law as the eigenvalue distribution. In the GOE case, this limit is the semicircle law. This result refutes a conjecture, motivated by quantum chaos and quantum graphs, which predicted Gaussian behavior of the nodal count.
Open AccessNodal Count for Orthogonally Invariant Ensembles
We investigate the nodal count of eigenvectors of random matrices interpreted as operators on signed complete graphs. Our focus is on orthogonally invariant ensembles, with particular attention to the Gaussian Orthogonal Ensemble (GOE). We establish that, as the matrix size tends to infinity, the distribution of nodal counts converges to the same limiting law as the eigenvalue distribution. In the GOE case, this limit is the semicircle law. This result refutes a conjecture, motivated by quantum chaos and quantum graphs, which predicted Gaussian behavior of the nodal count.
- Open Access
- 22 August 2025
- Published by European Mathematical Society - EMS - Publishing House GmbH in Journal of Spectral Theory
- Vol. 15 (3) , 1337-1365
Nodal count for a random signing of a graph with disjoint cycles
A recent conjecture, inspired by quantum chaos and the Bogomolny–Schmit conjecture, suggests that the nodal count of operators on signed graphs exhibits a universal Gaussian-like behavior. We establish this result for the family of graphs composed of disjoint cycles, which serves as a natural starting point by analogy with quantum graphs. Let G be a simple, connected graph with disjoint cycles , and let h be a real symmetric matrix supported on G (e.g., a discrete Schrödinger operator) that satisfies a certain generic condition . The nodal count \nu(h, k) is defined as the number of edges (i, j) where the k -th eigenvector \phi changes sign with respect to h , i.e., h_{ij}\phi_{i} \phi_{j} > 0 . We consider the distribution of nodal counts \nu(h',k) over random signings h' of h , obtained by changing the sign of some off-diagonal elements. We prove, for each k that \sigma(h',k) = \nu(h',k) - (k-1) has a binomial distribution \mathrm{Bin}\bigl(\beta, \frac{1}{2}\bigr) , where \beta is the first Betti number of G . Consequently, the conjecture is validated for graphs with disjoint cycles.
- 22 August 2025
- Published by European Mathematical Society - EMS - Publishing House GmbH in Journal of Spectral Theory
- Vol. 15 (3) , 1337-1365
Open AccessNodal count for a random signing of a graph with disjoint cycles
A recent conjecture, inspired by quantum chaos and the Bogomolny–Schmit conjecture, suggests that the nodal count of operators on signed graphs exhibits a universal Gaussian-like behavior. We establish this result for the family of graphs composed of disjoint cycles, which serves as a natural starting point by analogy with quantum graphs. Let G be a simple, connected graph with disjoint cycles , and let h be a real symmetric matrix supported on G (e.g., a discrete Schrödinger operator) that satisfies a certain generic condition . The nodal count \nu(h, k) is defined as the number of edges (i, j) where the k -th eigenvector \phi changes sign with respect to h , i.e., h_{ij}\phi_{i} \phi_{j} > 0 . We consider the distribution of nodal counts \nu(h',k) over random signings h' of h , obtained by changing the sign of some off-diagonal elements. We prove, for each k that \sigma(h',k) = \nu(h',k) - (k-1) has a binomial distribution \mathrm{Bin}\bigl(\beta, \frac{1}{2}\bigr) , where \beta is the first Betti number of G . Consequently, the conjecture is validated for graphs with disjoint cycles.
- 16 December 2024
- Published by Springer Nature in Inventiones Mathematicae
- Vol. 239 (1) , 321-376
Higher dimensional Fourier quasicrystals from Lee–Yang varieties
- 16 December 2024
- Published by Springer Nature in Inventiones Mathematicae
- Vol. 239 (1) , 321-376
Higher dimensional Fourier quasicrystals from Lee–Yang varieties
- Open Access
Higher Dimensional Fourier Quasicrystals from Lee-Yang Varieties
In this paper, we construct Fourier quasicrystals with unit masses in arbitrary dimensions. This generalizes a one-dimensional construction of Kurasov and Sarnak. To do this, we employ a class of complex algebraic varieties avoiding certain regions in $\mathbb{C}^n$, which generalize hypersurfaces defined by Lee-Yang polynomials. We show that these are Delone almost periodic sets that have at most finite intersection with every discrete periodic set.Open AccessHigher Dimensional Fourier Quasicrystals from Lee-Yang Varieties
In this paper, we construct Fourier quasicrystals with unit masses in arbitrary dimensions. This generalizes a one-dimensional construction of Kurasov and Sarnak. To do this, we employ a class of complex algebraic varieties avoiding certain regions in $\mathbb{C}^n$, which generalize hypersurfaces defined by Lee-Yang polynomials. We show that these are Delone almost periodic sets that have at most finite intersection with every discrete periodic set. - Open Access
- 22 April 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Revista Matemática Iberoamericana
- Vol. 40 (6) , 2203-2250
Gap distributions of Fourier quasicrystals with integer weights via Lee–Yang polynomials
Recent work of Kurasov and Sarnak provides a method for constructing one-dimensional Fourier quasicrystals (FQ) from the torus zero sets of a special class of multivariate polynomials called Lee–Yang polynomials. In particular, they provided a non-periodic FQ with unit coefficients and uniformly discrete support, answering an open question posed by Meyer. Their method was later shown to generate all one-dimensional Fourier quasicrystals with \mathbb{N} -valued coefficients ( \mathbb{N} -FQ). In this paper, we characterize which Lee–Yang polynomials give rise to non-periodic \mathbb{N} -FQs with unit coefficients and uniformly discrete support, and show that this property is generic among Lee–Yang polynomials. We also show that the infinite sequence of gaps between consecutive atoms of any \mathbb{N} -FQ has a well-defined distribution, which, under mild conditions, is absolutely continuous. This generalizes previously known results for the spectra of quantum graphs to arbitrary \N -FQs. Two extreme examples are presented: first, a sequence of \mathbb{N} -FQs whose gap distributions converge to a Poisson distribution. Second, a sequence of random Lee–Yang polynomials that results in random \mathbb{N} -FQs whose empirical gap distributions converge to that of a random unitary matrix (CUE).
- 22 April 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Revista Matemática Iberoamericana
- Vol. 40 (6) , 2203-2250
Open AccessGap distributions of Fourier quasicrystals with integer weights via Lee–Yang polynomials
Recent work of Kurasov and Sarnak provides a method for constructing one-dimensional Fourier quasicrystals (FQ) from the torus zero sets of a special class of multivariate polynomials called Lee–Yang polynomials. In particular, they provided a non-periodic FQ with unit coefficients and uniformly discrete support, answering an open question posed by Meyer. Their method was later shown to generate all one-dimensional Fourier quasicrystals with \mathbb{N} -valued coefficients ( \mathbb{N} -FQ). In this paper, we characterize which Lee–Yang polynomials give rise to non-periodic \mathbb{N} -FQs with unit coefficients and uniformly discrete support, and show that this property is generic among Lee–Yang polynomials. We also show that the infinite sequence of gaps between consecutive atoms of any \mathbb{N} -FQ has a well-defined distribution, which, under mild conditions, is absolutely continuous. This generalizes previously known results for the spectra of quantum graphs to arbitrary \N -FQs. Two extreme examples are presented: first, a sequence of \mathbb{N} -FQs whose gap distributions converge to a Poisson distribution. Second, a sequence of random Lee–Yang polynomials that results in random \mathbb{N} -FQs whose empirical gap distributions converge to that of a random unitary matrix (CUE).
- Open Access
Average Nodal Count and the Nodal Count Condition for Graphs
The nodal edge count of an eigenvector of the Laplacian of a graph is the number of edges on which it changes sign. This quantity extends to any real symmetric $n\times n$ matrix supported on a graph $G$ with $n$ vertices. The average nodal count, averaged over all eigenvectors of a given matrix, is known to be bounded between $\frac{n-1}{2}$ and $\frac{n-1}{2}+β(G)$, where $β(G)$ is the first Betti number of $G$ (a topological quantity), and it was believed that generically the average should be around $\frac{n-1}{2}+β(G)/2$. We prove that this is not the case: the average is bounded between $\frac{n-1}{2}+β(G)/n$ and $\frac{n-1}{2}+β(G)-β(G)/n$, and we provide graphs and matrices that attain the upper and lower bounds for any possible choice of $n$ and $β$. A natural condition on a matrix for defining the nodal count is that it has simple eigenvalues and non-vanishing eigenvectors. For any connected graph $G$, a generic real symmetric matrix supported on $G$ satisfies this nodal count condition. However, the situation for constant diagonal matrices is far more subtle. We completely characterize the graphs $G$ for which this condition is generically true, and show that if this is not the case, then any real symmetric matrix supported on $G$ with constant diagonal has a multiple eigenvalue or an eigenvector that vanishes somewhere. Finally, we discuss what can be said when this nodal count condition fails, and provide examples.Open AccessAverage Nodal Count and the Nodal Count Condition for Graphs
The nodal edge count of an eigenvector of the Laplacian of a graph is the number of edges on which it changes sign. This quantity extends to any real symmetric $n\times n$ matrix supported on a graph $G$ with $n$ vertices. The average nodal count, averaged over all eigenvectors of a given matrix, is known to be bounded between $\frac{n-1}{2}$ and $\frac{n-1}{2}+β(G)$, where $β(G)$ is the first Betti number of $G$ (a topological quantity), and it was believed that generically the average should be around $\frac{n-1}{2}+β(G)/2$. We prove that this is not the case: the average is bounded between $\frac{n-1}{2}+β(G)/n$ and $\frac{n-1}{2}+β(G)-β(G)/n$, and we provide graphs and matrices that attain the upper and lower bounds for any possible choice of $n$ and $β$. A natural condition on a matrix for defining the nodal count is that it has simple eigenvalues and non-vanishing eigenvectors. For any connected graph $G$, a generic real symmetric matrix supported on $G$ satisfies this nodal count condition. However, the situation for constant diagonal matrices is far more subtle. We completely characterize the graphs $G$ for which this condition is generically true, and show that if this is not the case, then any real symmetric matrix supported on $G$ with constant diagonal has a multiple eigenvalue or an eigenvector that vanishes somewhere. Finally, we discuss what can be said when this nodal count condition fails, and provide examples. - 24 November 2023
- Published by European Mathematical Society - EMS - Publishing House GmbH in Journal of Spectral Theory
- Vol. 13 (4) , 1225-1260
Morse theory for discrete magnetic operators and nodal count distribution for graphs
Given a discrete Schrödinger operator h on a finite connected graph G of n vertices, the nodal count \phi(h,k) denotes the number of edges on which the k -th eigenvector changes sign. A signing h' of h is any real symmetric matrix constructed by changing the sign of some off-diagonal entries of h , and its nodal count is defined according to the signing. The set of signings of h lie in a naturally defined torus \mathbb{T}_{h} of “magnetic perturbations” of h . G. Berkolaiko [Anal. PDE 6 (2013), 1213–1233] discovered that every signing h' of h is a critical point of every eigenvalue \lambda_{k}\colon \mathbb{T}_{h} \to \mathbb{R} , with Morse index equal to the nodal surplus. We add further Morse theoretic information to this result. We show if h_{\alpha}\in \mathbb{T}_{h} is a critical point of \lambda_{k} and the eigenvector vanishes at a single vertex v of degree d , then the critical point lies in a non-degenerate critical submanifold of dimension d+n-4 , closely related to the configuration space of a planar linkage. We compute its Morse index in terms of spectral data. The average nodal surplus distribution is the distribution of values of \phi(h',k)-(k-1) , averaged over all signings h' of h . If all critical points correspond to simple eigenvalues with nowhere-vanishing eigenvectors, then the average nodal surplus distribution is binomial. In general, we conjecture that the nodal surplus distribution converges to a Gaussian in a CLT fashion as the first Betti number of G goes to infinity.
- 24 November 2023
- Published by European Mathematical Society - EMS - Publishing House GmbH in Journal of Spectral Theory
- Vol. 13 (4) , 1225-1260
Morse theory for discrete magnetic operators and nodal count distribution for graphs
Given a discrete Schrödinger operator h on a finite connected graph G of n vertices, the nodal count \phi(h,k) denotes the number of edges on which the k -th eigenvector changes sign. A signing h' of h is any real symmetric matrix constructed by changing the sign of some off-diagonal entries of h , and its nodal count is defined according to the signing. The set of signings of h lie in a naturally defined torus \mathbb{T}_{h} of “magnetic perturbations” of h . G. Berkolaiko [Anal. PDE 6 (2013), 1213–1233] discovered that every signing h' of h is a critical point of every eigenvalue \lambda_{k}\colon \mathbb{T}_{h} \to \mathbb{R} , with Morse index equal to the nodal surplus. We add further Morse theoretic information to this result. We show if h_{\alpha}\in \mathbb{T}_{h} is a critical point of \lambda_{k} and the eigenvector vanishes at a single vertex v of degree d , then the critical point lies in a non-degenerate critical submanifold of dimension d+n-4 , closely related to the configuration space of a planar linkage. We compute its Morse index in terms of spectral data. The average nodal surplus distribution is the distribution of values of \phi(h',k)-(k-1) , averaged over all signings h' of h . If all critical points correspond to simple eigenvalues with nowhere-vanishing eigenvectors, then the average nodal surplus distribution is binomial. In general, we conjecture that the nodal surplus distribution converges to a Gaussian in a CLT fashion as the first Betti number of G goes to infinity.
- 29 October 2023
- Published by Elsevier in Journal of Functional Analysis
- Vol. 286 (2)
Every real-rooted exponential polynomial is the restriction of a Lee-Yang polynomial
- 29 October 2023
- Published by Elsevier in Journal of Functional Analysis
- Vol. 286 (2)
Every real-rooted exponential polynomial is the restriction of a Lee-Yang polynomial
- Open Access
Morse theory for discrete magnetic operators and nodal count distribution for graphs
Given a discrete Schr\"odinger operator $h$ on a finite connected graph $G$ of $n$ vertices, the nodal count $\phi(h,k)$ denotes the number of edges on which the $k$-th eigenvector changes sign. A {\em signing} $h'$ of $h$ is any real symmetric matrix constructed by changing the sign of some off-diagonal entries of $h$, and its nodal count is defined according to the signing. The set of signings of $h$ lie in a naturally defined torus $\mathbb{T}_h$ of ``magnetic perturbations" of $h$. G. Berkolaiko discovered that every signing $h'$ of $h$ is a critical point of every eigenvalue $\lambda_k:\mathbb{T}_h \to \mathbb{R}$, with Morse index equal to the nodal surplus. We add further Morse theoretic information to this result. We show if $h_{\alpha} \in \mathbb{T}_h$ is a critical point of $\lambda_k$ and the eigenvector vanishes at a single vertex $v$ of degree $d$, then the critical point lies in a nondegenerate critical submanifold of dimension $d+n-4$, closely related to the configuration space of a planar linkage. We compute its Morse index in terms of spectral data. The average nodal surplus distribution is the distribution of values of $\phi(h',k)-(k-1)$, averaged over all signings $h'$ of $h$. If all critical points correspond to simple eigenvalues with nowhere-vanishing eigenvectors, then the average nodal surplus distribution is binomial. In general, we conjecture that the nodal surplus distribution converges to a Gaussian in a CLT fashion as the first Betti number of $G$ goes to infinity.Open AccessMorse theory for discrete magnetic operators and nodal count distribution for graphs
Given a discrete Schr\"odinger operator $h$ on a finite connected graph $G$ of $n$ vertices, the nodal count $\phi(h,k)$ denotes the number of edges on which the $k$-th eigenvector changes sign. A {\em signing} $h'$ of $h$ is any real symmetric matrix constructed by changing the sign of some off-diagonal entries of $h$, and its nodal count is defined according to the signing. The set of signings of $h$ lie in a naturally defined torus $\mathbb{T}_h$ of ``magnetic perturbations" of $h$. G. Berkolaiko discovered that every signing $h'$ of $h$ is a critical point of every eigenvalue $\lambda_k:\mathbb{T}_h \to \mathbb{R}$, with Morse index equal to the nodal surplus. We add further Morse theoretic information to this result. We show if $h_{\alpha} \in \mathbb{T}_h$ is a critical point of $\lambda_k$ and the eigenvector vanishes at a single vertex $v$ of degree $d$, then the critical point lies in a nondegenerate critical submanifold of dimension $d+n-4$, closely related to the configuration space of a planar linkage. We compute its Morse index in terms of spectral data. The average nodal surplus distribution is the distribution of values of $\phi(h',k)-(k-1)$, averaged over all signings $h'$ of $h$. If all critical points correspond to simple eigenvalues with nowhere-vanishing eigenvectors, then the average nodal surplus distribution is binomial. In general, we conjecture that the nodal surplus distribution converges to a Gaussian in a CLT fashion as the first Betti number of $G$ goes to infinity. - 4 July 2022
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 33 (2) , 301-335
Universality of Nodal Count Distribution in Large Metric Graphs
An eigenfunction of the Laplacian on a metric (quantum) graph has an excess number of zeros due to the graph’s non-trivial topology. This number, called the nodal surplus, is an integer between 0 and the graph’s first Betti number β. We study the distribution of the nodal surplus values in the countably infinite set of the graph’s eigenfunctions. We conjecture that this distribution converges to Gaussian for any sequence of graphs of growing β. We prove this conjecture for several special graph sequences and test it numerically for a variety of well-known graph families. Accurate computation of the distribution is made possible by a formula expressing the nodal surplus distribution as an integral over a high-dimensional torus.
- 4 July 2022
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 33 (2) , 301-335
Universality of Nodal Count Distribution in Large Metric Graphs
An eigenfunction of the Laplacian on a metric (quantum) graph has an excess number of zeros due to the graph’s non-trivial topology. This number, called the nodal surplus, is an integer between 0 and the graph’s first Betti number β. We study the distribution of the nodal surplus values in the countably infinite set of the graph’s eigenfunctions. We conjecture that this distribution converges to Gaussian for any sequence of graphs of growing β. We prove this conjecture for several special graph sequences and test it numerically for a variety of well-known graph families. Accurate computation of the distribution is made possible by a formula expressing the nodal surplus distribution as an integral over a high-dimensional torus.