中文
相关论文

相关论文: On strong nodal domains for eigenfunctions of Hamm…

200 篇论文

We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relatively little is known about the corresponding eigenvectors. Our…

概率论 · 数学 2009-11-02 Yael Dekel , James R. Lee , Nathan Linial

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…

谱理论 · 数学 2017-01-04 K. C. Chang , Sihong Shao , Dong Zhang

The $n$-dimensional hypercube has $n+1$ distinct eigenvalues $n-2i$, $0\leq i\leq n$, with corresponding eigenspaces $U_i(n)$. In 2021 it was proved by the author that if a function with non-empty support belongs to the direct sum…

组合数学 · 数学 2023-03-21 Alexandr Valyuzhenich

We are interested in the number of nodal domains of eigenfunctions of sub-Laplacians on sub-Riemannian manifolds. Specifically, we investigate the validity of Pleijel's theorem, which states that, as soon as the dimension is strictly larger…

谱理论 · 数学 2024-04-30 Rupert L. Frank , Bernard Helffer

Let $G$ be a graph on $n \ge 3$ vertices, whose adjacency matrix has eigenvalues $\lambda_1 \ge \lambda_2 \ge \dots \ge \lambda_n$. The problem of bounding $\lambda_k$ in terms of $n$ was first proposed by Hong and was studied by Nikiforov,…

组合数学 · 数学 2025-01-14 Sida Li

In 2001, Davies, Gladwell, Leydold, and Stadler proved discrete nodal domain theorems for eigenfunctions of generalized Laplacians, i.e., symmetric matrices with non-positive off-diagonal entries. In this paper, we establish nodal domain…

谱理论 · 数学 2022-10-21 Chuanyuan Ge , Shiping Liu

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…

谱理论 · 数学 2021-11-03 Matthias Hofmann , James B. Kennedy , Delio Mugnolo , Marvin Plümer

The eigenvalues of the Hamming graph $H(n,q)$ are known to be $\lambda_i(n,q)=(q-1)n-qi$, $0\leq i \leq n$. The characterization of equitable 2-partitions of the Hamming graphs $H(n,q)$ with eigenvalue $\lambda_{1}(n,q)$ was obtained by…

组合数学 · 数学 2019-04-01 Ivan Mogilnykh , Alexandr Valyuzhenich

We study an eigenvalue problem for the infinity-Laplacian on bounded domains. We prove the existence of the principal eigenvalue and a corresponding positive eigenfunction. The work also contains existence results when the parameter, in the…

偏微分方程分析 · 数学 2015-10-14 Tilak Bhattacharya , Leonardo Marazzi

We prove that every metric graph which is a tree has an orthonormal sequence of Laplace-eigenfunctions of full support. This implies that the number of nodal domains $\nu_n$ of the $n$-th eigenfunction of the Laplacian with standard…

谱理论 · 数学 2022-01-05 Marvin Plümer , Matthias Täufer

We consider the nonlinear graph $p$-Laplacian and its set of eigenvalues and associated eigenfunctions of this operator defined by a variational principle. We prove a nodal domain theorem for the graph $p$-Laplacian for any $p\geq 1$. While…

谱理论 · 数学 2016-03-15 Francesco Tudisco , Matthias Hein

The Hamming graph $H(n,q)$ is the graph whose vertices are the words of length $n$ over the alphabet $\{0,1,\ldots,q-1\}$, where two vertices are adjacent if they differ in exactly one coordinate. The adjacency matrix of $H(n,q)$ has $n+1$…

组合数学 · 数学 2020-03-04 Alexandr Valyuzhenich

In 2001, Davies, Gladwell, Leydold, and Stadler proved discrete nodal domain theorems for eigenfunctions of generalized Laplacians. In 2019, Jost and Mulas generalized the normalized combinatorial Laplace operator of graphs to signed…

组合数学 · 数学 2022-10-26 Lei Zhang , Yaoping Hou

We study the nodal set of the Steklov eigenfunctions on the boundary of a smooth bounded domain in $\mathbb{R}^n$ - the eigenfunctions of the Dirichlet-to-Neumann map. Under the assumption that the domain $\Omega$ is $C^2$, we prove a…

偏微分方程分析 · 数学 2014-02-19 Katarina Bellova , Fanghua Lin

We discuss the asymptotic lower bound on the inner radius of nodal domains that arise from Laplacian eigenfunctions $ \phi_\lambda $ on a closed Riemannian manifold $ (M,g) $. First, in the real-analytic case we present an improvement of…

偏微分方程分析 · 数学 2016-07-14 Bogdan Georgiev

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…

For given $\Delta>0$ and $0<\lambda<3/\sqrt{2}$, we show that the maximum multiplicity that $\lambda$ can appear as the second largest eigenvalue of a connected graph with maximum degree at most $\Delta$ is $O_{\Delta,\lambda}(1)$. This…

组合数学 · 数学 2025-07-15 Chuanyuan Ge , Shiping Liu

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…

数学物理 · 物理学 2013-11-21 Gregory Berkolaiko

We study a $(k+1)$-dimensional hyperbolic space of a negative constant sectional curvature $\kappa=-1/\rho^2$. Let $\lambda$ be a real eigenvalue and $f_{\lambda} (x)$ be an eigenfunction of the hyperbolic Laplacian assuming a non-zero…

微分几何 · 数学 2019-02-26 Sergei Artamoshin

We study functions defined on the vertices of the Hamming graphs $H(n,q)$. The adjacency matrix of $H(n,q)$ has $n+1$ distinct eigenvalues $n(q-1)-q\cdot i$ with corresponding eigenspaces $U_{i}(n,q)$ for $0\leq i\leq n$. In this work, we…

组合数学 · 数学 2021-11-29 Alexandr Valyuzhenich , Konstantin Vorob'ev
‹ 上一页 1 2 3 10 下一页 ›