The Ricci curvature on simplicial complexes
Taiki Yamada

TL;DR
This paper introduces a new way to define Ricci curvature on simplicial complexes, extending graph-based concepts, and uses it to estimate Laplacian eigenvalues, broadening geometric analysis tools.
Contribution
It generalizes Ricci curvature to simplicial complexes and establishes bounds and eigenvalue estimates, advancing geometric analysis in higher-dimensional structures.
Findings
Defined Ricci curvature on simplicial complexes.
Proved bounds for Ricci curvature in this setting.
Estimated Laplacian eigenvalues using the new curvature.
Abstract
We define the Ricci curvature on simplicial complexes by modifying the definition of the Ricci curvature on graphs, and we prove the upper and lower bounds of the Ricci curvature. These properties are generalizations of previous studies. Moreover, we obtain an estimate of the eigenvalues of the Laplacian on simplicial complexes using the Ricci curvature.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric Analysis and Curvature Flows · Geometry and complex manifolds · Advanced Differential Geometry Research
†† This work was supported by the Research Institute for Humanity and Nature (Director-General’s Discretionary Budge) and JSPS KAKENHI(21K13800).
2010 Mathematics Subject Classification. Primary 05C50; Secondary 53C21 .
Keywords; Simplicial complex, Ollivier’s Ricci curvature, Eigenvalue of Laplacian.
The Ricci curvature on simplicial complexes
Taiki Yamada
Interdisciplinary Faculty of Science and Engineering, Shimane University, Shimane 690-8504, Japan
Abstract.
We define the Ricci curvature on simplicial complexes by modifying the definition of the Ricci curvature on graphs, and we prove the upper and lower bounds of the Ricci curvature. These properties are generalizations of previous studies. Moreover, we obtain an estimate of the eigenvalues of the Laplacian on simplicial complexes using the Ricci curvature.
1. Introduction
The Ricci curvature plays an important role in Riemannian geometry when we investigate the global properties of a manifold. The Bonnet–Myers theorem and the Lichnerowicz theorem are good examples. Recently, Ollivier [Ol1] generalized the Ricci curvature through a method now known as Ollivier’s coarse Ricci curvature. By modifying this Ricci curvature, the Ricci curvature of a graph for two distinct vertices is defined as
[TABLE]
where is a random walk on and is the -Wasserstein distance between and . In 2010, Lin, Lu, and Yau [Yau1] defined the Ricci curvature of an undirected graph by using lazy random walk, and they studied the Ricci curvature of the product space of graphs and random graphs. In 2012, Jost and Liu [Jo2] defined the Ricci curvature on undirected graphs by using a simple random walk; therefore, their definition is simpler than Lin-Lu-Yau’s definition. In 2019, we first introduced the notion of the Ricci curvature of directed graphs [Y1]. We proved some global properties of directed graphs, but we had to assume a slightly strong condition. To solve this problem, in 2020, Eidi-Jost [Ei] defined the Ricci curvature on directed hypergraphs. Recently, we studied the transportation inequality along the heat flow and the concentration of measure inequality for directed graphs [YSO1]. In contrast, the coarse Ricci curvature on graphs has been applied to many fields, such as cancer networks [Tan] and Internet topology [14]. In this paper, we proved the upper and lower bounds of the Ricci curvature on simplicial complex modification [Jo2].
Theorem 1.1**.**
For -faces and with , if the weights of the facets are equal to 1, then we have
[TABLE]
where , , and for , if ; otherwise, it is 0.
The graph Laplacian is one of the most important concepts for obtaining the analytic properties of directed graphs. In 1847, Kirchhoff [Kir] first defined the graph Laplacian on real-valued functions. Subsequently, many studies have investigated the graph Laplacian and its spectrum. There are several definitions of the graph Laplacian in addition to the Kirchhoff graph Laplacian. One of the most famous definitions is the normalized graph Laplacian defined by Bottema [Bo]. The second is the higher-order combinatorial Laplacian defined by Eckmann [Eck]. This Laplacian is defined on simplicial complexes, not graphs, and is based on a discrete version of the Hodge theory. In 2013, by modifying the higher-order combinatorial Laplacian, Jost and Horak [Ho] developed a general framework for Laplacians defined by the combinatorial structure of a simplicial complex. This Laplacian is called the -Laplacian (see Definition 2.4). If we apply several weight functions to an inner product as given in Definition 2.3, then the -Laplacian with this weight covers every graph Laplacian obtained previously, so the -Laplacian is the best definition of the graph Laplacian. Additionally, one of the most important properties of the -Laplacian is that its nonzero spectrum on vertices coincides with that on edges (see (2.6) in [Ho]). Hence, in this study, we used the -Laplacian.
There is a good relationship between the coarse Ricci curvature and the Laplacian graph. In 2009, Ollivier [Ol1] estimated the first non-zero eigenvalue of the normalized graph Laplacian by a lower bound of the coarse Ricci curvature.
Theorem 1.2** (Ollivier, Proposition 30 in [Ol1]).**
Let be the non-zero eigenvalue of the normalized graph Laplacian . Suppose that for any and for a positive real number . Then, we have
[TABLE]
where is defined in Definition 2.6, and the normalized graph Laplacian is defined as
[TABLE]
for any vertex and for a function .
In 2009, Bauer et al. [Jo0] obtained an estimate of the eigenvalues of the normalized graph Laplacian on neighborhood graphs using the Ricci curvature. For simplicial complexes, we [Yamada3] obtained an estimate of the Laplacian using the Ricci curvature. However, we considered only one-dimensional simplicial complexes and assumed many conditions, so the setting of our main result in this paper is more general, and the result is an improvement over our previous result [Yamada3]. This statement is as follows:
Theorem 1.3**.**
Let be an orientable -dimensional simplicial complex and be the eigenvalue of . Assume that for any and for a real number . Then, we have
[TABLE]
Because a graph is a 1-dimensional simplicial complex, this result expands Theorem 1.2 to a simplicial complex.
In this paper, we refer to the definition of the Laplacian on simplicial complexes and define the Ricci curvature on simplicial complexes (§2). In §3, we prove the upper and lower bounds of the Ricci curvature. In §4, we prove Theorem 1.3. In §5, we present some examples of our results. Finally, we summarize this paper and describe a future plan (§6).
2. Preliminaries
2.1. Laplacian on simplicial complexes
In this section, we present several definitions of simplicial complexes, including the Laplacian and the Ricci curvature of simplicial complexes. An abstract simplicial complex is a collection of subsets of a finite set that is closed under inclusion. An -face of is an element of cardinality , and denotes the set of all -faces of . A face is said to be oriented if we choose an ordering on its vertices, and an oriented face is denoted by . The faces that are maximal under inclusion are called facets, and a simplicial complex is said to be pure if all facets have the same dimensions. For any -face , the dimension of is , and the dimension of is the maximum dimension of the faces in . The -th chain group of with coefficients in is a vector space over the real field with basis , and the -th co-chain group is defined as the dual of the -th chain group.
Definition 2.1**.**
For the cochain groups, the simplicial coboundary maps
, , are defined by
[TABLE]
for , where implies that vertex has been removed.
Note that the one-dimensional vector space is generated by a function with . To define the Laplacian, we define the boundary between the oriented face and the inner product.
Definition 2.2**.**
Let be an oriented -face of and
be the oriented -face of . The boundary of the oriented face is defined as
[TABLE]
and the sign of at the boundary of is denoted by sgn().
Definition 2.3**.**
An inner product on space is defined as follows:
[TABLE]
for , , where is a function with . We call the weight function on .
For the inner product on , the adjoint operator of the coboundary operator is defined as
[TABLE]
for and , respectively.
Definition 2.4** (Horak-Jost [Ho]).**
We define the Laplacian on as follows.
- (1)
The -dimensional combinatorial up Laplacian or simply the -up Laplacian is defined by
[TABLE] 2. (2)
The -dimensional combinatorial down Laplacian or simply the -down Laplacian is defined by
[TABLE] 3. (3)
The -dimensional combinatorial Laplacian or simply the -Laplacian is defined by
[TABLE]
For any function and any -face , the -up Laplacian and the -down Laplacian are given by
[TABLE]
and
[TABLE]
As these operators are all self-adjoint and non-negative, the eigenvalues are real and non-negative (see [Ho]).
Remark 2.5*.*
Since and , we have and , where denotes the image and denotes the kernel of an operator . Thus, is a non-zero eigenvalue of if and only if it is a nonzero eigenvalue of either or .
We represent the Laplacians in a matrix form. Let be the matrix corresponding to operator and be the diagonal matrix representing their scalar product on . Then, operators and are expressed as
[TABLE]
where is the transpose of matrix . Using these matrix forms, is a non-zero eigenvalue of if and only if it is a nonzero eigenvalue of .
Definition 2.6**.**
The degree of an -face is defined by
[TABLE]
Remark 2.7*.*
If, for every face of simplicial complex that is not a facet, we take and the weights of the facets are equal to 1, then the obtained operators are denoted by and . In particular, corresponds to the normalized graph Laplacian .
2.2. Ricci curvature on simplicial complexes
Hereafter, we consider an abstract simplicial complex with more than one dimension. We note that the case of one-dimensional simplicial complexes corresponds to the case of undirected graphs. To consider the Ricci curvature on a simplicial complex, we define the distance of a simplicial complex.
Definition 2.8**.**
- (1)
Any two -faces and are connected, denoted by , if there exists an -face such that . We denote the -neighborhood of and -neighborhood of by and , respectively; that is, and . 2. (2)
A path from face to face is a sequence of connected faces , where , . We call the length of the path. 3. (3)
The distance between two faces and is given by the length of the shortest path from to . 4. (4)
is said to be -path connected if any two -faces can be connected by a path.
Next, we define the 1-Wasserstein distance between probability measures.
Definition 2.9**.**
The 1-Wasserstein distance between any two probability measures and on is given by
[TABLE]
where runs over all maps, satisfying
[TABLE]
Such a map is called a coupling between and .
Remark 2.10*.*
There exists a coupling that attains the -Wasserstein distance (see [Le], [19], and [Vi2]), which we call an optimal coupling.
One of the most important properties of the -Wasserstein distance is the Kantorovich–Rubinstein duality.
Proposition 2.11** (Kantorovich, Rubinstein).**
The -Wasserstein distance between any two probability measures and on is written as
[TABLE]
where the supremum is taken over all functions on that satisfy for any . A function on is said to be -Lipschitz if for any .
In this paper, we use the following probability measure on .
Definition 2.12**.**
For any -face , we define a probability measure on as
[TABLE]
We note that a probability measure on corresponds to a simple random walk.
Using this probability measure, we define the Ricci curvature.
Definition 2.13**.**
For any two distinct -faces and , the Ricci curvature of and is defined as follows:
[TABLE]
Clearly, we prove the following lemma, and thus, we obtain an upper bound of the Ricci curvature.
Lemma 2.14**.**
For any two distinct -faces and , we have
[TABLE]
Proof.
We define a delta function . By the triangle inequality, we have
[TABLE]
which implies that
[TABLE]
This completes the proof. ∎
3. Properties of the Ricci curvature on simplicial complexes
3.1. Upper and lower bounds of the Ricci curvature
In the case of graphs, Jost-Liu proved a relation between the Ricci curvature and the local clustering coefficient [Jo2]. In this subsection, we extend these properties to the case of simplicial complexes. To do so, we must prepare some notations (see Figure 1).
[TABLE]
Before we prove Theorem 1.1, we present the statement again:
Theorem 1.1 For -faces and with , if the weights of the facets are equal to 1, then we have
[TABLE]
where , , and for , if ; otherwise, it is 0.
Remark 3.1*.*
For , this statement corresponds to Theorem 3 in [Jo2]. In a general simplicial complex, we need to consider the elements of , which complicates the proof.
In the proof, we use the following notations:
For a real number and set , .
Proof of Theorem 1.1..
Without loss of generality, we suppose that
[TABLE]
We consider a coupling between and . For simplicity, we define
[TABLE]
To refer the transfer plan of faces, we define
[TABLE]
Subsequently, we obtain . In addition, because , a bijective map exists between and .
Case 1. .
Our transfer plan for moving to should be as follows:
- (1)
Move the mass of from to -faces in . This is well defined because we have . 2. (2)
Move the mass of to itself at -face in , and move the rest from an -face in to -faces in . 3. (3)
Move the mass of from a face to . 4. (4)
Move the mass of at -faces in , and the rest at -faces in to . This is well defined because we have
[TABLE]
which implies . 5. (5)
The rest of (4) is
[TABLE]
This is performed in and to -faces in .
Then, by using this transfer plan and calculating the 1-Wasserstein distance between and , we obtain
[TABLE]
which implies that
[TABLE]
Case 2. .
Our transfer plan for moving to should be as follows:
- (1)
Move the mass of from to -faces in . This is well defined because we have . 2. (2)
Move the mass of to itself at -face in . 3. (3)
Move the mass of from a face to . 4. (4)
Move all mass of at -faces in , and the rest at -faces in to . This is well defined because we have
[TABLE]
which implies . 5. (5)
Move the rest from an -face in to -faces in .
Then, by using this transfer plan and calculating the 1-Wasserstein distance between and , we obtain
[TABLE]
which implies that
[TABLE]
Case 3. .
Our transfer plan for moving to should be as follows:
- (1)
Move the mass of to itself at -face in , and move the rest to . 2. (2)
Move from to -faces in . This is well defined because we have
[TABLE]
which implies . Then, move the rest to . 3. (3)
Move all mass of at -faces in , and the rest at -faces in to . This is well defined because we have
[TABLE]
which implies . 4. (4)
Move the mass of from a face to , and move the rest to .
Then, by using this transfer plan and calculating the 1-Wasserstein distance between and , we have
[TABLE]
which implies that
[TABLE]
Then, this completes the proof. ∎
Theorem 3.2**.**
Let and be faces with . We have
[TABLE]
Remark 3.3*.*
For , this statement corresponds to Theorem 4 in [Jo2]. Moreover, this theorem is proved in the same manner as Theorem 4 in [Jo2].
Regarding the lower bound of the Ricci curvature, the following lemma implies that considering the Ricci curvature of connected faces is sufficient, although the Ricci curvature is defined for any pair of faces.
Proposition 3.4** (Lin-Lu-Yau [Yau1]).**
If for any connected faces and for a real number , then for any pair of faces .
This proposition is proved in the same manner as Lemma 2.3 in [Yau1].
4. Estimate of the eigenvalues of the Laplacian by the Ricci curvature
In this section, we discuss the relation between the eigenvalue of the normalized -up Laplacian and the Ricci curvature. To prove Theorem 1.3, we have stated a few definitions and theorems.
Definition 4.1**.**
Let be an -path connected simplicial complex.
- (1)
is orientable if an orientation exists on the -faces of , such that for any -faces satisfying , where and are -faces, holds. 2. (2)
is opposite orientable if an orientation exists on the -faces of , such that for any -faces satisfying , where and are -faces, holds.
Remark 4.2*.*
For graphs, a constant function is an eigenfunction of the eigenvalue [math]; therefore, for , we consider the eigenvalues of the normalized -up Laplacian. If is orientable, then a constant function is an eigenfunction of the eigenvalue . In contrast, if is opposite orientable, no eigenvalue exists such that the eigenfunction is a constant function.
Before we prove Theorem 1.3, we present the statement again:
Theorem 1.3 Let be an orientable -path-connected simplicial complex and be the eigenvalue of , except for . Assume that for any and for a real number . Then, we have
[TABLE]
Proof of Theorem 1.3.
Let be an eigenfunction with respect to . Based on this assumption, is not a constant function; hence, by scaling , if necessary,
[TABLE]
We fix any two faces , and we have . Based in the definition of the probability measure on , is represented as follows:
[TABLE]
Then, using the Kantorovich duality and Eq. (4.3), we calculate the Wasserstein distance.
[TABLE]
Thus, based on the assumption and Eq. (4.1), we obtain
[TABLE]
which implies that
[TABLE]
∎
Corollary 4.3**.**
Let be an opposite orientable -path-connected simplicial complex and be the eigenvalue of . Assume that for any and for a real number . Then, we have
[TABLE]
is represented as follows:
[TABLE]
The proof is the same as Theorem 1.3.
Remark 4.4*.*
Because any connected graph is opposite orientable, the eigenvalue of the normalized graph Laplacian is
[TABLE]
Thus, Corollary 4.3 is a generalization of Theorem 1.2.
5. Example
Example 5.1**.**
If we consider an -face (for , see Figure 2), then for , the probability measure is
[TABLE]
and the Ricci curvature is
[TABLE]
Thus, by Theorem 1.3, we obtain
[TABLE]
In contrast, in [Ho], the eigenvalues are [math] and ; thus, the value corresponds to the lower bound of our result.
Example 5.2**.**
We consider with . (see Figure 2). From Theorem 1.1 and Theorem 3.2, for any , we obtain
[TABLE]
In contrast, is orientable because we orient -faces and -faces as follows:
[TABLE]
[TABLE]
Thus, by Theorem 1.3, we have
[TABLE]
Example 5.3**.**
We consider with
[TABLE]
From Theorem 1.1 and Theorem 3.2, for any , we obtain
[TABLE]
In contrast, is orientable because we orient -faces and -faces, similar to Example 5.2. Thus, by Theorem 1.3, we have
[TABLE]
6. Conclusion
- (1)
Theorem 1.1 and Theorem 3.2 are generalizations of the result in [Jo2]. Based on these results, if we consider the Ricci curvature on simplicial complexes, the calculation is more complicated than that implemented using the graphs. 2. (2)
A primary result, namely Theorem 1.3, is the most general estimate of the non-zero eigenvalue of -Laplacian. However, this estimate may not be statistically significant. 3. (3)
To prove Theorem 1.3, we assumed the orientation of faces. This differs from the undirected case; therefore, removing these conditions is essential. To do this, a different approach is required. 4. (4)
If the Ricci curvature is negative, our results have no meaning, and thus, we intend to improve our results.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[14] C.-C. Ni, Y.-Y. Lin, J. Gao, D. Gu, E. Saucan, Ricci curvature of the Internet topology , Proceedings of the IEEE Conference on Computer Communications, INFOCOM 2015, IEEE Computer Society (2015)
- 2[19] C. Villani, Topics in Mass Transportation , Graduate Studies in Mathematics, Amer. Mathematical Society 58 (2003).
