Related papers: Optimization of the lowest eigenvalue for leaky st…
The Sturm-Liouville operator on a star-shaped graph is considered. We assume that the potential is known a priori on all the edges except one, and study the partial inverse problem, which consists in recovering the potential on the…
We study spectra of alloy-type random Schr\"odinger operators on metric graphs. For finite edge subsets of general graphs we prove a Wegner estimate which is linear in the volume (i.e. the number of edges) and the length of the considered…
We work in the setting of infinite, not necessarily locally finite, weighted graphs. We give a sufficient condition for the essential self-adjointness of (discrete) Schr\"odinger operators $\mathcal{L}_{V}$ that are not necessarily lower…
The inverse spectral problems are studied for the Sturm-Liouville operator on the star-shaped graph and for the matrix Sturm-Liouville operator with the boundary condition in the general self-adjoint form. We obtain necessary and sufficient…
In this paper we study absence of embedded eigenvalues for Schr\"odinger operators on non-compact connected Riemannian manifolds. A principal example is given by a manifold with an end (possibly more than one) in which geodesic coordinates…
This paper deals with the approximation of a magnetic Schr\"odinger operator with a singular $\delta$-potential that is formally given by $(i \nabla + A)^2 + Q + \alpha \delta_\Sigma$ by Schr\"odinger operators with regular potentials in…
We consider the following eigenvalue optimization problem: Given a bounded domain $\Omega\subset\R^n$ and numbers $\alpha\geq 0$, $A\in [0,|\Omega|]$, find a subset $D\subset\Omega$ of area $A$ for which the first Dirichlet eigenvalue of…
We consider one dimensional Schr\"{o}dinger operators $H_\lambda=-\frac{d^2}{dx^2}+U+ \lambda V_\lambda$ with nonlinear dependence on the parameter $\lambda$ and study the small $\lambda$ behaviour of eigenvalues. The potentials $U$ and…
We describe a new approximation algorithm for Max Cut. Our algorithm runs in $\tilde O(n^2)$ time, where $n$ is the number of vertices, and achieves an approximation ratio of $.531$. On instances in which an optimal solution cuts a…
We consider the Schr\"odinger operator on zigzag graphs with a periodic potential. The spectrum of this operator consists of an absolutely continuous part (intervals separated by gaps) plus an infinite number of eigenvalues with infinite…
We study the convergence of the Riemannian steepest descent algorithm on the Grassmann manifold for minimizing the block version of the Rayleigh quotient of a symmetric matrix. Even though this problem is non-convex in the Euclidean sense…
In this work, we prove a $\tilde{\Omega}(\lg^{3/2} n )$ unconditional lower bound on the maximum of the query time and update time for dynamic data structures supporting reachability queries in $n$-node directed acyclic graphs under edge…
Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq 3$, and denote the eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We prove that the…
We consider Schroedinger operators with a random potential of alloy type on infinite metric graphs which obey certain uniformity conditions. For single site potentials of fixed sign we prove that the random Schroedinger operator restricted…
The celebrated Cheeger's Inequality establishes a bound on the edge expansion of a graph via its spectrum. This inequality is central to a rich spectral theory of graphs, based on studying the eigenvalues and eigenvectors of the adjacency…
A one-by-one exhaustion is a combinatorial/geometric condition which excludes eigenvalues from the spectra of Laplace and Schr\"odinger operators on graphs. Isoperimetric inequalities in graphs with a cocompact automorphism group provide an…
Two classical upper bounds on the Shannon capacity of graphs are the $\vartheta$-function due to Lov\'asz and the minrank parameter due to Haemers. We provide several explicit constructions of $n$-vertex graphs with a constant…
In graph signal processing, data samples are associated to vertices on a graph, while edge weights represent similarities between those samples. We propose a convex optimization problem to learn sparse well connected graphs from data. We…
We develop criteria based on a calibration argument via discrete PDE and semidiscrete optimal transport, for finding sharp isoperimetric inequalities of the form $(\sharp \Omega)^{d-1} \le C (\sharp \overrightarrow{\partial\Omega})^d$ where…
The graph isomorphism problem looks deceptively simple, but although polynomial-time algorithms exist for certain types of graphs such as planar graphs and graphs with bounded degree or eigenvalue multiplicity, its complexity class is still…