The Number of Nodal Domains on Quantum Graphs as a Stability Index of Graph Partitions

Ram Band, Gregory Berkolaiko, Hillel Raz, Uzy Smilansky

Research output: Contribution to journalArticlepeer-review

Abstract

The Courant theorem provides an upper bound for the number of nodal domains of eigenfunctions of a wide class of Laplacian-type operators. In particular, it holds for generic eigenfunctions of a quantum graph. The theorem stipulates that, after ordering the eigenvalues as a non decreasing sequence, the number of nodal domains ν n of the n th eigenfunction satisfies n ≥ ν n. Here, we provide a new interpretation for the Courant nodal deficiency d n = n - ν n in the case of quantum graphs. It equals the Morse index - at a critical point - of an energy functional on a suitably defined space of graph partitions. Thus, the nodal deficiency assumes a previously unknown and profound meaning - it is the number of unstable directions in the vicinity of the critical point corresponding to the n th eigenfunction. To demonstrate this connection, the space of graph partitions and the energy functional are defined and the corresponding critical partitions are studied in detail.

Original languageEnglish
Pages (from-to)815-838
Number of pages24
JournalCommunications in Mathematical Physics
Volume311
Issue number3
DOIs
StatePublished - May 2012

All Science Journal Classification (ASJC) codes

  • Statistical and Nonlinear Physics
  • Mathematical Physics

Fingerprint

Dive into the research topics of 'The Number of Nodal Domains on Quantum Graphs as a Stability Index of Graph Partitions'. Together they form a unique fingerprint.

Cite this