On strong nodal domains for eigenfunctions of Hamming graphs

The eigenvectors for graph $1$-Laplacian possess some sort of localization property: On one hand, any nodal domain of an eigenvector is again an eigenvector with the same eigenvalue; on the other hand, one can pack up an eigenvector for a new graph by several fundamental eigencomponents and modules with the same eigenvalue via few special techniques. The Courant nodal domain theorem for graphs is extended to graph $1$-Laplacian for strong nodal domains, but for weak nodal dom...

In this paper we find new maximal cliques of size $\frac{q+1}{2}$ or $\frac{q+3}{2}$, accordingly as $q\equiv 1(4)$ or $q\equiv 3(4)$, in Paley graphs of order $q^2$, where $q$ is an odd prime power. After that we use new cliques to define a family of eigenfunctions corresponding to both non-principal eigenvalues and having the cardinality of support $q+1$, which is the minimum by the weight-distribution bound.

The purpose of the present manuscript is to collect known results and present some new ones relating to nodal domains on graphs, with special emphasize on nodal counts. Several methods for counting nodal domains will be presented, and their relevance as a tool in spectral analysis will be discussed.

Let $G$ be a random $d$-regular graph. We prove that for every constant $\alpha > 0$, with high probability every eigenvector of the adjacency matrix of $G$ with eigenvalue less than $-2\sqrt{d-2}-\alpha$ has $\Omega(n/$polylog$(n))$ nodal domains.

We establish metric graph counterparts of Pleijel's theorem on the asymptotics of the number of nodal domains $\nu_n$ of the $n$-th eigenfunction(s) of a broad class of operators on compact metric graphs, including Schr\"odinger operators with $L^1$-potentials and a variety of vertex conditions as well as the $p$-Laplacian with natural vertex conditions, and without any assumptions on the lengths of the edges, the topology of the graph, or the behaviour of the eigenfunctions ...

This is an expository article based on my lectures on eigenfunctions of the Laplacian for the 2013 IAS/Park City Mathematics Institute (PCMI) summer school in geometric analysis. Many of the results are based on joint work with H. Christianson, J. Jung, C. Sogge, and J. Toth.

We present and discuss isospectral quantum graphs which are not isometric. These graphs are the analogues of the isospectral domains in R2 which were introduced recently and are all based on Sunada's construction of isospectral domains. After presenting some of the properties of these graphs, we discuss a few examples which support the conjecture that by counting the nodal domains of the corresponding eigenfunctions one can resolve the isospectral ambiguity.

Let $P$ be a bounded $n$-dimensional Lipschitz polytope, and let $\varphi_{\lambda}$ be a Dirichlet Laplace eigenfunction in $P$ corresponding to the eigenvalue $\lambda$. We show that the $(n-1)$-dimensional Hausdorff measure of the nodal set of $\varphi_{\lambda}$ does not exceed $C(P)\sqrt{\lambda}$. Our result extends the previous ones in quaisconvex domains (including $C^1$ and convex domains) to general polytopes that are not necessarily quasiconvex.

We consider a sparse random subraph of the $n$-cube where each edge appears independently with small probability $p(n) =O(n^{-1+o(1)})$. In the most interesting regime when $p(n)$ is not exponentially small we prove that the largest eigenvalue of the graph is asymtotically equal to the square root of the maximum degree.

According to Courant's theorem, an eigenfunction as\-sociated with the $n$-th eigenvalue $\lambda\_n$ has at most $n$ nodal domains. A footnote in the book of Courant and Hilbert, states that the same assertion is true for any linear combination of eigenfunctions associated with eigenvalues less than or equal to $\lambda\_n$. We call this assertion the \emph{Extended Courant Property}.\smallskipIn this paper, we propose simple and explicit examples for which the extended Cour...