Related papers: Heat Kernel and Essential Spectrum of Infinite Gra…
In this note we apply heat kernels to derive some localization formula in sympletcic geometry, to study moduli spaces of flat connections on a Riemann surface, to obtain the push-forward measures for certain maps between Lie groups and to…
In this thesis we deal with spectral invariants for polygons and closed orbisurfaces of constant Gaussian curvature. In each case our method is to study the heat kernel and the asymptotic expansion of the heat trace. First, we investigate…
Effective graph resistance is a fundamental structural metric in network science, widely used to quantify global connectivity, compare network architectures, and assess robustness in flow-based systems. Despite its importance, current…
We study the discrete Gel'fand's inverse boundary spectral problem of determining a finite weighted graph. Suppose that the set of vertices of the graph is a union of two disjoint sets: $X=B\cup G$, where $B$ is called the set of the…
Finite temperature quantum field theory in the heat kernel method is used to study the heat capacity of condensed matter. The lattice heat is treated a la P. Debye as energy of the elastic (sound) waves. The dimensionless functional of free…
By a discrete torus we mean the Cayley graph associated to a finite product of finite cycle groups with generating set given by choosing a generator for each cyclic factor. In this article we study the spectral theory of the combinatorial…
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…
In this paper, we investigate some properties of the Perron vector of connected graphs. These results are used to characterize that all extremal connected graphs with having the minimum (maximum) spectra radius among all connected graphs of…
Quantum graphs are defined by having a Laplacian defined on the edges of a metric graph with boundary conditions on each vertex such that the resulting operator, $\mathbf{L}$, is self-adjoint. We use Neumann boundary conditions although we…
We prove a bound on the heat trace of the Neumann Laplacian on a convex domain that captures the first two terms in its small-time expansion, but is valid for all times and depends on the underlying domain only through very simple geometric…
We give sharp asymptotic estimates at infinity of all radial partial derivatives of the heat kernel on H-type groups. As an application, we give a new proof of the discreteness of the spectrum of some natural sub-Riemannian…
The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and…
We provide general lower and upper bounds for Laplace Dirichlet heat kernel of convex $\mathcal C^{1,1}$ domains. The obtained estimates precisely describe the exponential behaviour of the kernels, which has been known only in a few special…
We consider the dynamics on a quantum graph as the limit of the dynamics generated by a one-particle Hamiltonian in R^2 with a potential having a deep strict minimum on the graph, when the width of the well shrinks to zero. For a generic…
We study kernelization of classic hard graph problems when the input graphs fulfill triadic closure properties. More precisely, we consider the recently introduced parameters closure number $c$ and the weak closure number $\gamma$ [Fox et…
The spectral analysis of the electromagnetic field on the background of a infinitely thin flat plasma layer is carried out. This model is loosely imitating a single base plane from graphite and it is of interest for theoretical studies of…
The spectral properties of the Laplacian on a class of quantum graphs with random metric structure are studied. Namely, we consider quantum graphs spanned by the simple $\ZZ^d$-lattice with $\delta$-type boundary conditions at the vertices,…
We establish Gaussian-type upper bounds on the heat kernel for a continuous-time random walk on a graph with unbounded weights under an ergodicity assumption. For the proof we use Davies' perturbation method, where we show a maximal…
Many contemporary statistical learning methods assume a Euclidean feature space. This paper presents a method for defining similarity based on hyperspherical geometry and shows that it often improves the performance of support vector…
We analytically calculate the energy spectrum of a circular graphene quantum dot with radius R subjected to a perpendicular magnetic field B by applying the infinite-mass boundary condition. We can retrieve well-known limits for the cases…