Related papers: On Agmon metrics and exponential localization for …
A fundamental problem in pattern avoidance is describing the asymptotic behavior of the extremal function and its generalizations. We prove an equivalence between the asymptotics of the graph extremal function for a class of bipartite…
On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap $\lambda_2 - \lambda_1$ is established, with a constant that depends…
In the limit epsilon to 0 we analyze the generators H_epsilon of families of reversible jump processes in R^d associated with a class of symmetric non-local Dirichlet-forms and show exponential decay of the eigenfunctions. The exponential…
Mathematical analysis of the Anderson localization has been facilitated by the use of suitable fractional moments of the Green function. Related methods permit now a readily accessible derivation of a number of physical manifestations of…
The finite element method(FEM) is applied to bound leading eigenvalues of Laplace operator over polygonal domain. Compared with classical numerical methods, most of which can only give concrete eigenvalue bounds over special domain of…
The recent theory of graph limits gives a powerful framework for understanding the properties of suitable (convergent) sequences $(G_n)$ of graphs in terms of a limiting object which may be represented by a symmetric function $W$ on…
Radiative corrections to an atom are calculated near a half-space that has arbitrarily-shaped small depositions upon its surface. The method is based on calculation of the classical Green's function of the macroscopic Maxwell equations near…
In this note, we improve the lower bounds for the maximum size of the $k$th largest eigenvalue of the adjacency matrix of a graph for several values of $k$. In particular, we show that closed blowups of the icosahedral graph improve the…
Let $(M,g)$ be a two-dimensional compact boundaryless Riemannian manifold with nonpostive curvature, then we shall give improved estimates for the $L^2$-norms of the restrictions of eigenfunctions to unit-length geodesics, compared to the…
An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…
For first order systems, we obtain an efficient bound on the exponential decay of an eigenfunction in terms of the distance between the corresponding eigenvalue and the essential spectrum. As an example, the Dirac operator is considered.
We study the first eigenvalue of the $p-$Laplacian (with $1<p<\infty$) on a quantum graph with Dirichlet or Kirchoff boundary conditions on the nodes. We find lower and upper bounds for this eigenvalue when we prescribe the total sum of the…
We extend the quantum-feature kernel framework, which relies on measurements of graph-dependent observables, along three directions. First, leveraging neutral-atom quantum processing units (QPUs), we introduce a scheme that incorporates…
This work proposes a framework LGKDE that learns kernel density estimation for graphs. The key challenge in graph density estimation lies in effectively capturing both structural patterns and semantic variations while maintaining…
We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…
We define a number of natural (from geometric and combinatorial points of view) deformation spaces of valuations on finite graphs, and study functions over these deformation spaces. These functions include both direct metric invariants…
This paper studies the Laplacian spectrum and the average effective resistance of (large) graphs that are sampled from graphons. Broadly speaking, our main finding is that the Laplacian eigenvalues of a large dense graph can be effectively…
In recent papers it has been demonstrated that sampling a Gibbs distribution from an appropriate time-irreversible Langevin process is, from several points of view, advantageous when compared to sampling from a time-reversible one. Adding…
The concept and the construction of modular graph functions are generalized from genus-one to higher genus surfaces. The integrand of the four-graviton superstring amplitude at genus-two provides a generating function for a special class of…
We propose a new type of approximate counting algorithms for the problems of enumerating the number of independent sets and proper colorings in low degree graphs with large girth. Our algorithms are not based on a commonly used Markov chain…