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

The burning number of a graph $G$ is the smallest number $b$ such that the vertices of $G$ can be covered by balls of radii $0, 1, \dots, b-1$. As computing the burning number of a graph is known to be NP-hard, even on trees, it is natural…

We study the extremal energy problem for complex unit gain graphs whose underlying graph is the dumbbell graph $D_{r,s,\ell}$. Using switching equivalence, we reduce the spectrum to the real parts of the two cycle gains and obtain an…

We consider the Minimum Coverage Kernel problem: given a set $B$ of $d$-dimensional boxes, find a subset of $B$ of minimum size covering the same region as $B$. This problem is $\mathsf{NP}$-hard, but as for many $\mathsf{NP}$-hard problems…

We establish two-sided Gaussian bounds on the heat kernel of divergence-form parabolic equation with singular time-inhomogeneous vector field satisfying some minimal assumptions.

Davies' method of perturbed semigroups is a classical technique to obtain off-diagonal upper bounds on the heat kernel. However Davies' method does not apply to anomalous diffusions due to the singularity of energy measures. In this note,…

We study the spectral aspects of the graph limit theory. We give a description of graphon convergence in terms of converegnce of eigenvalues and eigenspaces. Along these lines we prove a spectral version of the strong regularity lemma.…

The Chapman-Enskog method, in combination with the quantum maximum entropy principle, is applied to the Wigner equation in order to obtain quantum Navier-Stokes equations for electrons in graphene in the isothermal case. The derivation is…

We prove the discrete Lusternik-Schnirelmann theorem telling that tcat(G) less or equal to crit(G) for a general simple graph G=(V,E). It relates the minimal number tcat(G) of in G contractible graphs covering G, with crit(G), the minimal…

The toughness $t(G)$ of a graph $G=(V,E)$ is defined as $t(G)=\min\{\frac{|S|}{c(G-S)}\}$, in which the minimum is taken over all $S\subset V$ such that $G-S$ is disconnected, where $c(G-S)$ denotes the number of components of $G-S$. We…

Let $G=(V(G),E(G))$ be a simple graph, where $V(G)$ and $E(G)$ are the vertex set and the edge set of $G$, respectively. The number of components of $G$ is denoted by $c(G)$. Let $t$ be a positive real number, and a connected graph $G$ is…

We use the combination of ideas and results from the theory of graph limits and nonlinear evolution equations to provide a rigorous mathematical justification for taking continuum limit for certain nonlocally coupled networks and to extend…

In this paper, we will establish an elliptic local Li-Yau gradient estimate for weak solutions of the heat equation on metric measure spaces with generalized Ricci curvature bounded from below. One of its main applications is a sharp…

Let $G=(V, E)$ be a locally finite connected graph satisfying curvature-dimension conditions ($CDE(n, 0)$ or its strengthened version $CDE'(n, 0))$) and polynomial volume growth conditions of degree $m$. We systematically establish sharp…

In this work, we introduce novel algorithms for label propagation and self-training using fractional heat kernel dynamics with a source term. We motivate the methodology through the classical correspondence of information theory with the…

We prove a general theorem on cutoffs for symmetric simple exclusion processes on graphs with open boundaries, under the natural assumption that the graphs converge geometrically and spectrally to a compact metric measure space with…

Let $\kappa'(G)$ be the edge connectivity of $G$ and $G\times H$ the direct product of $G$ and $H$. Let $H$ be an arbitrary dense graph with minimal degree $\delta(H)>|H|/2$. We prove that for any graph $G$, $\kappa'(G\times…

Let $\Gamma$ be a metric graph having a linear system $g^r_{2r}$ for some $2 \leq r \leq g-2$ then $\Gamma$ has a linear system $g^1_2$. This is similar to the well-known Clifford's Theorem from the theory of linear systems on smooth…

Given a real reductive group $G$, the purpose of this paper is to show an asymptotic formula of the large-time behavior of the $G$-trace of the heat operator on the associated symmetric spaces. Together with Carmona's proof on Vogan's…

Let $t$ be a positive real number. A graph is called $t$-tough if the removal of any vertex set $S$ that disconnects the graph leaves at most $|S|/t$ components, and all graphs are considered 0-tough. The toughness of a graph is the largest…

Starting from pointwise gradient estimates for the heat semigroup, we study three characterizations of weak lower curvature bounds on metric graphs. More precisely, we prove the equivalence between a weak notion of the Bakry-\'Emery…