Discrete Nodal Domain Theorems

We give a detailed proof for two discrete analogues of Courant's Nodal Domain Theorem. (author's abstract)

• Publication year

  2000

• Venue

  Linear Algebra and its Applications

• Publication date

  2000-09-12

• Fields of study

  Mathematics

• Identifiers
  DOI 10.1016/S0024-3795(01)00313-5arXiv math/0009120
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Courant's Nodal Line Theorem and Its Discrete Counterparts

  2002cited by this paper
• Perron–Frobenius type results and discrete versions of nodal domain theorems

  1999cited by this paper
• Amplitude Spectra of Fitness Landscapes

  1998cited by this paper
• Some applications of Laplace eigenvalues of graphs

  1997cited by this paper
• Topological and Spectral Graph Characterizations

  1996cited by this paper
• Some geometric aspects of graphs and their eigenfunctions

  1993cited by this paper
• Graph Partitioning by Eigenvectors

  1988cited by this paper
• Eigenvalues in Riemannian geometry

  1984cited by this paper
• A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory

  1975cited by this paper
• Eigenvectors of acyclic matrices

  1975cited by this paper
• Algebraic connectivity of graphs

  1973cited by this paper
• Oscillation matrices and kernels and small vibrations of mechanical systems

  1961cited by this paper
• Methods of Mathematical Physics

  1947cited by this paper

• Coupling of the continuum and semiclassical limit. Part I: convergence of eigenvalues

  2026cites this paper
• Lightweight Transformer for EEG Classification via Balanced Signed Graph Algorithm Unrolling

  2025cites this paper
• Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming

  2025cites this paper
• Smooth critical points of eigenvalues on the torus of magnetic perturbations of graphs

  2025cites this paper
• Oscillation of graph eigenfunctions

  2025cites this paper
• Equivalent spectral theory for fundamental graph cut problems

  2024cites this paper
• Average Nodal Count and the Nodal Count Condition for Graphs

  2024cites this paper
• Interpretable Lightweight Transformer via Unrolling of Learned Graph Smoothness Priors

  2024cites this paper
• Spectral bounds of multi-way Cheeger constants via cyclomatic number

  2024cites this paper
• Pleijel nodal domain theorem in non-smooth setting

  2023cites this paper
• Sharp lower bound on the"number of nodal decomposition"of graphs

  2023cites this paper
• Nodal Decompositions of a Symmetric Matrix

  2023cites this paper
• Spectral Augmentations for Graph Contrastive Learning

  2023cites this paper
• Adaptive Estimation of Graphical Models under Total Positivity

  2022cites this paper
• Symmetric matrices, signed graphs, and nodal domain theorems

  2022influential citation
• Nodal domain count for the generalized graph p-Laplacian

  2022cites this paper
• Stratified Graph Spectra

  2022influential citation
• Nodal domain theorems of signed hypergraphs

  2022cites this paper
• Efficient Signed Graph Sampling via Balancing & Gershgorin Disc Perfect Alignment

  2022influential citation
• Nodal domain theorems for $p$-Laplacians on signed graphs

  2022cites this paper
• Adaptive Estimation of MTP2 Graphical Models

  2022cites this paper
• Morse theory for discrete magnetic operators and nodal count distribution for graphs

  2022cites this paper
• Physics-informed graph neural Galerkin networks: A unified framework for solving PDE-governed forward and inverse problems

  2021cites this paper
• Spectral theory of Laplace operators on oriented hypergraphs

  2021cites this paper
• Universality of Nodal Count Distribution in Large Metric Graphs

  2021cites this paper
• Many Nodal Domains in Random Regular Graphs

  2021cites this paper
• OPTIMIZATIONS OF HIGHER CHEEGER CONSTANTS ON GRAPHS AND APPLICATIONS IN DATA CLUSTERING

  2021cites this paper
• The Courant Nodal Domain Theorem

  2021cites this paper
