Abstract
In this paper analogues of Sobolev inequalities for compact and connected metric graphs are derived. As a consequence of these inequalities, a lower bound, commonly known as Cheeger inequality, on the first non-zero eigenvalue of the Laplace operator with standard vertex conditions is recovered.
Similar content being viewed by others
1 Introduction
For a compactly supported smooth function h on \(\mathbb{R}^{n}\) the classical Sobolev inequality [30] and Gagliardo–Nirenberg inequality [14, 26] state the existence of positive constants C and C̃ such that
and
hold. Inequalities (1) and (2) follow from a more general Gagliardo–Nirenberg–Sobolev (GNS) inequality,
where \(1\leq p < n\). Inequalities (1) and (2) are obtained by choosing \(p=1\) and \(p=2\), respectively, in (3). These inequalities are important in the study of PDEs, heat kernel and spectral estimates (see, e.g., [10, 11]).
On the other hand, the corresponding versions of these inequalities for discrete graphs were obtained by Chung and Yau (see [8, 9]). The discrete analogue of (1) and (2) depend on a parameter associated with a graph, which we call the isoperimetric dimension of the graph, and a constant, which we call the isoperimetric constant of the graph. We define them as follows:
Let G denote a graph with vertex set \(V(G)\). The graph G has an isoperimetric constant \(C_{\delta}\) depending on the isoperimetric dimension δ if the number of edges between every subset Z of the vertex set \(V(G)\) and its compliment Z̄, denoted by \(|E(Z, \bar{Z})|\), satisfies
Here \(\operatorname{Vol}(Z)\) denotes the sum of the valencies of all vertices in Z. Let \(h: V(G)\rightarrow\mathbb{R}\) be an arbitrary function and \(\tau_{h}\) is the largest value such that
with \(d_{u}\) being the valency of the vertex u.
For a connected graph G, the discrete analogue of the Sobolev inequalities state the existence of positive constants \(C_{1}=\frac {C_{\delta}(\delta-1)}{\delta}\) and \(C_{2}=\frac{\delta-1}{2\delta C_{\delta}^{-1/2}}\) such that
and
holds. Here \(\eta=\frac{2\delta}{\delta-2}\) and \(u\sim v\) means u and v are neighbors.
Inequalities such as (4) and (5) play an important role in the study of heat kernel and spectral estimates of discrete Laplacian on graphs. For instance, the lower bound on the kth eigenvalue \(\lambda_{k}\) of the discrete Laplacian on a connected graph G is obtained by using inequality (5) as
where the constant \(C_{3}\) depends on δ.
One can consider a generalization of discrete graphs by identifying each edge by an interval of the real line instead of an ordered pair of vertices. In this way, one can define a distance function on such graphs, which can be the smallest path length between two points on the graph. This new object, with a metric defined on it, is called a metric graph. In addition, we can define ordinary differential operators on each edge with certain boundary conditions at the vertices. Boundary conditions or vertex conditions are chosen in a way which makes the overall operator self-adjoint on the graph.
Let Γ denote a metric graph with N being the number of edges and denote the jth edge by \(e_{j}\) which is identified by an interval of the real line, i.e., \(e_{j}=(x_{2j-1}, x_{2j})\), \(j=1,2,\dots, N\). In the Hilbert space \(L_{2}(\Gamma):=\bigoplus\sum _{j=1}^{N} L_{2}(e_{j})\), the Laplace operator (6) with standard conditions (7), which are also known as Kirchhoff, Neumann or free conditions, is a self-adjoint operator
The extended normal derivative is \(\partial h(x_{j}):=\lim_{x\rightarrow x_{j}}\frac{d}{dx}h(x)\) if \(x_{j}\) is the left-end point and \(\partial h(x_{j}):=\lim_{x\rightarrow x_{j}}-\frac{d}{dx}h(x)\) if \(x_{j}\) is the right-end point. For the description of all possible vertex conditions for which (6) is self-adjoint, see [16, 18]. The pair of a metric graph and a self-adjoint differential operator is called a quantum graph. Such objects naturally arise in different areas of mathematics, science and engineering when analyzing various processes in systems which, locally, look like a thin neighborhood of a graph. In the last two decades, quantum graphs have evolved as an interesting branch of mathematical physics and have found many useful applications in physics, particularly in quantum chaos [15, 19] and mesoscopic physics [12, 13, 18]. For a detailed study of quantum graphs, we refer the reader to [3, 20–22, 29].
Although a quantum graph is fundamentally a different object from a discrete graph, in some special situations their spectra are related to each other. For example, it is well known (see [2, 4–6, 27, 31]) that if all edges of a compact metric graph are of the same length then the set of eigenvalues \(\{ \lambda_{j}: \lambda_{j}/\pi^{2} \notin\mathbb{Z}\}\) of the Laplace operator (6) with vertex conditions (7) is related to the set of eigenvalues \(\mu_{j}\) of the normalized discrete Laplacian as
Therefore, it is a natural question to ask whether it is possible to derive some functional inequalities of the type discussed above for metric graphs and whether one can obtain some estimates on the spectrum of the related quantum graphs? In this paper, we try to answer this question by deriving analogues of (3) for compact and connected metric graphs. A different version of GNS inequalities for non-compact metric graphs has been used by Adami, Serra and Tilli [1] to study ground states of certain NLSE.
The plan of the paper is as follows. In the next section we fix the notation and state our main results, Theorems 2.1 and 2.3. Section 3 contains proofs of the main results. Functional inequalities involving the graph’s Cheeger constant is the theme of Sect. 4. As a consequence of Theorem 4.3, we recover the well known Cheeger inequality for quantum graphs, which gives a lower bound on the lowest non-zero eigenvalue of the Laplacian (6) with standard conditions (7) on the vertices. For quantum graphs the same lower bound, Corollary 4.4, was first obtained by Nicaise [25, Theorem 3.2] and also by Post [28, Theorem 6.1].
2 Main results
Let Γ be a compact and connected metric graph. We say that Γ has an isoperimetric constant \(C_{\gamma}\) depending on the isoperimetric dimension γ if for every subgraph Z of Γ, the number of edges that depart from Z, denoted by \(|\partial Z|\), satisfies
Here Z̄ denotes the complement of Z. For a non-negative function h on the metric graph Γ, we define
and
Here \(t\geq0\). It is easy to observe that there always exists a non-negative number \(t_{h}\) such that \(\operatorname {Vol}(Z^{+}_{h}(t_{h}))=\operatorname{Vol}(Z^{-}_{h}(t_{h}))\) and therefore \(\operatorname{Vol}(Z^{+}_{h}(t))\leq\operatorname{Vol}(Z^{-}_{h}(t))\) for all \(t\geq t_{h}\). In addition, if \(h=c\geq0\) is a constant function then we set \(t_{h}=c\).
Let V denote the set of vertices of Γ. We say that \(h\in C^{1}(\Gamma)\) if \(h|_{e_{j}}\in C^{1}(e_{j})\) and h satisfies the standard matching conditions (7) at all the vertices. The following two theorems are our main results:
Theorem 2.1
For \(h \in C^{1}(\Gamma)\), \(h \geq0\) and for \(\gamma>1\), the following inequality holds:
Corollary 2.2
Let h satisfy the conditions of the above theorem. Then, for \(\gamma >1\), we have the following inequality:
where \(Z^{+}_{h}(0)=\{x\in\Gamma: h(x)>0\}\).
Theorem 2.3
For \(h \in C^{1}(\Gamma)\), \(h \geq0\) and for \(\gamma>1\) and integer \(q\geq2\), the following inequality holds:
where \(C_{\gamma,q}=\frac{2^{-1/\gamma}C_{\gamma}}{q}\) and \(\Theta (h,\gamma,q,\Gamma)=2^{1/\gamma} t_{h^{q}}\operatorname {Vol}(Z^{+}_{h^{q}}(0))^{\frac{\gamma-1}{\gamma}}\).
Remark 2.4
If \(t_{h}=0\), then inequality (11) reduces to
and if \(t_{h^{q}}=0\), then inequality (13) becomes
3 Proofs of the main results
In this section we prove our main results. We closely follow the argument of Cheeger [7] and Maz’ya [23, 24]. A similar argument was used in the case of discrete graphs [8, 9]. We will need the following lemma.
Lemma 3.1
For \(\gamma> 1\), the following inequalities hold:
Proof
For simplicity we put \(p=\frac{\gamma}{\gamma-1}\) and, using the definition of Lebesgue integral, we write
As \(\operatorname{Vol}(Z^{+}_{h}(t))\) is a monotonically decreasing function of t, we have
and hence
Using inequality (17) and by putting \(g(t)=\int_{0}^{t} \operatorname{Vol}(Z^{+}_{h}(t_{h} + \tau))^{\frac{1}{p}} \,d \tau\), equation (16) becomes
This implies that
which is the desired inequality (14).
To prove the second inequality, we consider
As \(-\operatorname{Vol}(Z^{+}_{h}(t))\leq-\operatorname{Vol}(Z^{-}_{h}(t))\leq \operatorname{Vol}(Z^{-}_{h}(t))\) for \(t < t_{h}\), equation (18) becomes
Now \(\operatorname{Vol}(Z^{-}_{h}(t))\) is a monotonically increasing function of t and therefore
Using inequality (20) and by putting \(q(t)=\int_{t}^{t_{h}} \operatorname{Vol}(Z^{-}_{h}(\tau))^{\frac{1}{p}} \,d \tau\), inequality (19) becomes
This implies that
□
3.1 Proof of Theorem 2.1
Define the set \(Z_{h}(t)\) as
We know that \(\operatorname{Vol}(Z^{+}_{h}(t))\leq\operatorname {Vol}(Z^{-}_{h}(t))= \operatorname{Vol}(\bar{Z}^{+}_{h}(t))\) for all \(t > t_{h}\) and \(\operatorname{Vol}(Z^{-}_{h}(t))\leq [4]\operatorname {Vol}(Z^{+}_{h}(t))=\operatorname{Vol}(\bar{Z}^{-}_{h}(t))\) for all \(t\leq t_{h}\). Therefore,
and
In order to prove the theorem, we need the co-area formula
or
Equation (23), along with inequalities (21) and (22). implies that
which, due to Lemma 3.1, gives
Here we used \(|h(x)-t_{h}|^{p}=(h(x)-t_{h})_{+}^{p}+(h(x)-t_{h})_{-}^{p}\).
3.2 Proof of Corollary 2.2
Inequality (11) in particular implies that
For \(\beta\geq1\), \(a>0\) and \(b>0\), the following elementary inequality holds:
If we choose \(a=(h-t_{h})_{+}\), \(b=t_{h}\) and use the fact that \((h-t_{h})_{+}\geq h\), inequality (25) yields
Therefore,
By another elementary inequality
we obtain
Finally, choosing \(\beta=\frac{\gamma}{\gamma-1}\) and combining inequalities (24), (26) and (27), we obtain the desired inequality (12).
3.3 Proof of Theorem 2.3
We apply estimate (12) to \(h^{q}\) assuming \(h\geq0\), \(h \in C^{1}(\Gamma)\) and \(q>1\) is an integer, which gives
Putting \(\Theta(h,\gamma,q,\Gamma)=2^{1/\gamma} t_{h^{q}}\operatorname {Vol}(Z^{+}_{h^{q}}(0))^{\frac{\gamma-1}{\gamma}}\), the above inequality becomes
We choose p such that \(\frac{q\gamma}{\gamma-1} = \frac {p(q-1)}{p-1}\), that is,
With this choice of p, the above inequality becomes
where \(C_{\gamma,q}=\frac{2^{-1/\gamma}C_{\gamma}}{q}\).
4 Sobolev inequalities involving Cheeger constant
Finding an optimal cut of a graph into two or more disjoint subsets is one of the fundamental problems in graph theory. Cheeger cut, which we define below, among several kinds of balanced graph cut, is the most widely used tool to obtain optimal partitioning of a graph. The Cheeger constant \(C_{\Gamma}\) of a metric graph Γ is defined as
where inf is taken over all Lebesgue measurable open subsets Z of the metric graph. The partition \((Z, \bar{Z})\) of Γ is called a Cheeger cut if
In order to find the Cheeger cut of a metric graph, one would really need to know the value of the associated Cheeger constant or at least an approximation of it. The most well-known technique to approximate the Cheeger constant is via lowest non-zero eigenvalue of the standard Laplace operator. Precisely, if \(\lambda_{1}\) denotes the lowest non-zero eigenvalue of the Laplace operator (6) subject to standard conditions (7) at the vertices, then the Cheeger inequality
provides an upper bound on the Cheeger constant. For more details on the theory of Cheeger constants for quantum graph, we refer to the review article [17].
It is easy to see that \(C_{\Gamma}=\lim_{\gamma\rightarrow\infty} C_{\gamma}\), where \(C_{\gamma}\) is the isoperimetric constant of the graph defined in (8). Using this observation, one can rewrite the inequalities obtained in Theorems 2.1 and 2.3 in terms of the graph Cheeger constant. The obtained inequalities in the following theorems could be used as an alternative to estimate the Cheeger constant.
Theorem 4.1
Let \(C_{\Gamma}\) be the Cheeger constant of the graph Γ. Then, for a non-negative function \(h \in C^{1}(\Gamma)\), the following inequality holds:
Corollary 4.2
Let h satisfy the conditions of the above theorem. Then the following inequality holds:
where \(Z^{+}_{h}(0)=\{x\in\Gamma: h(x)>0\}\).
Theorem 4.3
For \(h \in C^{1}(\Gamma)\), \(h \geq0\) and for integer \(q\geq2\), the following inequality holds:
where \(\widetilde{\Theta}(h,q,\Gamma)= t_{h^{q}}\operatorname{Vol}(Z^{+}_{h^{q}}(0))\).
The following result follows from Theorem 4.3 and is commonly known as Cheeger inequality. It was first proved by Nicaise [25, Theorem 3.2].
Corollary 4.4
Let \(\lambda_{1}\) be the lowest non-zero eigenvalue of the Laplace operator H given by (6) with the standard or Kirchhoff vertex conditions (7) defined in \(L_{2}(\Gamma)\), where Γ is a compact and connected metric graph. Then we have
Proof
The lowest eigenvalue of the operator H is zero and corresponding eigenfunction is a constant. Let \(\psi_{1}\) denote the eigenfunction corresponding to the lowest non-zero eigenvalue \(\lambda_{1}\). We can assume \(\psi_{1}\) to be real-valued. We define
and
Clearly, \(\widetilde{\psi}_{1}\) disappears on the boundary of \(\Gamma_{+}\). By min–max principle, we have
Here we used integration by parts and applied inequality (30) to \(\widetilde{\psi}_{1}\) with \(q=2\) along with the fact that the mean value of the eigenfunction is 0. Note that \(\widetilde {\Theta}(\widetilde{\psi}_{1},2,\Gamma)=0\). □
5 Conclusions
Metric graphs are locally one-dimensional objects. We first defined isoperimetric dimension of these graphs which may be greater than one and may not be an integer. We obtained Sobolev type inequalities for such graphs. These inequalities depend on the isoperimetric dimension of the graph. Moreover, we gave versions of these inequalities that involve graph’s Cheeger constant. Functional inequalities are important tools for the study of spectral properties of differential operators. We demonstrated this connection by obtaining a previously known lower bound on the first non-zero eigenvalue of the Laplace operator defined on a metric graph.
References
Adami, R., Serra, E., Tilli, P.: Negative energy ground states for the \(L^{2}\)-critical NLSE on metric graphs. Commun. Math. Phys. 352, 387–406 (2017)
Baker, M., Faber, X.W.C.: Metrized graphs, Laplacian operators, and electrical networks. In: Quantum Graphs and Their Applications, Contemp. Math., vol. 415, pp. 15–33. Am. Math. Soc., Providence (2006)
Berkolaiko, G., Kuchment, P.: Introduction to Quantum Graphs. Mathematical Surveys and Monographs, vol. 186, pp. xiv–270. Am. Math. Soc., Providence (2013)
Brüning, J., Geyler, V., Pankrashkin, K.: Spectra of self-adjoint extensions and applications to solvable Schrödinger operators. Rev. Math. Phys. 20, 1–70 (2008)
Cartwright, D.I., Woess, W.: The spectrum of the averaging operator on a network (metric graph). Ill. J. Math. 51, 805–830 (2007)
Cattaneo, C.: The spectrum of the continuous Laplacian on a graph. Monatshefte Math. 124(3), 215–235 (1997)
Cheeger, J.: A lower bound for the smallest eigenvalue of the Laplacian. In: Problems in Analysis: A Symposium in Honor of Salomon Bochner, pp. 195–199. Princeton University Press, Princeton (1970)
Chung, F.R.K.: Spectral Graph Theory. Am. Math. Soc., Providence (1997)
Chung, F.R.K., Yau, S.T.: Eigenvalues of graphs and Sobolev inequalities. Comb. Probab. Comput. 4, 11–26 (1995)
Davies, E.B.: Heat Kernels and Spectral Theory. Cambridge University Press, Cambridge (1989)
Evans, L.C.: Partial Differential Equations. Am. Math. Soc., Providence (1998)
Exner, P., Šeba, P.: Free quantum motion on a branching graph. Rep. Math. Phys. 28, 7–26 (1989)
Figotin, A., Kuchment, P.: Spectral properties of classical waves in high contrast periodic media. SIAM J. Appl. Math. 58(2), 683–702 (1998)
Gagliardo, E.: Proprietà di alcune classi di funzioni in più variabili. Ric. Mat. 7, 102–137 (1958)
Gnutzmann, S., Smilansky, U.: Quantum graphs: applications to quantum chaos and universal spectral statistics. Adv. Phys. 55, 527–625 (2006)
Harmer, M.: Hermitian symplectic geometry and extension theory. J. Phys. A, Math. Gen. 33, 9193–9203 (2000)
Kennedy, J.B., Mugnolo, D.: The Cheeger constant of a quantum graph. Proc. Appl. Math. Mech. 16, 875–876 (2016)
Kostrykin, V., Schrader, R.: Kirchhoff’s rule for quantum wires. J. Phys. A, Math. Gen. 32, 595–630 (1999)
Kottos, T., Smilansky, U.: Quantum chaos on graphs. Phys. Rev. Lett. 79, 4794–4797 (1997)
Kuchment, P.: Quantum graphs: I. Some basic structures. Waves Random Media 14, S107–S128 (2004)
Kuchment, P.: Quantum graphs: II. Some spectral properties of quantum and combinatorial graphs. J. Phys. A, Math. Gen. 38, 4887–4900 (2005)
Kurasov, P.: Quantum graphs: spectral theory and inverse problems. In press
Maz’ya, V.G.: Sobolev Spaces. Springer, Berlin (1985)
Maz’ya, V.G.: Lectures on isoperimetric and isocapacitary inequalities in the theory of Sobolev spaces. Contemp. Math. 338, 307–340 (2003)
Nicaise, S.: Spectre des réseaux topologiques finis. Bull. Sci. Math. (2) 111(4), 401–413 (1987)
Nirenberg, L.: On elliptic partial differential equations. Ann. Sc. Norm. Super. Pisa 13, 116–162 (1959)
Pankrashkin, K.: Spectra of Schrödinger operators on equilateral quantum graphs. Lett. Math. Phys. 77(2), 139–154 (2006)
Post, O.: Spectral analysis of metric graphs and related spaces. In: Limits of Graphs in Group Theory and Computer Science (Bernoulli Center, Lausanne), pp. 109–140 (2009). EPFL Press
Post, O.: Spectral Analysis on Graph-Like Spaces. Lecture Notes in Mathematics, vol. 2039 (2012)
Sobolev, S.: On a theorem of functional analysis. Transl. Am. Math. Soc.ger 34, 39–68 (1963)
von Below, J.: A characteristic equation associated to an eigenvalue problem on \(C^{2}\)-networks. Linear Algebra Appl. 71, 309–325 (1985)
Acknowledgements
The author would like to express his deep gratitude to the anonymous referees for their valuable suggestions, which led to the improvement of the article.
Availability of data and materials
Not applicable.
Funding
Not applicable.
Author information
Authors and Affiliations
Contributions
The author read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The author declares that he has no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Usman, M. Sobolev type inequalities for compact metric graphs. J Inequal Appl 2018, 271 (2018). https://doi.org/10.1186/s13660-018-1872-y
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13660-018-1872-y