Abstract
Topological data analysis, as a tool for extracting topological features and characterizing geometric shapes, has had tremendous success across diverse fields. Its key mathematical techniques include persistent homology and the recently developed persistent Laplacians. However, classic mathematical models like simplicial complexes often struggle to provide a localized topological description for interactions or individual elements within a complex system involving a specific set of elements. In this work, we introduce persistent interaction homology and persistent interaction Laplacian that emphasize individual interacting elements in the system. We demonstrate the stability of persistent interaction homology as a persistent module. Furthermore, for a finite discrete set of points in the Euclidean space, we provide the construction of persistent interaction Vietoris-Rips complexes and compute their interaction homology and interaction Laplacians. The proposed methods hold significant promise for analyzing heterogeneously interactive data and emphasizing specific elements in data. Their utility for data science is demonstrated with applications to molecules.
Keywords: Topological data analysis, interaction homology, interaction Laplacian, topological persistence, interaction Vietoris-Rips complex
2020 Mathematics Subject Classification. Primary: 55N31; Secondary: 62R40, 68T09
1. Introduction.
In the past decade, topological data analysis (TDA), as a tool capable of capturing the overall and topological features of data, has been widely applied in various fields, including biology, materials science, physics, and computer science. Its key idea is to grasp the various topological invariants of data across different scales. Persistent homology [8, 13, 31], as a major tool in TDA, can identify persistent topological structures in a dataset, providing insights into important features that cannot be obtained from traditional data analytic tools. It not only discovers voids and loops in the data but also quantitatively describes the persistence of these topological features and formalizes them into mathematical concepts, thus providing a powerful tool and framework for data science. However, persistent homology has many limitations, such as its indifference to homotopic changes during the filtration and the specific elements and the number of nodes in a loop, which are crucial for complex data. These challenges were addressed in part by persistent Hodge Laplacians (or evolutionary de Rham-Hodge theory [12]) and persistent combinatorial Laplacian (or persistent Laplacian [24]) in 2019. The kernel space of the persistent Laplacian is referred to as the persistent harmonic space, which is isomorphic to persistent homology, implying that the persistent Laplacian encapsulates more information than persistent homology due to its non-harmonic spectrum. Moreover, the stability of the persistent Laplacian ensures its robustness as features [18]. Furthermore, researchers have investigated persistent Laplacians on different topological objects [10, 21, 25, 29], computational algorithms [19], and applications [20, 27, 28]. Recently, persistent Dirac operators have also been developed to achieve similar goals [2, 22, 26]. While these new topological formulations provide new perspectives on topological invariants and geometric features of the data, the element-specific formulation proposed in an early work [7] is still required in practical applications [20, 23, 27, 28].
To further advance TDA, it is imperative to explore alternative topological formulations beyond homology, Laplacian, and Dirac and extract element-specific topological information in contrast to the usual global topological information. Interaction refers to the dynamic exchange and mutual influence between various components within a system. It encompasses the ways in which these components affect each other’s behaviors, properties, and functions, often resulting in emergent phenomena or system-level outcomes that cannot be fully explained by considering individual components in isolation. Interactions can occur at different scales, from interactions between fundamental particles in physics to complex molecular interactions in chemistry, and even to interactions between organisms in biological systems. Understanding interactions is essential for comprehending the dynamics and behavior of systems across various disciplines.
There are numerous methods to describe interactions within systems, with topology being considered particularly adept at capturing the essence of these interactions. Among these, Čech cohomology [5, 30] stands out as a prominent invariant, focusing on the intersections between open sets in an open cover. A related concept is the nerve complex [1, 15], which provides a topological representation of the relationships between various components within a system. However, both Čech cohomology and nerve complexes primarily address a form of binary judgment regarding the interactions between different parts of the system: whether they intersect or have some form of association. This characterization, to some extent, is somewhat crude. In this work, we aim to study the interactions between topological spaces and characterize these interactions using topological invariants. Specifically, we seek to use topological invariants to capture the structure and dynamics of interacting systems, and to gain insights into their underlying geometric and topological properties for specific elements. One potential approach is the interaction topology developed in [17]. The notion of interaction cohomology, initially proposed by Oliver Knill as a method for decoding the Wu characteristic [16], stands as a pivotal concept in this endeavor. As the word “interaction” suggests, interaction homology reflects the interaction or intersection relationship between simplicial complexes. Interaction (co)homology is derived from the interaction chain complex, which is constructed from a family of tuples of intersection simplices, or “intersection cells”. Each interaction simplex indicates a interaction among some simplices. By employing interaction topology, one can obtain a different topological description of a cover, which better characterizes the behavior of interactions or the elements of interest. Hence, studying the interaction homotopy and homology of datasets provides us with a topological intuition about the interactions between systems or the points of interest.
In this work, we introduce two new methods, namely persistent interaction homology (PIH) and persistent interaction Laplacian (PIL), built upon the theoretical framework of interaction topology. PIH and PILs provide new topological characteristics, emphasizing spatial interaction relationships or a specific set of elements. Unlike traditional methods such as persistent homology and persistent Laplacians, which view the space or point set as a whole and calculate Betti numbers and Laplacian matrices accordingly, PIH and PILs focus on describing the interactions and relationships among various elements of the space or point set. PIH and PILs are better than traditional topological methods at capturing the interactions between different parts, leading to an emphasis of certain elements of interest in complex systems. Additionally, we demonstrate the stability of persistent interaction homology as a persistent invariant. Furthermore, we introduce interaction Vietoris-Rips complexes, outlining their construction and computation on point sets. Through concrete examples, we illustrate how this new approach provides information on Betti numbers and spectral gaps of Laplacians.
The rest of the paper is organized as follows. In the next section, we review interaction topology, including concepts such as interaction homology and interaction Laplacian. Section 3 introduces persistent interaction homology and investigates its stability. Additionally, we discuss interaction Vietoris-Rips complexes and persistent interaction Laplacians. Section 4 presents the applications of persistent interaction homology and persistent interaction Laplacian. Finally, we conclude the paper with a summary.
2. Interaction topology.
Interaction spaces are introduced to describe the interactions among different spaces within a complex system. The interactions between spaces play crucial roles in diverse fields. Our method is built on the topology of the category of interaction spaces [17]. In this section, we will consider the interaction homology and the interaction Laplacians for interaction simplicial complexes. To enhance the readability of the paper, this section provides several specific examples of computing interaction homology and interaction Laplacian. From now on, the ground ring is assumed to be a field . For -modules , we write the tensor product of and over by for convenience.
2.1. Interaction homology.
An n-interaction simplicial complex () consists of a simplicial complex equipped with a family of sub complexes such that . A morphism of n-interaction simplicial complexes consists of a family of simplicial maps such that for any if and only if , where . For convenience, we always refer to the interaction simplicial complex as and denote interaction morphism as .
Given an interaction simplicial complex , we have a family of chain complexes for . The tensor product is naturally a chain complex with the differential given by
Here, for . Let denote the sub -linear space of with generators satisfying . It can be verified that is the subcomplex of with the inherited differential. The interaction chain complex on is defined by
Thus the interaction homology of is given by
The rank of is the interaction Betti number, and we denote it by .
Example 2.1. Consider the interaction complex (see Fig. 1(a)), where
Figure 1.

