Related papers: Differences between Robin and Neumann eigenvalues …
Recently Rohleder proposed a new variational approach to an inequality between the Neumann and Dirichlet eigenvalues in the simply connected planar case using the language of classical vector analysis. Writing his approach in terms of…
The third eigenvalue of the Robin Laplacian on a simply-connected planar domain of given area is bounded above by the third eigenvalue of a disjoint union of two disks, provided the Robin parameter lies in a certain range and is scaled in…
Benjamini and Schramm introduced the notion of distributional limit of a sequence of graphs with uniformly bounded valence and studied such limits in the case that the involved graphs are planar. We investigate distributional limits of…
We consider a family of quantum graphs $\{(\Gamma,\mathcal{A}_\varepsilon)\}_{\varepsilon>0}$, where $\Gamma$ is a $\mathbb{Z}^n$-periodic metric graph and the periodic Hamiltonian $\mathcal{A}_\varepsilon$ is defined by the operation…
We introduce a natural notion of mean (or average) distance in the context of compact metric graphs, and study its relation to geometric properties of the graph. We show that it exhibits a striking number of parallels to the reciprocal of…
Given a Riemannian manifold, Weyl's law indicates how the spectrum of the Laplacian behaves asymptotically. Because of that result, there has been a growing interest in finding geometrical bounds compatible with this law. In the case of…
First non-zero Neumann eigenvalues of a rectangle and a parallelogram with the same base and area are compared in case when the height of the parallelogram is greater than the base. This result is applied to compare first non-zero Neumann…
We revisit two papers which appeared in 1999: M.~Hoffmann-Ostenhof, T.~Hoffmann-Ostenhof, and N.~Nadirashvili [Ann. Global Anal. Geom. 17 (1999) 43--48] and T.~Hoff\-mann-Ostenhof, P.~Michor, and N.~Nadirashvili [Geom. Funct. Anal. 9 (1999)…
We consider the Laplacian in a domain squeezed between two parallel hypersurfaces in Euclidean spaces of any dimension, subject to Dirichlet boundary conditions on one of the hypersurfaces and Neumann boundary conditions on the other. We…
We prove an existence result for Robin boundary value problems modeled on \[ \begin{cases} \Delta u + |\nabla u|^2 + \lambda f(x) = 0 & \text{in } \Omega \\ \frac{\partial u}{\partial \nu} + \beta u = 0 & \text{on } \partial\Omega…
In this paper we address the uniqueness issue in the classical Robin inverse problem on a Lipschitz domain $\Omega\subset\RR^n$, with $L^\infty$ Robin coefficient, $L^2$ Neumann data and isotropic conductivity of class $W^{1,r}(\Omega)$,…
We consider a nonlinear eigenvalue problem under Robin boundary conditions in a domain with (possibly noncompact) smooth boundary. The problem involves a weighted p-Laplacian operator and subcritical nonlinearities satisfying…
This article tackles the spectral analysis of the Robin Laplacian on a smooth bounded two-dimensional domain in the presence of a constant magnetic field. In the semiclassical limit, a uniform description of the spectrum located between the…
The spectrum of a graph is closely related to many graph parameters. In particular, the spectral gap of a regular graph which is the difference between its valency and second eigenvalue, is widely seen an algebraic measure of connectivity…
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…
We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy. Equivalently, we represent a graph with a quantum mechanical state and study…
This paper is devoted to a comparison between the normalized first (non-trivial) Neumann eigenvalue $|\Omega| \mu_1(\Omega)$ for a Lipschitz open set $\Omega$ in the plane, and the normalized first (non-trivial) Steklov eigenvalue…
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to…
We prove that each eigenvalue l(k) of the Kirchhoff Laplacian K of a graph or quiver is bounded above by d(k)+d(k-1) for all k in {1,...,n}. Here l(1),...,l(n) is a non-decreasing list of the eigenvalues of K and d(1),..,d(n) is a…
In this paper we extend to non-compact Riemannian manifolds with boundary the use of two important tools in the geometric analysis of compact spaces, namely, the weak maximum principle for subharmonic functions and the integration by parts.…