Related papers: Heat Kernel and Essential Spectrum of Infinite Gra…
Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…
This paper is an exposition of several questions linking heat kernel measures on infinite dimensional Lie groups, limits associated with critical Sobolev exponents, and Feynmann-Kac measures for sigma models.
In this paper, we demonstrate a useful interaction between the theory of clique partitions, edge clique covers of a graph, and the spectra of graphs. Using a clique partition and an edge clique cover of a graph we introduce the notion of a…
This paper is concerned with the Cauchy problem of a multivalued ordinary differential equation governed by the hypergraph Laplacian, which describes the diffusion of ``heat'' or ``particles'' on the vertices of hypergraph. We consider the…
We consider continuous time simple random walks with arbitrary speed measure $\theta$ on infinite weighted graphs. Write $p_t(x,y)$ for the heat kernel of this process. Given on-diagonal upper bounds for the heat kernel at two points…
We will discuss what it means for a general heat kernel on a metric measure space to be local. We show that the Wiener measure associated to Brownian motion is local. Next we show that locality of the Wiener measure plus a suitable decay…
In this paper, we firstly establish weighted heat kernel comparison theorems for the weighted heat equation on complete manifolds with radial curvatures bounded, and then by mainly using this conclusion, we can obtain two eigenvalue…
We prove a quantitative uncertainty principle at low energies for the Laplacian on fairly general weighted graphs with a uniform explicit control of the constants in terms of geometric quantities. A major step consists in establishing lower…
We derive several upper bounds on the spectral gap of the Laplacian with standard or Dirichlet vertex conditions on compact metric graphs. In particular, we obtain estimates based on the length of a shortest cycle (girth), diameter, total…
We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…
The independence number, coloring number and related parameters are investigated in the setting of oriented hypergraphs using the spectrum of the normalized Laplace operator. For the independence number, both an inertia--like bound and a…
We point out that using the heat kernel on a cone to compute the first quantum correction to the entropy of Rindler space does not yield the correct temperature dependence. In order to obtain the physics at arbitrary temperature one must…
Graph spectral techniques for measuring graph similarity, or for learning the cluster number, require kernel smoothing. The choice of kernel function and bandwidth are typically chosen in an ad-hoc manner and heavily affect the resulting…
The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…
We prove that among all doubly connected domains of $\R^n$ bounded by two spheres of given radii, $Z(t)$, the trace of the heat kernel with Dirichlet boundary conditions, achieves its minimum when the spheres are concentric (i.e., for the…
This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…
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 derive a local Gaussian upper bound for the $f$-heat kernel on complete smooth metric measure space $(M,g,e^{-f}dv)$ with nonnegative Bakry-\'{E}mery Ricci curvature, which generalizes the classic Li-Yau estimate. As applications, we…
In these paper we study the adjacency matrix of some infinite graphs, which we call the shift operator on the $L^p$ space of the graph. In particular, we establish norm estimates, we find the norm for some cases, we decide the triviality of…
Faber-Krahn functions provide lower bounds on the first Dirichlet eigenvalue of the Laplacian and are useful because they imply heat kernel upper bounds. In this paper, we are interested in Faber-Krahn functions and heat kernel estimates…