The visual representation of interaction complexes presented in examples. The black parts signify the intersection components, while the red and black areas delineate , and similarly, the blue and black regions illustrate . (a) The interaction complex showcased in Example 2.1; (b) The interaction complex with , as discussed in Example 2.2; (c) The interaction complex considered in Example 2.4; (d) The interaction complex that appeared in Example 2.5.
The interaction chain complex is generated by the following elements
The differential is given by and
Thus the space of cycles of is generated by
while the space of boundaries of is generated by . Hence, we have
So the interaction homology of is
The corresponding Betti number for is and for .
Example 2.2. Let be the simplicial complex of the standard n-simplex. Consider the interaction complex such that , see Fig. 1(b) for . For the case , the complex has the non-degenerate element , , and . Then the interaction chain complex is generated by the following elements
Besides, the differential of is given by ,
and
Let be the representation matrix of the differential with respect to the chosen basis. Recall that
Thus we have and for . It follows that It is quite different from the usual simplicial homology.
For the case , one can verify that the interaction homology of the interaction complex is Indeed, the cycle
gives the homology generator . It is impossible for the element to be a boundary. If is a boundary of the form , we can write . Here, is the sum of other terms. Note that does not contribute to the term of forms or . We have that
It follows that , which has no solution. Thus is not a boundary, and is indeed a homology generator.
In general, for any , we can obtain that
Consider the case and . The Wu characteristic of is defined by . Here, means for .
The Euler theorem asserts that for a simplicial complex , one has
Here, is the Euler characteristic of . Similarly, we have the theorem for Wu characteristic
where is the interaction Betti number for with . It is shown that the interaction homology decodes the Wu characteristic in topology.
Example 2.3. Let be the boundary of a triangle. The elements of can be listed as
On can prove that the interaction Betti number is
Let us count the interaction pairs. The 0-dimensional pairs are , , and . The 1-dimensional pairs are listed as
The 2-dimensional pairs are represented as
There is no interaction pairs of dimension . It follows that the Wu characteristic is
This is the same as the alternating sum of the interaction Betti numbers
For the example of , one can verify the presence of three 0-dimensional interaction pairs, twelve 1-dimensional interaction pairs, fifteen 2-dimensional interaction pairs, six 3-dimensional interaction pairs, and one 4-dimensional interaction pair. The corresponding Wu characteristic is
This aligns with the calculations in Example 2.2, showing that
Consider the category of interaction simplicial complexes. The objects in are the n-interaction simplicial complexes, and the morphisms are the morphisms of n-interaction simplicial complexes.
For each morphism , we have a morphism of chain complexes
Composite with the quotient map, we obtain a morphism of chain complexes
Note that . The morphism of chain complex induces a morphism of chain complexes
given by . The morphism induces a map of homology
The following result shows that the interaction homology from the category of interaction complexes to the category of vector spaces is a functor.
Proposition 2.1. The interaction homology is functorial.
Proof. Let and be morphisms of interaction simplicial complexes. Then for any cycle , one has
By verifying the definition, we obtain that is functorial. □
2.2. Interaction Laplacian.
On the chain complex of simplicial complexes, there exists a combinatorial Laplacian, and its kernel space is commonly referred to as the harmonic space, which is isomorphic to the simplicial homology of the simplicial complex. In addition to this, researchers have explored Laplacians on path complexes, hypergraphs, and hyperdigraphs. These Laplacians serve to reflect the topological and geometric characteristics of various objects, holding significant potential in data analysis applications such as molecular structure analysis and material structure analysis. In this section, we will explore the Laplacian operator on interaction complexes from now on. The ground field is taken to be the real number field .
Let be an interaction simplicial complex. One can obtain an interaction chain complex . We endow with the inner product
where and It induces the quotient inner product structure on , also denoted by . Note that and are orthogonal for . Let be the differential at degree . We have the adjoint operator , which is given by
for all . The p-th interaction Laplacian is defined by
In particular, . Let be the representation matrix of with respect to the standard orthogonal basis. Then the representation matrix of is given by
The zero eigenvalues of the Laplacian reflect information about its harmonic components, while the non-zero eigenvalues indicate information about its non-harmonic components. Among these, the smallest positive eigenvalue of , known as the spectral gap, is the most commonly used non-harmonic feature.
Proposition 2.2. The Laplacian on is self-adjoint and non-negative definite.
The non-negative definiteness ensures that the eigenvalues of the operator are non-negative. Moreover, we have the algebraic Hodge decomposition on .
Proposition 2.3. . Here, is isomorphic to the interaction homology .
The proofs of the above results are standard and can be found in detail in [18].
Example 2.4. Consider the interaction complex (see Fig. 1 (c)), where
The interaction chain complex of is generated by
The corresponding differential is given by ,
and
We denote the representation matrix of by . The Laplacian matrices are
and
The spectra of Laplacians are , and .
Example 2.5. Consider the interaction complex (see Fig. 1 (d)), where
and
Then the interaction chain complex has the generators
0-dim: ,
1-dim: ,
2-dim: .
Choose the interaction simplices as orthogonal basis. Then the interaction homology is
Moreover, the calculation of Laplacians are shown in Table 1.
Table 1.
Illustration of interaction Laplacians in Example 2.5.
| 0 | 0 | ||
| 1 | 0 | ||
| 2 | 1 |
3. Persistence on interaction complexes.
3.1. Persistent interaction homology.
While persistent homology captures the topological features and geometric shapes of spaces, persistent interaction homology provides a topological description of the interactions between spaces. By analyzing the interactions between spaces, we can gain insights into how the topology of the spaces affects their behavior and dynamics. This can have applications in a variety of fields, including biology, physics, and social sciences. In this section, the ground field is assumed to be the field . If we consider the Laplacian, the ground field is taken to be the real number field .
Let be a poset with the partial order . Then we can regard as a category with objects given by the elements in and morphisms of the form for any . A persistence object on a category is a functor .
A persistence n-interaction (simplicial) complex is a functor : . By Proposition 2.1, we have a persistence module
For any elements in , the ()-persistent interaction homology is defined by
The -persistent interaction Betti number is . Just like the traditional persistent homology, the corresponding persistent Betti numbers of persistent interaction homology can also be represented using persistence diagrams and barcodes. The persistence diagrams and barcodes provide a concise and intuitive way to capture the topological information that is persistent across a range of distance or interaction scales.
Typically, the poset () is taken to be the ordered set of integers () with the usual order. Classical theorems in persistent homology theory, such as the decomposition theorem of persistence modules and the interval theorem for barcodes, can also be applied to persistent interaction homology. These theorems provide fundamental mathematical tools for analyzing the structure and properties of persistent homology, and can be used to gain deeper insights into the topological features of interacting systems.
3.2. Stability for persistent interaction homology.
In [9], the authors introduced the interleaving distance to describe the algebraic stability theorem for persistence diagrams. Interleaving distance has been shown to be a generalization of the bottleneck distance [6] and has become a fundamental tool for analyzing the stability of persistence objects [3, 14, 18]. In this section, we will provide a brief overview of the definition of interleaving distance and present the stability theorem for persistent interaction homology.
Let be a category, and let be the category of functors from to . Then for any functor , we have a functor given by . Obviously, is a natural transformation.
Definition 3.1. Let be two persistence objects. An -interleaving between and consists of two natural transformations and such that and . We say that and are -interleaved.

