On the connection between the number of nodal domains on quantum graphs and the stability of graph partitions

Physics – Mathematical Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

22 pages, 6 figures

Scientific paper

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 quantum graph. The theorem stipulates that, after ordering the eigenvalues as a non decreasing sequence, the number of nodal domains $\nu_n$ of the $n$-th eigenfunction satisfies $n\ge \nu_n$. Here, we provide a new interpretation for the Courant nodal deficiency $d_n = n-\nu_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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the connection between the number of nodal domains on quantum graphs and the stability of graph partitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the connection between the number of nodal domains on quantum graphs and the stability of graph partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the connection between the number of nodal domains on quantum graphs and the stability of graph partitions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-81920

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.