Related papers: Sharp Davies-Gaffney-Grigor'yan Lemma on Graphs

Let $G$ be a simple, finite graph and let $p_t(x,y)$ denote the heat kernel on $G$. The purpose of this short note is to show that for $t \rightarrow 0^+$ $$ p_t(x,y) = \# \left\{\mbox{paths of…

In this paper, we prove two-sided heat kernel estimates on what we call "book-like" graphs. These are graphs consisting of pieces that satisfy the parabolic Harnack inequality that are glued together in a sufficiently nice way over a…

A graph $ G $ is minimally $ t $-tough if the toughness of $ G $ is $ t $ and deletion of any edge from $ G $ decreases its toughness. Katona et al. conjectured that the minimum degree of any minimally $ t $-tough graph is $ \lceil 2t\rceil…

Graphene is a zero-gap semiconductor, where the electrons propagating inside are described by the ultra-relativistic Dirac equation normally reserved for very high energy massless particles. In this work, we show that graphene under a…

It is well known that Nash-type inequalities for symmetric Dirichlet forms are equivalent to on-diagonal heat kernel upper bounds for the associated symmetric Markov semigroups. In this paper, we show that both imply (and hence are…

Using the theory of $L^p$-graphons (Borgs et al, 2014), we derive and rigorously justify the continuum limit for systems of differential equations on sparse random graphs. Specifically, we show that the solutions of the initial value…

We introduce a sub-Riemannian analogue of the Bence-Merriman-Osher diffusion driven algorithm and show that it leads to weak solutions of the horizontal mean curvature flow of graphs over sub-Riemannian Carnot groups. The proof follows the…

In this paper we consider kernelization for problems on d-degenerate graphs, i.e. graphs such that any subgraph contains a vertex of degree at most $d$. This graph class generalizes many classes of graphs for which effective kernelization…

For an edge-colored graph $G$, the minimum color degree of $G$ means the minimum number of colors on edges which are adjacent to each vertex of $G$. We prove that if $G$ is an edge-colored graph with minimum color degree at least $5$ then…

We apply the Davies method to give a quick proof for upper estimate of the heat kernel for the non-local Dirichlet form on the ultra-metric space. The key observation is that the heat kernel of the truncated Dirichlet form vanishes when two…

Delaunay and Gabriel graphs are widely studied geometric proximity structures. Motivated by applications in wireless routing, relaxed versions of these graphs known as \emph{Locally Delaunay Graphs} ($LDGs$) and \emph{Locally Gabriel…

The main result of this paper is a Pfaffian formula for the partition function of the dimer model on a graph G embedded in a closed, possibly non-orientable surface S. This formula is suitable for computational purposes, and it is obtained…

We demonstrate a relationship between the heat kernel on a finite weighted Abelian Cayley graph and Gaussian functions on lattices. This can be used to prove a new inequality for the heat kernel on such a graph: when $t \leq t'$,…

A procedure called \textit{graph burning} was introduced to facilitate the modelling of spread of an alarm, a social contagion, or a social influence or emotion on graphs and networks. Graph burning runs on discrete time-steps (or rounds).…

The closure of a graph $G$ is the graph $G^*$ obtained from $G$ by repeatedly adding edges between pairs of non-adjacent vertices whose degree sum is at least $n$, where $n$ is the number of vertices of $G$. The well-known Closure Lemma…

We study the heat content for Laplacians on compact, finite metric graphs with Dirichlet conditions imposed at the "boundary" (i.e., a given set of vertices). We prove a closed formula of combinatorial flavour, as it is expressed as a sum…

In this paper, we study the graph classification problem in vertex-labeled graphs. Our main goal is to classify the graphs comparing their higher-order structures thanks to heat diffusion on their simplices. We first represent…

We prove sharp estimates of the heat kernel associated with Fourier-Dini expansions on $(0,1)$ equipped with Lebesgue measure and the Neumann condition imposed on the right endpoint. Then we give several applications of this result…

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…

This paper introduces a novel graph signal processing framework for building graph-based models from classes of filtered signals. In our framework, graph-based modeling is formulated as a graph system identification problem, where the goal…