The interleaving distance between and is defined by
Theorem 3.2. Let be two persistence interaction complexes. We have
Proof. The proof is completed by Proposition 2.1 and [6, Proposition 3.6]. □
Consider an interaction complex equipped with a non-decreasing real-valued function
that is, whenever is a face of in for any . For each real number , we have an interaction complex
This construction gives us a persistence interaction complex .
Now, given two non-decreasing real-valued functions , we define the distance between and on as
Here, .
Theorem 3.3. Let be an interaction complex equipped with two non-decreasing real-valued functions . We have
Proof. Let . Then there are inclusion morphisms and for any real number . The inclusions induce the natural transformations and . It follows that
is an inclusion. So we have . Similarly, one has . Hence, the persistence interaction complex and are -interleaved. By Theorem 3.2, one has
The desired result follows. □
3.3. Interaction Vietoris-Rips complexes.
The Vietoris-Rips complex is a commonly used geometric object that can be constructed from a set of points in a metric space. It is a simplicial complex that captures the topological features of the point cloud data, such as its connected components, loops, voids, and higher-dimensional holes. To study the interactions between a family of sets of points, one can construct the corresponding interaction Vietoris-Rips complex. This complex is formed by taking the Vietoris-Rips complexes of each set of points separately and then forming their intersection. The interaction Vietoris-Rips complex is a powerful tool in the study of complex systems where multiple interacting components are present.
Let be a family of sets of points in Euclidean space. Here, the point sets do not require to be disjoint. We can obtain a family of Vietoris-Rips complexes . Thus one has an interaction Vietoris-Rips complex .
Lemma 3.4. Let () be a metric space, and let be two finite subsets. For any , let denote the Vietoris–Rips complex on , defined by
Let denote the full simplex on , i.e., the collection of all nonempty subsets of . Then,
Proof. We prove the equality by showing inclusion in both directions.
Suppose . Then , and for all , we have . Hence and , so .
Conversely, suppose . Then and all pairwise distances in are at most . Since , we also have , and hence .
This proves the desired equality. □
Let denote the Vietoris-Rips complex of the union at scale . The following proposition describes how the interaction complexes grow with respect to .
Theorem 3.5. For any real numbers , we have . Moreover, if
then .
Proof. For each , since is a Vietoris–Rips complex, we have a natural inclusion
This induces an inclusion of interaction Vietoris–Rips complexes
Now suppose that
For each , we then have
where the equalities follow from Lemma 3.4. Hence, . □
Hence, we have a persistence interaction complex
For real numbers , we have a filtration of interaction complexes
It induces a filtration of interaction homology
For , the -persistent interaction homology for is given by
for .
Example 3.1. Consider two point sets embedded in Euclidean space
As the filtration parameter grows from 0 to . One has the interaction complex changes at the parameters . The filtration of interaction complexes is shown in Figure 2(a). Point set consists of red and black points, while point set is composed of blue and black points. The black points represent the intersection of point sets and .
Figure 2.

