Related papers: Monotonicity of Steklov eigenvalues on graphs and …
The AHU-algorithm solves the computationally difficult graph isomorphism problem for rooted trees, and does so with a linear time complexity. Although the AHU-algorithm has remained state of the art for almost 50 years, it has been…
We study the Steklov problem on a subgraph with boundary $(\Omega,B)$ of a polynomial growth Cayley graph $\Gamma$. We prove that for each $k \in \mathbb{N}$, the $k^{\mbox{th}}$ eigenvalue tends to $0$ proportionally to…
A recent area of interest is the development and study of eigenvalue problems arising in scattering theory that may provide potential target signatures for use in nondestructive testing of materials. We consider a generalization of the…
We introduce the biharmonic Steklov problem on differential forms by considering suitable boundary conditions. We characterize its smallest eigenvalue and prove elementary properties of the spectrum. We obtain various estimates for the…
In this paper we study Steklov eigenvalues for the Lam\'e operator which arise in the theory of linear elasticity. In this eigenproblem the spectral parameter appears in a Robin boundary condition, linking the traction and the displacement.…
We prove generalized Cheeger inequalities for eigenvalues of Laplacians for reversible Markov chains. Then we apply Hassannezhad and Miclo's convergence result to obtain Jammes Cheeger inequalities for Steklov eigenvalues. In particular, we…
In this paper, some special distance spectral properties of graphs are considered. Concretely, we recursively construct an infinite family of trees with distance eigenvalue $-1$, and determine all $\{C_3,C_4\}$-free connected graphs with…
Using the method of spectral decimation and a modified version of Kirchhoff's Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely…
The scattering process on multiloop infinite p+1-valent graphs (generalized trees) is studied. These graphs are discrete spaces being quotients of the uniform tree over free acting discrete subgroups of the projective group $PGL(2, {\bf…
Using the method of spectral decimation and a modified version of Kirchhoffs Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely…
We show that the discrete versions of the systolic inequality that estimate the number of vertices of a simplicial complex from below have substantial applications to graphs, the one-dimensional simplicial complexes. Almost directly they…
We present monotonicity inequalities for certain functions involving eigenvalues of $p$-Laplacians on signed graphs with respect to $p$. Inspired by such monotonicity, we propose new spectrum-based graph invariants, called (variational)…
In recent decades qualitative inverse scattering methods with eigenvalues as target signatures received much attention. To understand those methods a knowledge on the properties of the related eigenvalue problems is essential. However, even…
In this paper, we study the first two eigenvalues of the buckling problem on spherical domains. We obtain an estimate on the second eigenvalue in terms of the first eigenvalue, which improves one recent result obtained by Wang-Xia in [7].
We study the first nonzero Steklov eigenvalue $\lambda_2(T,\delta\Omega)$ of the Dirichlet-to-Neumann operator on a finite tree $T$ with leaf boundary $\delta\Omega$, under a constraint on the diameter $D$. He and Hua [Calc. Var. PDE, 2022]…
In~\cite{bgs2013}, exclusion sensitivity and exclusion stability for symmetric exclusion processes on graphs were defined as a natural analogue of noise sensitivity and noise stability in this setting. As these concepts were defined for any…
In this paper, we develop the theory of Sobolev spaces on locally finite graphs, including completeness, reflexivity, separability, and Sobolev inequalities. Since there is no exact concept of dimension on graphs, classical methods that…
We consider the weighted eigenvalue problem for a general non-local pseudo-differential operator, depending on a bounded weight function. For such problem, we prove that strict (decreasing) monotonicity of the eigenvalues with respect to…
Using expander graphs, we construct a sequence of smooth compact surfaces with boundary of perimeter N, and with the first non-zero Steklov eigenvalue uniformly bounded away from zero. This answers a question which was raised in [9]. The…
We study the biharmonic Steklov eigenvalue problem on a compact Riemannian manifold $\Omega$ with smooth boundary. We give a computable, sharp lower bound of the first eigenvalue of this problem, which depends only on the dimension, a lower…