Related papers: On Agmon metrics and exponential localization for …
We study the growth of Laplacian eigenfunctions $ -\Delta \phi_k = \lambda_k \phi_k$ on compact manifolds $(M,g)$. H\"ormander proved sharp polynomial bounds on $\| \phi_k\|_{L^{\infty}}$ which are attained on the sphere. On a `generic'…
We study self-consistent static solutions for an Einstein universe in a graph-based induced gravity. In the generalization of the deconstruction model based on the graph, the eigenvalues of the graph Laplacian and the adjacent matrix gives…
We study the fluctuation behavior of individual eigenvalues of kernel matrices arising from dense graphon-based random graphs. Under minimal integrability and boundedness assumptions on the graphon, we establish distributional limits for…
We study the relation between the growth rate of a graph property and the entropy of the graph limits that arise from graphs with that property. In particular, for hereditary classes we obtain a new description of the colouring number,…
We study the effect of random scattering in quantum walks on a finite graph and compare it with the effect of repeated measurements. To this end, a constructive approach is employed by introducing a localized and a delocalized basis for the…
We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…
Sharp bounds on the least eigenvalue of an arbitrary graph are presented. Necessary and sufficient (just sufficient) conditions for the lower (upper) bound to be attained are deduced using edge clique partitions. As an application, we prove…
We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the Omega(sqrt(N)) classical lower bound. For testing expansion,…
We prove that the maximum eigenvalue of the (both signed and unsigned) Laplacian of level $k$ Kikuchi graph of any graph $G$ with $m$ edges is at most $m+k$. This confirms four recent conjectures of Apte, Parekh, and Sud. As applications,…
A new method is introduced for bounding the separation between the value of $-k$ and the smallest eigenvalue of a non-bipartite $k$-regular graph. The method is based on fractional decompositions of graphs. As a consequence we obtain a very…
Analysis of non-compact manifolds almost always requires some controlled behavior at infinity. Without such, one neither can show, nor expect, strong properties. On the other hand, such assumptions restrict the possible applications and…
The individualization-refinement paradigm provides a strong toolbox for testing isomorphism of two graphs and indeed, the currently fastest implementations of isomorphism solvers all follow this approach. While these solvers are fast in…
In 1993 Hong asked what are the best bounds on the $k$'th largest eigenvalue $\lambda_{k}(G)$ of a graph $G$ of order $n$. This challenging question has never been tackled for any $2<k<n$. In the present paper tight bounds are obtained for…
We consider a family of manifolds with a class of degenerating warped product metrics $g_\epsilon=\rho(\epsilon,t)^{2a}dt^2 +\rho(\epsilon,t)^{2b}ds_M^2$, with $M$ compact, $\rho$ homogeneous degree one, $a \le -1$ and $b > 0$. We study the…
We study eigenvalue distribution of the adjacency matrix $A^{(N,p, \alpha)}$ of weighted random bipartite graphs $\Gamma= \Gamma_{N,p}$. We assume that the graphs have $N$ vertices, the ratio of parts is $\frac{\alpha}{1-\alpha}$ and the…
We review the application of the notion of local convergence on locally finite randomly rooted graphs, known as Benjamini-Schramm convergence, to the calculation of the global eigenvalue density of random matrices from the beta-Gaussian and…
We present an efficient quantum algorithm to measure the average fidelity decay of a quantum map under perturbation using a single bit of quantum information. Our algorithm scales only as the complexity of the map under investigation, so…
McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs. More precisely, given a large…
Let a fourth and a second order evolution equations be coupled via the interface by transmission conditions, and suppose that the first one is stabilized by a localized distributed feedback. What will then be the effect of such a partial…
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…