(a) The filtration of interaction complexes. The black part represents the intersection component. The red and black points generate the Vietoris-Rips complexes on , while the filtration of the blue and black points illustrates the Vietoris-Rips complexes on . The combination of the two interacting filtrations results in the filtration of Vietoris-Rips complexes. (b) The barcode of the Vietoris-Rips complexes on the union of and . (c) The barcode of the Vietoris-Rips complexes on the insection of and . (d) The barcode of the interaction Vietoris-Rips complexes on .
The persistent interaction homology of provides multiscale topological features of the interaction between the point sets and . Figure 2(d) illustrates the barcode for the filtration of interaction complexes derived from the interaction of and . On the other hand, we also examine the Vietoris-Rips complexes on the union of and , as well as the Vietoris-Rips complexes on the intersection of and . The corresponding barcodes are depicted in Figure 2(b) and 2(c). In this particular example, we observe that the interaction Vietoris-Rips complexes can capture changes in the filtration parameter at 1 and , whereas the Vietoris-Rips complexes on and only reveal variations at the value of 1. Certainly, this example does not conclusively demonstrate that the interaction Betti numbers contain more information than the Betti numbers of ordinary simplicial homology. However, it does highlight a key point: interaction Betti numbers can capture distinct topological features when multiple point sets are intertwined. Even in cases where the complexes may be contractible, interaction Betti numbers can still exist. In fact, when it comes to one-dimensional features like persistent Betti numbers, it is challenging to definitively determine superiority. The significance of interaction Betti numbers lies in their ability to reflect the interactive relationships within a system, a task not easily achieved with conventional persistent homology alone. In other words, interaction Betti numbers, while reducing computational complexity, focus specifically on the topological properties of relationships between different systems rather than the local topological properties of each individual system.
For other complexes constructed on point set, such as alpha complexes, we can also consider their corresponding interaction complexes and compute the interaction persistent homology.
3.4. Persistent interaction Laplacians.
Numerous studies have been conducted on the persistent Laplacian [12, 18, 19]. In recent years, the persistent Laplacian has also found extensive applications in the fields of biomolecules, drug design, and materials science [11, 20, 24, 27]. Besides, persistent Laplacians on different objects are also studied [10, 25, 29]. From now on, we will study the persistent interaction Laplacian and provide some basic calculation examples.
Let be a filtration of interaction complexes. We endow with the basis as given in Section 2.2 and regard as an inner product space. By Lemma 3.6, each interaction complex inherits the inner product structure as the subspace of .
Lemma 3.6. Let and be interaction complexes. Suppose is a sub interaction space of . Then there is a natural inclusion of chain complexes.
Proof. By construction, we have the following commutative diagram.

Here, the map is given by . We will first prove is injective. Suppose for some . There exists an element such that . Consequently, . This implies . Therefore, we have for some . Note that the maps and are inclusions. Thus we have
Consequently, we obtain . It follows that is injective. The naturality follows from the definition. □
Let denote the subcategory of whose objects are interaction complexes and whose morphisms are inclusion maps between interaction complexes. Let : be a persistence interaction complex. For real numbers , we have an induced morphism of interaction chain complexes
Lemma 3.6 ensures that the morphism establishes as an inner product subspace of . Let . Then we have an inclusion . Let be the composition of the following morphisms
Then we have a commutative diagram

The p-th -persistent interaction Laplacian is defined by
In particular, when , the persistent interaction Laplacian coincides with the interaction Laplacian on . Similarly, the persistent interaction Laplacian operator is self-adjoint and non-negative definite. The eigenvalues for consist of the spectral of the operator. The smallest positive eigenvalue is the spectral gap, while the second smallest eigenvalue is called the Fiedler vector. The kernel of is a subspace of , referred to as the -persistent interaction harmonic space. It is worth noting that the complex has the combinatorial Hodge decomposition with the persistent interaction harmonic space as a direct sum component. More precisely, we have the following proposition.
Proposition 3.7. For any real numbers , we have . Here, the persistent interaction harmonic space .
Proof. For any , we have for some . It follows that
Since the injection gives the inner product structure inherited from , we have
for any . It follows that . Thus we have
This shows that . By the algebraic Hodge decomposition theorem, one has the decomposition
where . □
For the simplicial case, the kernel of the persistent Laplacian is isomorphic to the corresponding persistent homology. In the interaction case, the persistent harmonic space associated to is also isomorphic to the corresponding persistent interaction homology. By [18, Theorem 3.6], one has the following result.
Proposition 3.8. For any real numbers , we have a natural isomorphism .
The spectrum of the persistent interaction Laplacian comprises the eigenvalues of . The harmonic part of the spectrum corresponds to the zero eigenvalues. The non-zero eigenvalues of , referred to as the non-harmonic spectrum of , capture the geometric information of interaction complexes. Compared to the spectral description of simplicial complexes, which captures the connectivity information between individual simplices, the spectrum of the interaction complex describes the connectivity between interaction pairs. Among these eigenvalues, the smallest positive eigenvalue, denoted by , holds crucial significance for various applications. Here, we make the convention that if the smallest positive eigenvalue does not exist, we set .
Example 3.2. Example 3.1 continued. In this example, we will compute the interaction Laplacians of interaction Vietoris-Rips complexes. The smallest eigenvalues of the interaction Laplacians provide us with crucial features for datesets. By a straightforward calculation, we have that
Figure 3 shows that curves of smallest positive eigenvalues of interaction Laplacians. As the filtration parameter increases, the smallest positive eigenvalues of interaction Laplacians undergo gradual changes. Specifically, notable variations in the curve are observed at and . This indicates that the eigenvalues of Laplacians can capture essential information about the key filtration parameters.
Figure 3.

(a) The curve of smallest positive eigenvalues of interaction Laplacian at dimension 0; (b) The curve of smallest positive eigenvalues of interaction Laplacian at dimension 1.
Figure 4 shows that curves of smallest positive eigenvalues of usual Laplacians of and . The 0-dimensional eigenvalue curve and the 1-dimensional eigenvalue curve coincide for the point sets and , respectively. For the case of the point set , Figures 4(a) and (b) do not clearly convey the variation of eigenvalues for the filtration parameter . Similarly, for the point set , Figures 4(c) and (d) do not adequately capture the changes in eigenvalues for the filtration parameter .
Figure 4.

