Abstract
We derive Gaussian heat kernel bounds on graphs with respect to a fixed origin for large times under the assumption of a Sobolev inequality and volume doubling on large balls. The main result is then applied to anti-trees with unbounded vertex degree, yielding Gaussian upper bounds for this class of graphs for the first time. In order to prove this, we show that isoperimetric estimates with respect to intrinsic metrics yield Sobolev inequalities. Finally, we prove that anti-trees are Ahlfors regular and that they satisfy an isoperimetric inequality of a larger dimension.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
The focus of the present note lies on Gaussian upper bounds for heat kernels on graphs with possibly unbounded geometry. Seminal works go back to Davies and Delmotte for graphs with bounded geometry, [6, 8]. In contrast, we will be dealing with graphs which do not satisfy any a priori boundedness assumption on the local geometry of the graph. First results in this direction have been obtained in [1,2,3, 5, 9]. Recently, the authors obtained Gaussian bounds for heat kernels for large times on graphs with unbounded geometry. The assumptions include Sobolev inequalities and volume doubling in large balls in terms of intrinsic metrics [17].
Here, we derive anchored Gaussian upper bounds of the heat kernel p of locally finite weighted discrete graphs over a discrete measure space (X, m), cf. Sect. 2. Applied to anti-trees, our results yield for the first time Gaussian upper bounds for their heat kernels and, hence, provide explicit examples of graphs with unbounded vertex degree.
Concerning our general results about heat kernels, assume that the graph b over (X, m) is equipped with an intrinsic metric \(\rho \) of jump size one, and let \(o\in X\) be the anchor, or root vertex. Suppose all large balls about o fulfill the Sobolev inequality and the volume doubling property. Theorem 2.1 states that for all \(x,y\in X\) and \(t> 0\) large
The function \(\zeta _1\) is optimal as observed by Davies and satisfies
meaning that the fraction of the left- and right-hand side converges to one. The function \(f_o\) measures the unboundedness of the geometry with respect to o, incorporating the distance from x and y. The function \(f_o\) is bounded if m is the normalizing measure or weighted \(L^p\)-means of the vertex degree and inverted measure about o grow at most exponentially.
The above statements require Sobolev and volume doubling for all large balls. Our main result Theorem 2.1 even yields a localized version involving the spectral bottom of the Laplacian. To the best of our knowledge, this is the first variant of this result in this form on graphs.
For degenerating parabolic equations in \(\mathbb {R}^n\), Zhikov imposed conditions at the origin and derived off-diagonal Gaussian upper bounds, [20]. A similar approach was used for elliptic operators on \(\mathbb {Z}^n\) with unbounded but integrable weights in [1, 18]. However, the latter articles do not provide the optimal Gaussian estimate.
The second main topic of the present article concerns the application of our general results to anti-trees (Fig. 1). These graphs play a prominent role in the theory of graphs with unbounded geometry as they provide examples for similarities and disparities between graphs and manifolds. Specifically, considering the combinatorial graph distance, they include examples of polynomial growth which are stochastically incomplete [19] and have a spectral gap [15]. This disparity was later resolved by the use of intrinsic metrics [10, 12,13,14, 16].
In order to illustrate the anti-trees we are considering here, let \(\gamma \ge 0\), X an anti-tree with root o an which has \(s_{k-1}=[ k^\gamma ]\) vertices in the sphere with combinatorial distance \( k \ge 1\) to o. In contrast to trees where each vertex has only one backwards neighbor, anti-trees have complete bipartite graphs between spheres. Furthermore, let \(\rho \) the intrinsic path degree metric, cf. Sect. 4. Then if \(\gamma =0\), the anti-tree is isomorphic to \(\mathbb {N}\), for \(\gamma \in (0,2)\) it has polynomial volume growth, for \(\gamma =2\) the volume growth is exponential, and for \(\gamma >2\) the intrinsic diameter is bounded (with respect to the intrinsic metric \( \rho \)).
So far, there were no results on heat kernel bounds of the above form for anti-trees as their vertex degree is not bounded. For \(\gamma \in (0,2)\), we denote \(d=\frac{2(\gamma +1)}{2-\gamma } \) which appears as the volume growth dimension. Then there is \(C_0>0\) such that for all \(x,y\in X\) with \( |x|\ne |y| \) and \(t\ge 2\cdot 72^2\) we have
Replacing the intrinsic metric \( \rho \) with the combinatorial graph metric, we denote the combinatorial distance of x to the root o by |x| . Then, we can further estimate this heat kernel bound to obtain the following for large \(t>0\)
In the proof we show that such anti-trees satisfiy certain isoperimetric estimates in all distance balls which then in turn implies the required Sobolev inequalities. Albeit the latter implication is classical for manifolds, we could not find a reference on general graphs with respect to intrinsic metrics. Therefore, we generalize the proof of the Cheeger inequality to our setting from [16].
Similar Gaussian bounds for the heat kernel on anti-trees could be derived from the main results in [17] in conjunction with our developments on isoperimetric constants. However, it would be derived from stronger assumptions, and the resulting bound would not include the first polynomial correction term displayed above and would only hold for larger times, cf. Theorem 4.10.
The outline of this paper is as follows. In Sect. 1, we introduce weighted graphs, their Laplacian, intrinsic metric, and the heat kernel. Moreover, we recall the Sobolev and volume doubling properties we are working with. In Sect. 2 we formulate and prove our main result. The implication that isoperimetric estimates yield Sobolev inequalities is proven in Sect. 3. Section 4 is devoted to the study of anti-trees. We show that their heat kernels have a lot of spherical symmetry and therefore their study reduces to a particular model graph on \(\mathbb {N}_0\). It will be shown that these models satisfy isoperimetry and Ahlfors regularity, i.e., polynomial volume growth, if the sphere function is chosen as above.
1 The set-up
Let X be a countable set, \(m:X\rightarrow (0,\infty )\) a measure on X, and b a locally finite connected graph over (X, m). We denote by \(\mathcal {C}(X)\) the set of continuous functions on X, and as usual \(\nabla _{xy}f:=f(x)-f(y)\), \(f\in \mathcal {C}(X)\). Let \(\Delta :\mathcal {C}(X)\rightarrow \mathcal {C}(X)\) be the operator
where we interpret the right-hand side as divergence form operator. Note that \(\Delta \) is non-negative and symmetric on the compactly supported functions \(\mathcal {C}_c(X)\subset \ell ^2(X,m)\). By abusing notation, we also denote by \(\Delta \ge 0\) its Friedrichs extension. We let
be the infimum of the spectrum of \(\Delta \). The heat kernel p is the minimal integral kernel of the heat semigroup \((P_t)_{t\ge 0}\), i.e., \(P_t=\textrm{e}^{-t\Delta }\), \(t\ge 0\), and for all \(f\in \ell ^2(X,m)\) and \(t\ge 0\) we have
Moreover, for any \(f\in \ell ^2(X,m)\), the map \(t\mapsto P_tf\) solves the heat equation
A pseudo-metric \(\rho :X\times X\rightarrow [0,\infty )\) is called intrinsic with respect to b on (X, m) if
In the following, \(\rho \) will always be a non-trivial intrinsic (pseudo-) metric with finite jump size
For \(r\ge 0\) and \(o\in X\), we denote
We abbreviate \(B(r)=B_o(r)\) if there is no confusion about the role of o. A standing assumption on the intrinsic metric is the following.
Assumption 1.1
The distance balls with respect to the intrinsic metric are compact and the jump size is finite.
For \( x\in X \) and \( f\in \mathcal {C}(X) \) we define
The combinatorial interior of a set \( A\subset X \) will be denoted by
The results presented in here are obtained by assuming the classical Sobolev and volume doubling assumptions. We encode them for weighted graph Laplacians in terms of intrinsic metrics. The big difference to the assumptions on manifolds is that we require these properties only on annuli with positive inradius instead of all small balls.
Definition 1.2
Let b be a graph over (X, m), \(o\in X\), \(R_2\ge R_1\ge 0\), \(n>2\), and \(d>0\).
-
(i)
The Sobolev inequality \(S(n,R_1,R_2)\) holds (in o), if there exists a constant \(C_S>0\) such that for all \(R\in [R_1,R_2]\), \(u\in \mathcal {C}(X)\), \({{\,\textrm{supp}\,}}u\subset B(R)^{\circ }\), we have
$$\begin{aligned} \frac{m(B(R))^{\frac{2}{n}}}{C_SR^2} \Vert u\Vert _{\frac{2n}{n-2}}^2 \le \Vert \vert \nabla u\vert \Vert _2^2+\frac{1}{R^2}\Vert u\Vert _2^2. \end{aligned}$$We abbreviate \(S(n,R_1):=S(n,R_1,R_1)\).
-
(ii)
The volume doubling property \(V(d,R_1,R_2)=V(d,R_1,R_2)\) is satisfied (in o) if there exists \(C_D>0\) such that
$$\begin{aligned} m(B(r_2))\le C_D \left( \frac{r_2}{r_1}\right) ^d m(B(r_1)),\quad R_1\le r_1\le r_2\le R_2. \end{aligned}$$ -
(iii)
The property \(SV(R_1,R_2,d,n)\) is satisfied (in o) if Sobolev \(S(n,R_1,R_2)\) and volume doubling \(V(d,R_1,R_2)\) hold.
Remark
We can replace \(V(d,R_1,R_2)\) by the equivalent property \(V^*(d,R_1,R_2)\)
\(V(d,R_1,R_2)\) implies \(V^*(d,R_1,R_2)\) and \(V^*(d,R_1,R_2)\) implies \(V(d,R_1,R_2/2)\), however, with different constants. Due to this asymmetry in the radii the volume doubling assumption \(V(d,R_1,R_2)\) is more natural.
2 Anchored Gaussian upper bounds
In order to formulate our main result, we recall the following weighted means of the degree and the inverse measure introduced in [17]. The weighted vertex degree is given, for \( x\in X \), by
For \(R\ge 0\), and \(p\in (1,\infty )\), we define
and
Let q be the Hölder conjugate of p. We set for \( \beta \in (1,1+1/q) \)
Define the error-function \(\Gamma (r):= \Gamma _o(r,p,n,\beta )\ge 0\) by
Our main theorem reads as follows.
Theorem 2.1
Let \(d>0\), \(n>2\), \(p\in (1,\infty ]\), \( \alpha =1+2/n \), \( \beta =1+2/(n\vee 2q) \), and
Assume \(SV(R_1,R_2,d,n)\). Then we have for all \(x,y\in B(R_2/4)\) and \(t\ge 2R_1^2\)
where \(r(t,x):= \rho (o,x)+(\sqrt{t/2}\wedge R_2/4)\) and \(C=2^{3n+2d+2}\textrm{e}C_{d,n,\beta }C_D\).
As initially observed by Davies, [7], instead of the Gaussian \(\textrm{e}^{-r^2/4t}\) known from manifolds, for graphs the function \(\textrm{e}^{-\zeta _S(r,t)}\) with
for \( r\ge 0\), \(t>0\), appears, where S is the jump size of the intrinsic metric.
In order to prove Theorem 2.1, we use two results from [17] based on Davies’ method. Here we combine these two propostions in a different way than in [17] to obtain anchored estimates. To obtain estimates of solutions of the heat equation, we investigate properties of solutions of the \(\omega \)-heat equation
where \(\Delta _\omega := \textrm{e}^\omega \Delta \textrm{e}^{-\omega }\) is a sandwiched Laplacian for \(\omega \in \ell ^\infty (X)\). The following proposition is the first ingredient of the proof of the main theorem. It provides an \(\ell ^2\)-mean value inequality for non-negative solutions of the \(\omega \)-heat equation. The displacement of the solutions with respect to the heat equation is measured in terms of the function
Proposition 2.2
([17, Theorem 4.2]) Let \( x\in X \), \(d>0\), \(n>2\), \(p\in (1,\infty ] \), \(\tfrac{1}{q}+\tfrac{1}{p}=1\), \(\alpha =1+\tfrac{2}{n}\),
If SV(R/2, R, d, n) holds in o, then for all \(\tau \in (0,1]\), \(T\in \mathbb {R}\), \(\omega \in \ell ^\infty (X)\), and all non-negative solutions \(v\ge 0\) of the \(\omega \)-heat equation on \([T-R^2,T+R^2]\times B(R)\) we have
where \(C_{d,n,\beta }= 10^{(4+1/\ln \beta +\beta /(\beta -1))/(\beta -1) +8((n+2)^2(d+2)) } (1\vee C_D)(1\vee C_D^{\frac{n}{2}+1}C_S^{\frac{n}{2}}\).
Proposition 2.2 suffices to derive off-diagonal heat kernel bounds as shown by the following proposition, our second ingredient, in points where \(\ell ^2\)-mean value inequalities are available. To this end, observe that, denoting \(P_t^\omega :=\textrm{e}^\omega P_t\textrm{e}^{-\omega }\), the semigroup \((P_t^\omega )_{t\ge 0}\) acts on \(\ell ^2(X,m)\). Moreover, the map \(t\mapsto P_t^\omega f\) solves the \(\omega \)-heat equation for \(f\in \ell ^2(X,m)\) and \(\omega \in \ell ^\infty (X)\).
Proposition 2.3
([17, Theorem 5.3])Let \(T>0\), \(Y\subset X\), and \(a, b:Y \rightarrow [0,\infty )\), \(a\le b\), and \(\phi :Y\times [0,\infty )\rightarrow [0,\infty )\) such that for all \(f\in \ell ^2(X), f\ge 0\), \(\omega \in \ell ^\infty (X)\), and \(x\in Y\) we have
Then we have for all \(x,y\in Y\)
where
Combining these propositions in a suitable way proves Theorem 2.1.
Proof of Theorem 2.1
\(SV(R_1,R_2,d,n)\) yields SV(r/2, r, d, n) for all \(r\in [2R_1,R_2]\). For \(t\ge 2R_1^2\), \(x\in B(R_2/4)\), we set
Then,
We infer from Proposition 2.2 for all \(t\ge 2R_1^2\), \(x\in B(R_2/4)\), \(\tau \in (0,1]\), \(\omega \in \ell ^\infty (X)\), and \(f\in \ell ^2(X,m)\), \(f\ge 0\)
For \(t\ge 2R_1^2\) and \(x\in B(R_2/4)\) set
and
Proposition 2.3 yields for any \(t\ge 2 R_1^2\), \(x,y\in B(o,R_{2}/4)\), and \(\tau \in (0,1]\)
We estimate the upper bound for the heat kernel further and start with the volume terms. Since \(t\ge 2R_1^2\) and \(4 R_1\le R_2\) we have \( r(t,x)\ge \sqrt{\tfrac{t}{2}}\wedge \tfrac{R_2}{4}\ge R_1. \) Thus, volume doubling implies
Now we choose \(\tau \in (0,1]\) and estimate the remaining terms. We let
satisfying \(\tau \in (0,1]\) and immediately get
a similar estimate for r(t, x) replaced by r(t, y), and
Moreover, we obtain
Now, we estimate \(\tau ^{-\frac{n}{2}}\). By the definition of r(t, z), \(z\in \{x,y\}\), we have
Since
we obtain
Plugging in the above estimates into the upper bound for \(p_t(x,y)\) yields the claim. \(\square \)
3 Isoperimetric and Sobolev inequalities
In this section we show that isoperimetric inequalities formulated in terms of intrinsic metrics imply Sobolev inequalities. These results will be used in Sect. 4 in order to obtain heat kernel upper bounds for anti-trees.
For a graph b over (X, m) , an intrinsic metric \( \rho \), \( U\subset X \) and \( n\in (2,\infty ] \), let
where
Note that \(h_{U,\infty }\) is also known as the Cheeger constant of U. It was shown in [4] that the bottom of the spectrum can be bounded in terms of \(h_{U,\infty }\). These considerations directly extend to bound the first Dirichlet eigenvalue of a finite set. In the following we adapt this proof in order to obtain a lower bound on the Sobolev constant instead. In order to do so, we collect some lemmas.
The following lemma is well-known, we included a proof in the Appendix A for the reader’s convenience.
Lemma 3.1
For a decreasing function \( F:[0,\infty )\rightarrow [0,\infty ) \) and \( \alpha \in (0,1] \),
As usual, we denote for a function \( f:X\rightarrow \mathbb {R}\) and \( t\in \mathbb {R}\)
The following lemma is found in [16, Lemma 10.8].
Lemma 3.2
(Co-area formula) For \( w:X\times X\rightarrow [0,\infty ) \) and \( f:X\rightarrow \mathbb {R}\), we have
The next lemma is an adapted version of the area formula for graphs found in [16, Lemma 10.9]. This corresponds to the special case \(\alpha =1\).
Lemma 3.3
(Area formula) For \( f:X\rightarrow [0,\infty )\) and \( 0<\alpha \le 1\)
Proof
We calculate
This settles the claim. \(\square \)
Theorem 3.4
(Sobolev inequality and isoperimety) For \( n\in (2,\infty ] \), \( \phi \in \mathcal {C}_{c}(U) \) and \( C>0 \) we have
Proof
We employ the area formula with \( \alpha =(n-2)/n \), the basic inequality from Lemma 3.1, the co-area formula, the definition of \(h_{U,n}\), and the fact that \(\rho \) is intrinsic to obtain for \( \phi \in \mathcal {C}_{c}(U) \)
This proves the claim. \(\square \)
4 Anti-trees
In this section we show that anti-trees of a certain growth fulfill the assumptions of Theorem 2.1. This is can be achieved by reducing the analysis on the anti-tree to a one-dimensional problem.
We consider here graphs b with standard weights that is \( b(x,y)\in \{0,1\} \), \( x,y\in X \). For a connected graph b over X, we denote by
the distance spheres with respect to the combinatorial graph distance d to the root \( o\in X \). Clearly, \( S_{-k}=\emptyset \) for \( k\in \mathbb {N}\). We furthermore denote
For a so-called sphere function \( s:\mathbb {N}\longrightarrow \mathbb {N}\) the corresponding anti-tree is a graph b with standard weights over a set X such that for the distance spheres we have
for \( k\ge 1\),
for \( k\ge 0 \) and \( b(x,y)=0 \) otherwise. For convenience later on, we set \( s_{0}=1 \) and \( s_{-1}=0 \). Moreover, we equip X with the counting measure \( m=1 \) and denote for \( k\in {\mathbb {Z}} \) the combinatorial balls by
Lemma 4.1
(Characterization anti-trees) Let b be connected a graph with standard weights such that there are no edges within spheres. The following statements are equivalent:
-
(i)
b is an anti-tree.
-
(ii)
For any vertices \( x,y,x',y' \) such that \( |x|=|x'| \) and \( |y|=|y'| \), there is a graph isomorphism which interchanges x and \( x' \) as well as y and \( y' \).
Proof
(i) \( \Longrightarrow \) (ii): For an anti-tree the map which interchanges x with \( x' \) and y with \( y' \) and leaves every other vertex invariant is a graph isomorphism since x and \( x' \) as well as y and \( y' \) have the same neighbors each.
(ii) \( \Longrightarrow \) (i): The forward graph \( F_{x} \) of a vertex x with respect to a root o is a subgraph of b induced by the vertices \( z\in \bigcup _{k\ge |x|}S_{k} \) such that \( d(x,z)=k \) for \( z\in S_{k} \).
Clearly, a graph isomorphism which interchanges x and \( x' \) with \( |x|=|x'| \) also has to map the forward graph \( F_{x} \) to \( F_{x'} \) and vice versa. If b is not an anti-tree, then there is a vertex x which is not connected to some \( y\in S_{|x|+1} \), i.e., \( y\not \in F_{x} \). Furthermore, there is \( x' \in S_{|x|}\) which is connected to y, i.e., \( y\in S_{|x'|+1} \). Thus, there is no graph isomorphism interchanging x and \( x' \) and which keeps \( y=y' \) invariant: if there was such a \( \iota \), then
which is a contradiction. \(\square \)
To a given anti-tree with sphere function s, we can associate a one-dimensional weighted graph \( {\tilde{b}}\) over \( ({\tilde{X}},{\tilde{m}}) \) with
for \( k\ge 0 \) and \({\tilde{b}}(k,l)=0 \) otherwise. We denote the corresponding Laplacian by \( {\tilde{\Delta }} \) and the heat kernel \({\tilde{p}} \).
Lemma 4.2
For an anti-tree b over (X, m) with heat kernel p and corresponding graph \( {\tilde{b}} \) over \( (\mathbb {N}_{0},{\tilde{m}}) \) with heat kernel \( {\tilde{p}} \), we have for \( t\ge 0 \) and \( x,y\in X \) with \( |x|\ne |y| \)
Proof
By the characterization of anti-trees for any \( x,y,x',y' \) such that \( |x|=|x'| \) and \( |y|=|y'| \) (and \( x=y \) if and only if \( x'=y' \)), there is a graph isomorphism \( \iota \) interchanging x and \( x' \) as well as y and \( y' \). This means that \( \iota \) extends to a unitary operator on \(\ell ^{2}(X,m) \) via \( f\mapsto f\circ \iota \) which commutes with the Laplacian. Thus, it commutes with the semigroup. Hence, \( p_{t}(x,y)= p_{t}(x',y') \) for all such \( x,y,x',y' \). Therefore, there is a symmetric function \( q_{t} \) on \( \mathbb {N}_{0}\times \mathbb {N}_{0} \) given by
whenever \( |x|\ne |y| \) and
It turns out that, q solves the heat equation for \( {\tilde{b}} \), i.e., for all \( x,y\in X \) with the Laplacians \( {\tilde{\Delta }} \) and \( \Delta \) acting on the second variable
and \( q_{0}(|x|,|y|)={{\,\mathrm{\textbf{1}}\,}}_{|y|}(|x|) \). Since \((t,x)\mapsto p_{t} (x,y)\) is the unique solution to the heat equation for b in \( \ell ^{2}(X) \), so is q for \( {\tilde{b}} \) in \( \ell ^2({\tilde{X}},{\tilde{m}}) \). Hence, q is the heat kernel for \( {\tilde{b}} \). \(\square \)
From now on, we will choose the intrinsic metric \( \rho \) to be the intrinsic degree metric. Recall that for a graph b over (X, m) the intrinsic degree metric is given by
for \( x,y\in X \), where for antitrees the weighted degree is given by
for \( x \in X\).
For an antitree b and the associated one-dimensional graph \( {\tilde{b}}\), we denote the corresponding intrinsic degree metric \( {\tilde{\rho }} \) for \({\tilde{b}} \) over \( (\mathbb {N}_{0}, {\tilde{m}}) \).
Lemma 4.3
(Intrinsic metric) For \( x,y \in X \) such that either \( |x|\ne |y| \) or \( x=y \),
Proof
Observe that for the weighted degree \( \tilde{{{\,\textrm{Deg}\,}}} \) of \({\tilde{b}} \) we have
Moreover, for any path between x and y with either \( |x|\ne |y | \) or \( x=y \) there is a unique path on \( \mathbb {N}_{0} \). On the other hand, all the different paths in X corresponding to the same path on \( \mathbb {N}_{0} \) have the same length. This settles the claim. \(\square \)
We denote the closed distance balls about \( x\in X \) and \( |x|\in {\tilde{X}} \) with respect to \( \rho \) and \( {\tilde{\rho }} \) by \( B_{x} (r)\) and \( {\tilde{B}}_{|x|}(r) \) for \( r\in \mathbb {R}\). Moreover, we denote the open balls in X and \({\tilde{X}}\) by \( B_{x}^{\circ }(r) =\{y\in X\mid \rho (x,y)<r\}\) and \( {\tilde{B}}_{|x|}^{\circ }(r) =\{|y|\in {\tilde{X}}\mid {\tilde{\rho }}(|x|,|y|)<r\} \) respectively.
From now on for given \( \gamma \in [0,2) \), we consider the anti-tree with the sphere function
\( k\ge 1 \), where \( [\cdot ] \) is the integer function.
The intrinsic and combinatorial distance can be estimated against each other which is elaborated in [14]. For convenience, we recall the argument here. For two real valued functions f and g, we denote
if there is a constant \( C>0 \) such that \( C^{-1}f\le g\le Cf \).
Lemma 4.4
(Distance) For \( \gamma \in [0,2) \), the corresponding anti-tree satisfies for \( x,y\in X \) with either \( |x|\ne |y| \) or \( x=y \)
In particular, there are \( c,C\ge 0 \) such for every r there is \( c\le \theta \le C \) such that
Proof
We have
for \( z\in X \). Then, for \( |x|>|y| \)
This proves the first statement. The “in particular” statement is a direct consequence. \(\square \)
The following constant can be understood as the dimension of the antitree with parameter \( \gamma \in (0,2) \).
Lemma 4.5
(Polynomial volume growth) For \( \gamma \in [0,2) \), \( r\ge 0 \), \( x\in X \) and \( r_{x}=\rho (x,o) \), we have
In particular, for we have \( V(d,R,\infty ) \) in every \( x\in X \) with \( R\ge \rho (x,o) \).
Proof
The equalities follow directly from the definitions. Since for \( N\in \mathbb {N}_{0} \),
Thus, by the lemma above
Now, observe that \( m(B_{o}^{\circ }(r_{x}-r))\asymp m(B_{o}(r_{x}-r)) \) and thus
The statement for \( r\ge r_{x} \) is clear and the statement for \( r\le r_{x} \) follows by the mean value theorem after factoring out r on the right hand side.
The claim about volume doubling follows since \( m(B_{x}(r))=m(B_{o}({r+r_{0}})) \) for all \( r\ge r_{0}=\rho (x,o) \). \(\square \)
Next, we estimate the isoperimetric constant of distance balls which we need to obtain a Sobolev inequality via Theorem 3.4. For the one dimensional graph \( {\tilde{b}} \) associated to an antitree and a finite set \( B\subseteq {\tilde{X}} \) recall that
Lemma 4.6
(Isoperimetic inequality) For \( \gamma \in [0,2) \), \( n\ge 2d=\frac{4(\gamma +1)}{2-\gamma }\ge 2 \), \(x\in X \) and \( r\ge 1\vee \rho (o,x)\), we have
Proof
Since \( r\ge 1\vee \rho (o,x)=:r_{0} \), we have that \(o \in B_{x}(r) \). So, to determine the infimum in \( {\tilde{h}}_{{\tilde{B}}_{|x|}(r),n} \), it suffices to consider balls \( B_o ({R})\) with \( R\le r_{0}+r \) and estimate
For \( R\ge 0 \), we recall the bound \( m(B_o({R}))\asymp R^{(2(\gamma +1))/(2-\gamma )} \) from Lemma 4.5. Since \( {{\,\textrm{Deg}\,}}(x)=s_{|x|-1}+s_{|x|+1} \) we have \( \rho _{\vert x\vert }:= \rho (x,y)=(s_{|x|}+s_{|x|+2})^{-\frac{1}{2}} \) for \( y\in S_{|x|+1} \). Moreover, also by Lemma 4.5, for every \( R\ge 0 \) there is \(c\le \theta \le C \) such that \( B_{o}({R})=A({k}) \) with \( k=\theta R^{ {2}/({2- \gamma })} \) and since \( s_{k}\asymp k^{\gamma } \), we have
Now,
Since \( \frac{4(\gamma +1)}{n(2-\gamma )}\le 1 \), we have
where the last estimate follows as \({\tilde{B}}_{|x|}(r)= {\tilde{B}}_0({r_{0}+r}) \) for \( r\ge r_{0} \), i.e., we have the bounds \(m ({\tilde{B}}_{|x|}(r))\asymp r^{2(\gamma +1)/(2-\gamma )} \). This finishes the proof. \(\square \)
We apply the estimates to obtain Sobolev inequalities by Theorem 3.4.
Proposition 4.7
(Sobolev inequality) For \( \gamma \in (0,2) \) and \( n\ge 2d=\frac{4(\gamma +1)}{2-\gamma }\ge 2 \) there is \( C_{S}>0 \) such that for all \( r>0 \) and all functions \( \phi \in C_{c}({\tilde{B}}_0({r})) \)
Proof
To apply Theorem 3.4, we choose \( C=r \) and conclude the statement from Lemma 4.6. \(\square \)
Next we estimate the averaged degree functions
for \( x \in X\) and \(r\ge 0\).
Lemma 4.8
For \( \gamma \in (0,2) \) and \( x\in X \), we have for all \( r\ge \rho (x,o) \) and \( p\in [1,\infty ] \)
Proof
The equality follows by definition. Recall that
for \( y\in S_{k} \) and \( k\ge 0 \). Let \( p\in [1,\infty ) \) and \( r_{0} =\rho (x,o)\). For every \( r\ge r_0 \) there is \(c\le \theta \le C \) such that \( B_{x}(r)=B_o({r+r_{0}})=A({R}) \) with \( R=\theta (r+r_{0})^{ {2}/({2- \gamma })} \). Thus, we have since \( m(B_{x}(r))= m(B_{o}({r+r_{0}}))= {\tilde{m}}({\tilde{B}}_0({r}))\asymp (r+r_{0})^{\frac{2(\gamma +1)}{2-\gamma }} \)
This proves the asymptotics for \( p<\infty \). For \( p=\infty \), one clearly obtains the bounds \( D_{\infty }(x,r)=s_{\theta (r+r_{0})^{2/(2-\gamma )}}\asymp r^{2\gamma /(2-\gamma )} \). \(\square \)
Now, we collected all the ingredients to prove heat kernel estimates on anti-trees.
Theorem 4.9
For \( \gamma \in (0,2) \) and \( n\ge 2d=\frac{4(\gamma +1)}{2-\gamma }> 2 \), there exists a constant \(C>0\) such that for all \(x,y\in X\) with \( |x|\ne |y| \) and \(t\ge 2\cdot 72^2\) we have
and for the combinatorial distance for \(t>2||x|^{(2-\gamma )/2}-|y|^{(2-\gamma )/2}|^{2}\)
Proof
By Lemma 4.3 and Lemma 4.2, it suffices to prove the statement for the one-dimensional kernel \( {\tilde{p}} \) with intrinsic metric \( {\tilde{\rho }} \).
We check the assumptions of Theorem 2.1. First of all, since \( {\tilde{m}}(k)=s_{k}\ge 1 \), we have \( {\tilde{M}}_{p}(R)\le 1 \) for all \( p \in (1,\infty )\) and \( R \ge 0 \). Furthermore, \( {\tilde{D}}_{p}(R) \) is polynomially bounded by Lemma 4.8. Volume doubling \( VD(d,1,\infty ) \) is satisfied by Lemma 4.5 with the choice \( d=2(\gamma +1)/(2-\gamma ) \). Moreover, the Sobolev inequality \( S(n,1,\infty ) \) is satisfied by Proposition 4.7. Hence, we have \( SV (1,\infty ,d,n)\).
Now, the first result follows from Theorem 2.1 since the jump size of \( \rho \) can be estimated by \( S\le 1 \).
For the second statement with respect to the combinatorial graph metric, we choose \( n=2d \). For the first term on the right hand side, we use \( (1+\alpha )^{d}\le 2^{d-1}(1+\alpha ^{d}) \) and we estimate the enumerator of the term in the middle by 1. Furthermore, we use \( \zeta (r,t)\ge \frac{r^{2}}{C t} \) for \(t>c\rho (x,y) \), cf. [8, p. 214], and employ Lemma 4.4 to estimate \( \rho \) by \( |\cdot |^{(2-\gamma )/2} \). \(\square \)
Theorem 4.10
Let \( \gamma \in (0,2) \), and \( n\ge 2d= \frac{4(\gamma +1)}{2-\gamma }> 2 \). There exists \(C_0,R_0>0\) such that for all \(x,y\in X\) with \( |x|\ne |y| \) and \(t\ge 8\max \{\rho (x,o),\rho (y,o),R_{0}\}^{2}\) we have
Proof
Again as argued in the proof of the lemma above, by Lemma 4.3 and Lemma 4.2, it suffices to prove the statement for the one-dimensional kernel \( {\tilde{p}} \) and \( {\tilde{\rho }} \).
We apply [17, Theorem 6.1]. We choose \(\beta =1+1/n\), \( p=\infty \) and \( R_{0}=72 \). Then, for x, y we have \( SV(r,\infty ,d,n) \) for \( r\ge r_{x}\vee r_{y}\vee R_{0} \) by Lemma 4.5 and Proposition 4.7.
The error terms
are bounded since \({\tilde{D}}_{\infty }(r)\), \( {\tilde{M}}_{\infty } (r)\), \(m( {\tilde{B}}(r))\) are polynomially growing and we have \(\theta (r)\asymp \textrm{e}^{-\gamma \sqrt{r}}\). The polynomial volume growth yields \( \Lambda =0 \), cf. [13]. Moreover, the jump size can be bounded by \( S\le 1 \). Hence, the result can be read from [17, Theorem 6.1]. \(\square \)
Remark
In the theorems above we did not prove estimates for vertices \( x,y\in X\) with \( |x|=|y| \). Indeed, by our argument we get estimates for the one-dimensional heat kernel \( {\tilde{p}}_{t} \). On the diagonal \( {\tilde{p}}_{t} \) equals the sphere average of \( p_{t} \). Taking into account that \( p_{t}(x,y) \le \sqrt{p_{t}(x,x)p_{t}(y,y)} =p_{t}(x,x)\) for \( |x|=|y| \), we get for \( x\ne y \) estimates of the form
For \( x=y \), one can still employ the estimate \( p_{t}(x,x)\le \# S_{|x|} {\tilde{p}}_{t}(|x|,|x|) \).
Data availability
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
References
Andres, S., Deuschel, J.-D., Slowik, M.: Heat kernel estimates for random walks with degenerate weights. Electron. J. Probab. 21, 1–21 (2016)
Barlow, M., Chen, X.: Gaußian bounds and parabolic Harnack inequality on locally irregular graphs. Math. Ann. 366, 1677–1720 (2016)
Bauer, F., Hua, B., Yau, S.-T.: Sharp Davies-Gaffney-Grigor’yan Lemma on graphs. Math. Ann. 368(3), 1429–1437 (2017)
Bauer, F., Keller, M., Wojciechowski, R.K.: Cheeger inequalities for unbounded graph Laplacians. J. Eur. Math. Soc. (JEMS) 17(2), 259–271 (2015)
Chen, X., Kumagai, T., Wang, J.: Random conductance models with stable-like jumps: heat kernel estimates and Harnack inequalities. J. Funct. Anal. 279(7), 108656,51 (2020)
Davies, E.B.: Analysis on graphs and noncommutative geometry. J. Funct. Anal. 111(2), 398–430 (1993)
Davies, E.B.: Large deviations for heat kernels on graphs. J. London Math. Soc. 47(2), 65–72 (1993)
Delmotte, T.: Parabolic Harnack inequality and estimates of Markov chains on graphs. Rev. Mat. Iberoam. 15(1), 181–232 (1999)
Folz, M.: Gaussian upper bounds for heat kernels of continuous time simple random walks. Electron. J. Probab. 16, 1693–1722 (2011)
Folz, M.: Volume growth and stochastic completeness of graphs. Trans. Am. Math. Soc. 366(4), 2089–2119 (2014)
Grigor’yan, A.: Heat kernel and analysis on manifolds. AMS/IP studies in advanced mathematics. Am. Math. Soc. (2009)
Huang, X., Keller, M., Schmidt, M.: On the uniqueness class, stochastic completeness and volume growth for graphs. Trans. Am. Math. Soc. 373, 8861–8884 (2020)
Haeseler, S., Keller, M., Wojciechowski, R.K.: Volume growth and bounds for the essential spectrum for Dirichlet forms. J. London Math. Soc. 88(3), 883-898,09 (2013)
Huang, X.: On stochastic completeness of graphs. PhD thesis, University of Bielefeld, (2011)
Keller, M., Lenz, D., Wojciechowski, R.K.: Volume growth, spectrum and stochastic completeness of infinite graphs. Math. Z. 274(3–4), 905–932 (2013)
Keller, M., Lenz, D., Wojciechowski, R.: Graphs and Discrete Dirichlet Spaces, volume 358 of Grundlehren der mathematischen Wissenschaft. Springer, (2021)
Keller, M., Rose, C.: Gaussian upper bounds for heat kernels on graphs with unbounded geometry. (2022). Preprint, arXiv:2206.04690 [math.AP]
Mourrat, J.-C., Otto, F.: Anchored Nash inequalities and heat kernel bounds for static and dynamic degenerate environments. J. Funct. Anal. 270(1), 201–228 (2016)
Wojciechowski, R. K.: Stochastically incomplete manifolds and graphs. In Random walks, boundaries and spectra, volume 64 of Progr. Probab., pp. 163–179. Birkhäuser/Springer Basel AG, Basel, (2011)
Zhikov, V.V.: Estimates of the Nash-Aronson type for degenerating parabolic equations. J. Math. Sci. (N.Y.) 190, 66–79 (2013)
Acknowledgements
The authors acknowledge the financial support of the DFG. Moreover, they want to thank the anonymous referee for a comment which improved the manuscript.
Funding
Open Access funding enabled and organized by Projekt DEAL.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Andrea Mondino.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
Proof of Lemma 3.1
Let
Then \(g(0)=h(0)=0\), g and h are differentiable, and
Since F is non-increasing, we get
Hence, \(h(T)\ge g(T)\). Letting \(T\rightarrow \infty \) yields the claim.\(\square \)
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Keller, M., Rose, C. Anchored heat kernel upper bounds on graphs with unbounded geometry and anti-trees. Calc. Var. 63, 20 (2024). https://doi.org/10.1007/s00526-023-02622-3
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00526-023-02622-3