• 2004 Nodal Domain Theorems `a la Courant.

  2021cites this paper
• Minimum supports of eigenfunctions of graphs: a survey

  2021cites this paper
• Pseudo-orthogonality for graph 1-Laplacian eigenvectors and applications to higher Cheeger constants and data clustering

  2021cites this paper
• Spectral theory of Laplace Operators on chemical hypergraphs

  2020influential citation
• Effective gaps are not effective: quasipolynomial classical simulation of obstructed stoquastic Hamiltonians

  2020cites this paper
• Spectral Processing for Denoising and Compression of 3D Meshes Using Dynamic Orthogonal Iterations

  2020cites this paper
• On Pleijel’s Nodal Domain Theorem for Quantum Graphs

  2020cites this paper
• Spectral Graph Analysis of the Geometry of Power Flows in Transmission Networks

  2020cites this paper
• p-Laplace Operators for Oriented Hypergraphs

  2020cites this paper
• Determination of multistoried buildings stiffness properties in the inverse dynamics solution

  2020cites this paper
• Monte Carlo Quantum Computing

  2020cites this paper
• $p$-Laplace Operators for Chemical Hypergraphs.

  2020influential citation
• A theory of spectral partitions of metric graphs

  2020cites this paper
• Spectral analysis of load flow equations for transmission networks

  2019cites this paper
• Signal Processing on Static and Dynamic 3D Meshes: Sparse Representations and Applications

  2019cites this paper
• Tail bounds for gaps between eigenvalues of sparse random matrices

  2019cites this paper
• Graph convolutional networks for computational drug development and discovery

  2019cites this paper
• Extreme Values of the Fiedler Vector on Trees

  2019cites this paper
• Graphs and Geometry

  2019cites this paper
• Fasino, Dario and Tudisco, Francesco (2017) Modularity bounds for clusters located by leading eigenvectors of the normalized modularity

  2018cites this paper
• Spectral solution of load flow equations

  2018cites this paper
• Block based Spectral Processing of Dense 3D Meshes using Orthogonal Iterations

  2018cites this paper
• Distributed Non-Convex First-Order optimization and Information Processing: Lower Complexity Bounds and Rate Optimal Algorithms

  2018cites this paper
• Distributed Non-Convex First-Order Optimization and Information Processing: Lower Complexity Bounds and Rate Optimal Algorithms

  2018cites this paper
• Nodal decompositions of graphs

  2018cites this paper
• Bridging Elementary Landscapes and a Geometric Theory of Evolutionary Algorithms: First Steps

  2018cites this paper
• Meta-Graph Based HIN Spectral Embedding: Methods, Analyses, and Insights

  2018cites this paper
• Local Frequency Interpretation and Non-Local Self-Similarity on Graph for Point Cloud Inpainting

  2018cites this paper
• Türker Biyikoglu and Josef Leydold Algebraic Connectivity and Degree Sequences of Trees

  2018cites this paper
• Isospectral discrete and quantum graphs with the same flip counts and nodal counts

  2018cites this paper
• Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering

  2018cites this paper
• Block-Based Spectral Processing of Static and Dynamic 3D Meshes using Orthogonal Iterations.

  2018cites this paper
• Courant’s nodal domain theorem for positivity preserving forms

  2017influential citation
• Nodal domains, spectral minimal partitions, and their relation to Aharonov-Bohm operators

  2017influential citation
• Targeting Interventions in Networks

  2017cites this paper
• Graph Signal Processing: Overview, Challenges, and Applications

  2017cites this paper
• Efficient Approximation and Denoising of Graph Signals Using the Multiscale Basis Dictionaries

  2017cites this paper
• C O ] 1 1 Ju l 2 01 3 Nodal geometry of graphs on surfaces

  2017influential citation
• Modularity bounds for clusters located by leading eigenvectors of the normalized modularity matrix

  2016cites this paper
• MODELS FOR SPECTRAL CLUSTERING AND THEIR APPLICATIONS

  2016cites this paper
• Nodal domains of eigenvectors for 1-Laplacian on graphs

  2016cites this paper
• Generalized Laplacian precision matrix estimation for graph signal processing

  2016cites this paper
• Graphs and their real eigenvectors

  2016cites this paper
• A nodal domain theorem and a higher-order Cheeger inequality for the graph $p$-Laplacian

  2016cites this paper
• Nodal domain theorem for the graph p-Laplacian

  2016influential citation
• Spline-Like Wavelet Filterbanks for Multiresolution Analysis of Graph-Structured Data

  2015cites this paper
• Distributed Graph Filters

  2015cites this paper
• Generalized modularity matrices

  2015cites this paper
• Fundamental Properties of the Evolution of Mutational Robustness

  2015cites this paper
• Applied and computational harmonic analysis on graphs and networks

  2015cites this paper
• On the distribution of local extrema in Quantum Chaos

  2015cites this paper
• Zeros of Eigenfunctions of the Schrodinger Operator on Graphs and Their Relation to the Spectrum of the Magnetic Schrodinger Operator

  2014cites this paper
• Rugged and Elementary Landscapes

  2014cites this paper
• How to identify global trends from local decisions? Event region detection on mobile networks

  2014cites this paper
• Ordering trees and graphs with few cycles by algebraic connectivity

  2014cites this paper
• Mathematical Methods in Biology and Neurobiology

  2014cites this paper
• Graph Structured Data Viewed Through a Fourier Lens

  2013cites this paper
• A graph-theoretic algorithm for disturbance localization in large power grids using residue estimation

  2013cites this paper
• Circulant structures and graph signal processing

  2013cites this paper
• Think globally, act locally: On the reshaping of information landscapes

  2013cites this paper
• An Algebraic Analysis of the Graph Modularity

  2013influential citation
• An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian.

  2013cites this paper
• On the sign patterns of the smallest signless Laplacian eigenvector

  2013influential citation
• Zero forcing for sign patterns

  2013influential citation
• The 2, 3, implies the graph is a tree

  2013cites this paper
• Bilateral filter: Graph spectral interpretation and extensions

  2013cites this paper
• A Multiscale Pyramid Transform for Graph Signals

  2013cites this paper
• Signal processing techniques for interpolation in graph structured data

  2013cites this paper
• Multiresolution graph signal processing via circulant structures

  2013cites this paper
• Bipartition of graphs based on the normalized cut and spectral methods

  2012influential citation
• Critically sampled wavelet filterbanks on graphs

  2012cites this paper
• Effect on normalized graph Laplacian spectrum by motif attachment and duplication

  2012cites this paper