(a) The curve of smallest positive eigenvalues of the usual Laplacian of at dimension 0; (b) The curve of smallest positive eigenvalues of the usual Laplacian of at dimension 1; (c) The curve of smallest positive eigenvalues of the usual Laplacian of at dimension 0; (d) The curve of smallest positive eigenvalues of the usual Laplacian of at dimension 1.
This example highlights the distinctive nature of the interaction Laplacian compared to the conventional Laplacians on simplicial complexes. The interaction Laplacian can offer typical topological and geometric insights into the interaction space, making it a promising tool for various applications.
4. Applications.
In this section, we apply persistent interaction homology (PIH) and persistent interaction Laplacians (PILs) to analyze molecular structures. Typically, a molecule comprises various elements, each playing a distinct role in its composition. Moreover, interactions and collaborations exist among different types of atoms within a molecule, implying the presence of internal interactions. Building upon this understanding, we attempt to employ PIH and PILs for element-specific molecular structure analysis. Specifically, interaction Betti numbers and interaction spectral gaps are utilized as topological features to characterize internal interactions within the molecule. We consider two examples: one involving the structural analysis of closo-carboranes. In closo-carboranes, which contain carbon, nitrogen, and hydrogen atoms, the position of carbon atoms is crucial. This prompts us to focus on carbon elements as the interaction components. Through the computation of interaction features, we find that interaction spectral gaps indeed reflect structural information of closo-carboranes molecules. Another application we consider is chlorophyll. In chlorophyll molecules, nitrogen and magnesium atoms are core components responsible for absorbing light energy and converting it into chemical energy. Here, we focus on nitrogen elements as the interaction components and compute their interaction Betti numbers and interaction spectral gaps features. These calculations and applications underscore the vast potential of PIH and PILs.
4.1. Structural analysis of closo-carboranes.
In this work, we will analyze the structure of closo-carboranes, specifically C2Bn−2Hn, where n ranges from 5 to 20. Each closo-carborane molecule consists of atoms of three elements: C, B, and H. Typically, the atomic coordinates of these C, B, and H atoms are treated as points, which can be transform into a filtration of Vietoris-Rips complexes. Subsequently, the persistent homology and persistent Laplacian are computed. For each dimension n, two curves are obtained: one representing the Betti numbers as a function of the filtration parameter, denoted as βn(t), and the other depicting the smallest positive eigenvalue of the Laplacian, also known as the spectral gap, with respect to the filtration parameter, expressed as λn(t). These curves provide insights into the essential topological features and geometric properties of the data points.
One closo-carborane, C2Bn−2Hn, can be considered as the union of point sets X1 and X2 corresponding to {C2Bn−2} and {C2Hn}, respectively. Additionally, the intersection of X1 and X2 consists of points formed by two carbon atoms. As illustrated in Figure 7(b), C2B18H20 can be viewed as an interaction between {C2B18} and {C2H20}. This interaction reflects the relationships and interactions among atoms of different elements, providing a more nuanced representation than treating all elements as equivalent points. Furthermore, we obtain information from the persistent homology and persistent Laplacians of these distinct sets. In our approach, we treat closo-carboranes as interaction systems, constructing their corresponding interaction Vietoris-Rips complexes. We then compute the interaction homology and interaction Laplacian, resulting in the corresponding interaction Betti curves and interaction spectral gap curves.
Figure 7.

(a) The ball-stick representation of C2B18H20. (b) The representation of interaction between {C2B18} and {C2H20} within C2B18H20. (c) The interaction spectral gap curve of C2B18H20 in dimension 0. (d) The interaction spectral gap curve of C2B18H20 in dimension 1.
Figure 5 illustrates the interaction feature curves of the most stable configurations of C2B3H5 and C2B13H15. The molecule C2B3H5 can be regarded as the interaction between the subsystems {C2B3} and {C2H5}, while C2B13H15 can be seen as the interaction between {C2B13} and {C2H15}. In our dataset, C2B3H5 exhibits six possible configurations, while C2B13H15 has 135 configurations. Figures 5 (b) and (c) depict the bond-stick representations of the most stable configurations for C2B3H5 and C2B13H15, respectively. Figures 5 (d) and (e) correspond to the 0-dimensional and 1-dimensional interaction Betti curves for C2B3H5, revealing limited information due to the challenging formation of interaction cycles between {C2B3} and {C2H5}. Figures 5 (f) and (g) showcase the 0-dimensional and 1-dimensional interaction spectral gaps of C2B3H5, providing more enriched information compared to interaction homology. Meanwhile, the 0-dimensional and 1-dimensional spectral gaps for C2B13H15 are illustrated in Figures 5 (h) and (i). This example highlights the rich geometric information inherent in interaction Laplacians, suggesting potential applications.
Figure 5.

