Nodal count of graph eigenfunctions via magnetic perturbation

Abstract

We establish a connection between the stability of an eigenvalue under a magnetic perturbation and the number of zeros of the corresponding eigenfunction. Namely, we consider an eigenfunction of discrete Laplacian on a graph and count the number of edges where the eigenfunction changes sign (has a "zero"). It is known that the $n$-th eigenfunction has $n-1+s$ such zeros, where the "nodal surplus" $s$ is an integer between 0 and the number of cycles on the graph. We then perturb the Laplacian by a weak magnetic field and view the $n$-th eigenvalue as a function of the perturbation. It is shown that this function has a critical point at the zero field and that the Morse index of the critical point is equal to the nodal surplus $s$ of the $n$-th eigenfunction of the unperturbed graph.

18 pages, 4 figures

References in corpus (9)

• On occurrence of spectral edges for periodic operators inside the Brillouin zone
• Eigenvectors of the discrete Laplacian on regular graphs - a statistical approach
• On the connection between the number of nodal domains on quantum graphs and the stability of graph partitions
• Can one count the shape of a drum?
• Magnetic interpretation of the nodal defect on graphs
• On the location of spectral edges in $\mathbb{Z}$-periodic media
• Critical partitions and nodal deficiency of billiard eigenfunctions
• Stability of nodal structures in graph eigenfunctions and its relation to the nodal domain count
• Trace formula for counting nodal domains on the boundaries of chaotic 2D billiards

Cited by in corpus (23)

• Magnetic eigenmaps for community detection in directed networks
• Spacing ratio characterization of the spectra of directed random networks
• Magnetic interpretation of the nodal defect on graphs
• Magnetic Eigenmaps for the Visualization of Directed Networks
• Critical partitions and nodal deficiency of billiard eigenfunctions
• On the eigenvalues of Aharonov-Bohm operators with varying poles
• The Nodal Count {0, 1, 2, 3,...} Implies The Graph is a Tree
• Stability of nodal structures in graph eigenfunctions and its relation to the nodal domain count
• Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
• Stability of eigenvalues of quantum graphs with respect to magnetic perturbation and the nodal count of the eigenfunctions
• Characterization and comparison of large directed graphs through the spectra of the magnetic Laplacian
• An elementary introduction to quantum graphs
• Deformed Laplacians and spectral ranking in directed networks
• Lieb-Schultz-Mattis theorem in higher dimensions from approximate magnetic translation symmetry
• A local test for global extrema in the dispersion relation of a periodic graph
• Universality of nodal count distribution in large metric graphs
• Courant-sharp eigenvalues of Neumann 2-rep-tiles
• Spectral shift via "lateral" perturbation
• Isospectral discrete and quantum graphs with the same flip counts and nodal counts
• Projectification of point group symmetries with a background flux and Lieb-Schultz-Mattis theorem
• Characterization and space embedding of directed graphs and social networks through magnetic Laplacians
• A Graph Spectral Flow for Computing Nodal Deficiencies
• Morse inequalities for ordered eigenvalues of generic self-adjoint families