Related papers: On Agmon metrics and exponential localization for …

We give a delocalization estimate for eigenfunctions of the discrete Laplacian on large $d+1$-regular graphs, showing that any subset of the graph supporting $\epsilon$ of the $L^2$ mass of an eigenfunction must be large. For graphs…

Quantum computers can sometimes exponentially outperform classical ones, but only for problems with sufficient structure. While it is well known that query problems with full permutation symmetry can have at most polynomial quantum speedup…

We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…

We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…

We study planar graphs with large negative curvature outside of a finite set and the spectral theory of Schr{\"o}dinger operators on these graphs. We obtain estimates on the first and second order term of the eigenvalue asymptotics.…

We study the adjacency matrices of random $d$-regular graphs with large but fixed degree $d$. In the bulk of the spectrum $[-2\sqrt{d-1}+\varepsilon, 2\sqrt{d-1}-\varepsilon]$ down to the optimal spectral scale, we prove that the Green's…

We consider several semidefinite programming relaxations for the max-$k$-cut problem, with increasing complexity. The optimal solution of the weakest presented semidefinite programming relaxation has a closed form expression that includes…

This paper investigates the upper bound of the integral of $L^2$-normalized joint eigenfunctions over geodesics in a two-dimensional quantum completely integrable system. For admissible geodesics, we rigorously establish an asymptotic decay…

For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…

We study the semiclassical behaviour of eigenfunctions of quantum systems with ergodic classical limit. By the quantum ergodicity theorem almost all of these eigenfunctions become equidistributed in a weak sense. We give a simple derivation…

We study solutions of $-\Delta u + V u = \lambda u$ on $\mathbb{R}^n$. Such solutions localize in the `allowed' region $\left\{x \in \mathbb{R}^n: V(x) \leq \lambda\right\}$ and decay exponentially in the `forbidden' region $\left\{x \in…

We study $\ell^\infty$ norms of $\ell^2$-normalized eigenfunctions of quantum cat maps. For maps with short quantum periods (constructed by Bonechi and de Bi\`evre), we show that there exists a sequence of eigenfunctions $u$ with…

We prove spectral localization for infinite metric graphs with a self-adjoint Laplace operator and a random potential. To do so we adapt the multiscale analysis (MSA) from the R^d-case to metric graphs. In the MSA a covering of the graph is…

In this thesis, we study Laplacian eigenfunctions on metric graphs, also known as quantum graphs. We restrict the discussion to standard quantum graphs. These are finite connected metric graphs with functions that satisfy Neumann vertex…

The behavior of Laplacian eigenfunctions in domains with branches is investigated. If an eigenvalue is below a threshold which is determined by the shape of the branch, the associated eigenfunction is proved to exponentially decay inside…

On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…

Laplace operators on metric graphs give rise to Klein-Gordon and wave operators. Solutions of the Klein-Gordon equation and the wave equation are studied and finite propagation speed is established. Massive, free quantum fields are then…

We examine diagonal combs, a recently identified class of infinite metric graphs whose properties depend on one parameter. These graphs exhibit a fascinating regime where they possess infinite volume while maintaining purely discrete…

We introduce a novel quantum algorithm for determining graph connectedness using a constant number of measurements. The algorithm can be extended to find connected components with a linear number of measurements. It relies on non-unitary…

In this paper, we prove a variant of the Burger-Brooks transfer principle which, combined with recent eigenvalue bounds for surfaces, allows to obtain upper bounds on the eigenvalues of graphs as a function of their genus. More precisely,…