(a) The ball representation of the most stability configuration of C2B3H5. (b) The ball-stick representation of the most stability configuration of C2B3H5. (c) The ball-stick representation of the most stability configuration of C2B13H15. (d) The interaction Betti curve of the most stability configuration of C2B3H5 in dimension 0. (e) The interaction Betti curve of the most stability configuration of C2B3H5 in dimension 1. (f) The interaction spectral gap curve of the most stability configuration of C2B3H5 in dimension 0. (g) The interaction spectral gap curve of the most stability configuration of C2B3H5 in dimension 1. (h) The interaction spectral gap curve of the most stability configuration of C2B13H15 in dimension 0. (i) The interaction spectral gap curve of the most stability configuration of C2B13H15 in dimension 1.
Figure 6 illustrates the six distinct configurations of C2B3H5 and provides the interaction spectral gap curves in dimension 0 for each configuration. In our computations, we treat C2B3H5 as arising from the interaction between the subsystems {C2B3} and {C2H5}. Upon careful visual inspection in Figure 6(a) and (b), we observe subtle differences in the C-H bonds, C-B bonds, B-H bond lengths, and overall shapes between configurations C2B3H5-1 and C2B3H5-2 compared to the other configurations. However, distinctions are harder to discern in Figures 6(c), (d), (e), (f). The interaction spectral gap curves displayed in Figures 6(g)–(l) reveal significant differences, particularly for configurations C2B3H5-1 and C2B3H5-2 when compared to the other configurations. As shown in Figure 6(m), configurations C2B3H5-3, C2B3H5-4, C2B3H5-5, and C2B3H5-6 appear nearly identical. In contrast, Figure 6(n) indicates significant differences among configurations C2B3H5-1, C2B3H5-2, and C2B3H5-3. Note that C2B3H5-5 and C2B3H5-6 are enantiomers of each other, both possessing an identical enthalpy of formation of −153.810980788 eV [4]. For each configuration X of C2B3H5, we calculate the relative enthalpy of formation using the equation
Figure 6.

(a)-(f) Representation of the six distinct configurations of C2B3H5. These configurations are individually denoted as C2B3H5-1, C2B3H5-2, … , C2B3H5-6. (g)-(l) Illustration of the interaction spectral gap curves for the six different configurations of C2B3H5 in dimension 0. (m) Compilation of interaction spectral gap curves for the configurations C2B3H5-3, C2B3H5-4, C2B3H5-5, and C2B3H5-6. (n) Comparison of the interaction spectral gap curves of the configurations C2B3H5-1, C2B3H5-2, and C2B3H5-3.
The resulting relative enthalpies of formation are summarized in Table 2. From Table 2, it is evident that the enthalpies of formation for the configurations C2B3H5-3, C2B3H5-4, C2B3H5-5, and C2B3H5-6 are quite close. However, the enthalpies of formation for the configurations C2B3H5-1 and C2B3H5-2 differ significantly from those of the other configurations. Therefore, the information from interaction Laplacians indeed reflects the similarities and differences among various configuration forms of C2B3H5.
Table 2.
The relative enthalpy of formation of the configurations of C2B3H5.
| C2B3H5 | C2B3H5-1 | C2B3H5-2 | C2B3H5-3 | C2B3H5-4 | C2B3H5-5 | C2B3H5-6 |
|---|---|---|---|---|---|---|
| ΔE | 0.078485 | 0.033149 | 0.000178 | 0.000026 | 0.0 | 0.0 |
Figure 7(c) highlights the low-dimensional interaction features of C2B18H20, while Figure 7(d) provides a more global view of the higher-dimensional interaction structure. Around ε = 1.1Å, we begin to observe the emergence of dense 0-dimensional interaction features. More significant changes in 1-dimensional interaction features appear near ε = 1.1Å and ε = 5.0Å.
Compared to classical persistent homology and persistent Laplacian, interaction persistent homology and persistent Laplacian are more capable of reflecting the interactive relationships among different components within a system. Therefore, the information provided by interaction topological features may not necessarily be more comprehensive than that of classical persistent homology and persistent Laplacian. Examining Figure 3, when comparing Laplacian information generated by the classic Vietoris-Rips complex with that of the interaction Vietoris-Rips complex, we observe that interaction topological information tends to be simpler. This is because interactions primarily reflect specific interactive information, which is often less globally informative but distinct from overall information. This underscores the potential applications of interaction topology. Particularly, in the case of multi-component systems, where the focus is often on relationships between different parts, the advantages of interaction homology and interaction Laplacian become evident. Furthermore, in our example, the computational efficiency of interaction spectral gaps is notable. We considered closo-carboranes C2B13H15 and C2B18H20, running the computations on our laptop (CPU: AMD Ryzen 5 5600H). As shown in Table 3, when comparing the computation time of spectral gap curves between Vietoris-Rips complex and interaction Vietoris-Rips complex, based on the same code design and operating environment, we found that the computational efficiency of interaction spectral gap curves was significantly superior to classic persistent spectral gap curves based on Vietoris-Rips complexes. For a Vietoris-Rips complex built on a point set with n vertices, the 0-dimensional combinatorial Laplacian is an n×n matrix, and computing its full spectrum via standard methods such as the QR algorithm incurs a complexity of O(n3). In contrast, when the point set is decomposed into two subsets with an intersection of size k, the associated interaction Laplacian is a k × k matrix, whose eigenvalues can be computed in O(k3) time. A small intersection size k thus leads to a significant reduction in computational cost. For example, in the molecular dataset involving C2B13H15, we model the structure as the interaction between C2B13 and C2H15, which intersect at only k = 2 atoms. As a result, computing the 0-dimensional spectral gap becomes much more efficient than computing the corresponding eigenvalue of the full 30 × 30 Laplacian matrix. In practice, the dominant cost in our pipeline arises from constructing interaction complexes and sweeping over the persistence parameter, rather than from eigendecomposition itself.
Table 3.
The runtime of the curves for the smallest positive eigenvalues of the Laplacians for C2B13H15 and C2B18H20 in dimensions 0 and 1.
| Spectral gaps | ||||
|---|---|---|---|---|
|
| ||||
| VR complexes | 132.41s | 130.05s | 2866.85s | 30850.31s |
| Interation VR complexes | 48.23s | 47.99s | 131.27s | 131.94s |
4.2. Interaction within chlorophyll.
Chlorophyll is a green pigment found in plants, algae, and some bacteria, and it plays a vital role in photosynthesis, the process by which plants convert light energy into chemical energy. Chlorophyll molecules contain elements such as C, H, O, N, and Mg, with nitrogen (N) and magnesium (Mg) being crucial for photosynthesis. The magnesium atom sits at the core of the chlorophyll molecule, forming its central structure, aiding in the absorption of light energy to excite electron states. Meanwhile, nitrogen primarily stabilizes the molecular structure and plays a vital role in the propagation of electrons and energy. The combined action of nitrogen and magnesium in chlorophyll facilitates the absorption of light energy and its conversion into chemical energy.
Considering chlorophyll-a C55H72O5N4Mg and chlorophyll-b C55H70O6N4Mg within our mathematical model, we treat the magnesium and nitrogen atoms as a cohesive unit responsible for energy absorption and generation. On the other hand, we regard nitrogen atoms and other chlorophyll structures as a cohesive unit responsible for the complex propagation and utilization of energy. Thus, we delineate two interacting components: {C, H, O, N} and {N, Mg}, and compute their persistent interaction homology and persistent interaction Laplacian. Chlorophyll-a and chlorophyll-b are both large molecules, composed of 137 and 136 atoms respectively. Computing their topological properties using the traditional Vietoris-Rips complex and persistent homology would be highly demanding and time-consuming. By employing the interaction persistent homology with persistence parameters ranging from 0Å to 6Å. On our laptop setup (CPU: AMD Ryzen 5 5600H), the computational time is estimated to range from approximately 4000 to 8000 seconds.
As illustrated in Figure 8(a) and (b), chlorophyll-b closely resembles chlorophyll-a, distinguished by the presence of an additional carbonyl group on one of its rings. The disparities between chlorophyll-a and chlorophyll-b can be discerned through their interaction Laplacians. Specifically, the interaction spectral gap curves of chlorophyll-a and chlorophyll-b exhibit distinct behaviors, as depicted in Figure 8(c) and (d). In Figure 8(e) and (f), we observe the evolution of the interaction Vietoris-Rips complexes corresponding to chlorophyll-a and chlorophyll-b molecules. We find that the interaction Laplacian proves to be more efficient and practical in studying large molecules with multiple elements at certain times. Of course, for a detailed investigation of the interaction topology of molecules, it is necessary to differentiate the coordinates of different elements within large molecules and to select appropriate interaction objects. Under such conditions, we can then compute the interaction topological features.
Figure 8.

(a) The molecular structure representations of chlorophyll-a. (b) The molecular structure representations of chlorophyll-b. (c) The interaction spectral gap curves of chlorophyll-a in dimension 0 and dimension 1. (d) The interaction spectral gap curves of chlorophyll-b in dimension 0 and dimension 1. (e) The filtration of interaction Vietoris-Rips complexes of chlorophyll-a. (f) The filtration of interaction Vietoris-Rips complexes of chlorophyll-b.
5. Conclusion.
While having achieved enormous success in the past decade, traditional topological data analysis (TDA) methods suffer from the lack of element specificity, being qualitative, and inability of capturing non-topological changes during the filtration. Interaction provides insights into the mutual influence among various elements within a system. Understanding interactions helps elucidate how these components affect each other’s behaviors, properties, and functions, often resulting in emergent phenomena or system-level outcomes that cannot be fully explained by considering individual elements in isolation or the point cloud as a whole. However, studying interactions within systems and spaces is often a highly complex task, involving numerous intricate details and sources of interference. From a topological perspective, investigating interaction behaviors is highly worthwhile for two main reasons: topology can grasp the essential elements and holistic features of data; and secondly, element-specific topological features are conveniently computable and possess strong robustness. For these reasons, we focus on applying theories related to interaction topology in data science.
In this work, we present the concepts of persistent interaction homology (PIH) and persistent interaction Laplacian (PIL). The interaction topology focuses on the homotopy types of intersections between subspaces within a space, along with their corresponding homology invariants. We begin by establishing the concept of the interaction Laplacian, wherein its kernel space is isomorphic to the interaction homology. Building upon the foundation of interaction topology, we introduce PIH and PILs as innovative methods within the field of topological data analysis. Furthermore, we also demonstrate the stability of persistent interaction homology as a persistent module. For finite point sets in Euclidean spaces, we provide the construction of interaction Vietoris-Rips complexes, enabling the computation of persistent interaction homology and persistent interaction Laplacians for finite point sets. The proposed persistent interaction topology can be utilized to extract element-specific topological information, which is essential to the success of TDA [7]. In practical applications, we utilize PIH and PILs for extracting topological features from closo-carboranes and chlorophyll molecules, demonstrating the utility of the proposed methods.
In the future, we envision further advancements in the methodology of PIH and PILs. On a theoretical part, PIH and PILs currently reside at a conceptual stage, awaiting deeper exploration of the underlying mathematical principles and ideas. In applications, we aspire to see the use of PIH and PILs in data science, tackling specific challenges in physics, materials science, molecular biology, and beyond. We believe that PIH and PILs will play a significant role in a wide range of data analysis fields.
Acknowledgments
This work was supported in part by NIH grants R01GM126189, R01AI164266, and R35GM148196, National Science Foundation grants DMS2052983, DMS-1761320, and IIS- 1900473, NASA grant 80NSSC21M0023, Michigan State University Research Foundation, and Bristol-Myers Squibb 65109. Jian was also supported by the Natural Science Foundation of China (NSFC Grant No. 12401080) and the start-up research fund from Chongqing University of Technology.
Data and code availability.
The data and source code used in this work is publicly available in the Github repository: https://github.com/WeilabMSU/InteractionTop.
REFERENCES
- [1].Alexandroff P, Über den allgemeinen dimensionsbegriff und seine beziehungen zur elementaren geometrischen anschauung, Mathematische Annalen, 98 (1928), 617–635. [Google Scholar]
- [2].Ameneyro B, Maroulas V and Siopsis G, Quantum persistent homology, Journal of Applied and Computational Topology, 8 (2024), 1961–1980. [Google Scholar]
- [3].Bauer U and Lesnick M, Persistence diagrams as diagrams: A categorification of the stability theorem, Topological Data Analysis: The Abel Symposium 2018, 15 (2020), 67–96. [Google Scholar]
- [4].Becke A, The Quantum Theory of Atoms in Molecules: From Solid State to DNA and Drug Design, John Wiley & Sons, 2007. [Google Scholar]
- [5].Bott R and Tu LW, Differential Forms in Algebraic Topology, Grad. Texts in Math., 82. Springer-Verlag, New York-Berlin, 1982. [Google Scholar]
- [6].Bubenik P and Scott JA, Categorification of persistent homology, Discrete & Computational Geometry, 51 (2014), 600–627. [Google Scholar]
- [7].Cang Z and Wei G-W, Topologynet: Topology based deep convolutional and multi-task neural networks for biomolecular property predictions, PLoS computational biology, 13 (2017), e1005690. [DOI] [PMC free article] [PubMed] [Google Scholar]
- [8].Carlsson G, Zomorodian A, Collins A and Guibas L, Persistence barcodes for shapes, Proceedings of the 2004 Eurographics/ACM SIGGRAPH Symposium on Geometry Processing, (2004), 124–135. [Google Scholar]
- [9].Chazal F, Cohen-Steiner D, Glisse M, Guibas LJ and Oudot SY, Proximity of persistence modules and their diagrams, Proceedings of The Twenty-Fifth Annual Symposium on Computational Geometry, (2009), 237–246. [Google Scholar]
- [10].Chen D, Liu J, Wu J and Wei G-W, Persistent hyperdigraph homology and persistent hyperdigraph Laplacians, Foundations of Data Science, 5, 558–588. [DOI] [PMC free article] [PubMed] [Google Scholar]
- [11].Chen J, Qiu Y, Wang R and Wei G-W, Persistent Laplacian projected Omicron BA. 4 and BA. 5 to become new dominating variants, Computers in Biology and Medicine, 151 (2022), 106262. [DOI] [PMC free article] [PubMed] [Google Scholar]
- [12].Chen J, Zhao R, Tong Y and Wei G-W, Evolutionary de Rham-Hodge method, Discrete and Continuous Dynamical Systems. Series B, 26 (2021), 3785–3821. [DOI] [PMC free article] [PubMed] [Google Scholar]
- [13].Edelsbrunner H and Harer J, Persistent homology - A survey, Contemporary Mathematics, 453 (2008), 257–282. [Google Scholar]
- [14].Edelsbrunner H, Jabłoński G and Mrozek M, The persistent homology of a self-map, Foundations of Computational Mathematics, 15 (2015), 1213–1244. [Google Scholar]
- [15].Eilenberg S and Steenrod N, Foundations of Algebraic Topology, Princeton University Press, Princeton, NJ, 1952. [Google Scholar]
- [16].Knill O, The cohomology for Wu characteristics, preprint, (2018), arXiv:1803.06788. [Google Scholar]
- [17].Liu J, Chen D and Wei G-W, Interaction homotopy and interaction homology, preprint, (2023), arXiv:2311.16322. [Google Scholar]
- [18].Liu J, Li J and Wu J, The algebraic stability for persistent Laplacians, Homology, Homotopy and Applications, 26 (2024), 297–323. [Google Scholar]
- [19].Mémoli F, Wan Z and Wang Y, Persistent Laplacians: Properties, algorithms and implications, SIAM Journal on Mathematics of Data Science, 4 (2022), 858–884. [Google Scholar]
- [20].Qiu Y and Wei G-W, Persistent spectral theory-guided protein engineering, Nature Computational Science, 3 (2023), 149–163. [DOI] [PMC free article] [PubMed] [Google Scholar]
- [21].Shen L, Liu J and Wei G-W, Persistent Mayer homology and persistent Mayer Laplacian, Foundations of Data Science, 6 (2024), 584–612. [DOI] [PMC free article] [PubMed] [Google Scholar]
- [22].Suwayyid F and Wei G-W, Persistent Dirac of paths on digraphs and hypergraphs, Foundations of Data Science, 6 (2024), 124–153. [DOI] [PMC free article] [PubMed] [Google Scholar]
- [23].Townsend J, Micucci CP, Hymel JH, Maroulas V and Vogiatzis KD, Representation of molecular structures with persistent homology for machine learning applications in chemistry, Nature communications, 11 (2020), 3230. [DOI] [PMC free article] [PubMed] [Google Scholar]
- [24].Wang R, Nguyen DD and Wei G-W, Persistent spectral graph, International Journal for Numerical Methods in Biomedical Engineering, 36 (2020), e3376, 27 pp. [DOI] [PMC free article] [PubMed] [Google Scholar]
- [25].Wang R and Wei G-W, Persistent path Laplacian, Foundations of Data Science, 5 (2023), 26–55. [DOI] [PMC free article] [PubMed] [Google Scholar]
- [26].Wee J, Bianconi G and Xia K, Persistent Dirac for molecular representation, Scientific Reports, 13 (2023), 11183. [DOI] [PMC free article] [PubMed] [Google Scholar]
- [27].Wee J and Xia K, Persistent spectral based ensemble learning (PerSpect-EL) for protein–protein binding affinity prediction, Briefings in Bioinformatics, 23 (2022), bbac024. [DOI] [PubMed] [Google Scholar]
- [28].Wei X, Chen J and Wei G-W, Persistent topological Laplacian analysis of SARS-CoV-2 variants, Journal of Computational Biophysics and Chemistry, 22 (2023), 569–587. [DOI] [PMC free article] [PubMed] [Google Scholar]
- [29].Wei X and Wei G-W, Persistent sheaf Laplacians, Foundations of Data Science, 7 (2025), 446–463. [DOI] [PMC free article] [PubMed] [Google Scholar]
- [30].Wells RO and García-Prada O, Differential Analysis on Complex Manifolds, vol. 21980. Springer New York, 1980. [Google Scholar]
- [31].Zomorodian A and Carlsson G, Computing persistent homology, Discrete Comput. Geom, 32 (2005), 249–274. [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Data Availability Statement
The data and source code used in this work is publicly available in the Github repository: https://github.com/WeilabMSU/InteractionTop.
