Abstract
Higher-order networks encode the many-body interactions existing in complex systems, such as the brain, protein complexes, and social interactions. Simplicial complexes are higher-order networks that allow a comprehensive investigation of the interplay between topology and dynamics. However, simplicial complexes have the limitation that they only capture undirected higher-order interactions while in real-world scenarios, often there is a need to introduce the direction of simplices, extending the popular notion of direction of edges. On graphs and networks the Magnetic Laplacian, a special case of connection Laplacian, is becoming a popular operator to address edge directionality. Here we tackle the challenge of handling directionality in simplicial complexes by formulating higher-order connection Laplacians taking into account the configurations induced by the simplices' directions. Specifically, we define all the connection Laplacians of directed simplicial complexes of dimension two and we discuss the induced higher-order diffusion dynamics by considering instructive synthetic examples of simplicial complexes. The proposed higher-order diffusion processes can be adopted in real scenarios when we want to consider higher-order diffusion displaying non-trivial frustration effects due to conflicting directionalities of the incident simplices.
Export citation and abstract BibTeX RIS
Original content from this work may be used under the terms of the Creative Commons Attribution 4.0 license. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.
1. Introduction
Higher-order networks [1–4] are attracting increasing attention as they have the ability to encode for the interactions [5] among two or more nodes of complex systems and to display a rich interplay between topology and dynamics [6, 7]. Higher-order networks include hypergraphs [8–12] as well as simplicial complexes. Simplicial complexes are higher-order networks that are amenable to a comprehensive higher-order topological treatment revealing the topology of data [13–18] leading to applications in neuroscience [19–21], biology [22–25], sensor networks [26, 27], and computer graphics [28, 29]. Moreover, the algebraic topology of simplicial complexes is drastically changing our understanding of the dynamical state of simple and higher-order networks. Until recently the dynamical description of the network has taken almost exclusively a node (vertex)-centric approach where only the nodes are associated with dynamical variables. The investigation of the dynamical state of simplicial complexes has instead revealed that this is only a special case and that in general each simplex (higher-order interaction) can be associated with a dynamical variable leading to the notion of topological signals. This change of paradigm has lead to novel understanding of topological synchronization [30–34] and higher-order diffusion dynamics [35–38] and to novel signal processing [39–41] and topological neural network algorithms [42, 43]. In particular, higher-order diffusion dynamics is among the most basic topological dynamical processes, describing diffusion from n-dimensional simplices to n-dimensional simplices going either one dimension up or one dimension down. For instance, for n = 1 higher-order diffusion captures diffusion from edges to edges going either through nodes or through triangles. The main operator driving higher-order diffusion is the Hodge Laplacian [44–46] which encodes important information about the simplicial complex topology and is a key player in understanding the interplay between topology and dynamics.
Simplicial complexes have an important limitation as they usually encode only for undirected higher-order interactions. However, in applications, there is an increasing need to include also directional simplicial complexes [21, 31, 47]. Additionally, from the perspective of algebraic topology, an important challenge is related to the definition of the topology of directed simplicial complexes for which several proposals have been recently suggested [48–50].
While the investigation of directionality on simplicial complexes is only in its infancy, on networks considering directional edges is a much more widely explored topic. Among many different approaches, recently it has been shown that the Magnetic Laplacian is a fundamental algebraic operator that captures the directionalities of the edges while preserving a real and positive spectrum. The Magnetic Laplacian has its roots in theoretical physics and gauge theory [51–54], but recently has been shown to provide a valuable tool for node embeddings [55–59] and for the formulation of new neural network architectures [60]. The Magnetic Laplacian is a Hermitian operator that acts on complex-valued variables associated with the nodes and enforces a rotation of the complex phase at every edge. Thus the Magnetic Laplacian can be interpreted as a Laplacian with complex-valued weights on its edges, which is one of the emerging topics in network theory [59, 61, 62]. Interestingly, the Magnetic Laplacian can be seen as a generalization of the Connection Laplacian [63–65] acting on a vector field defined on each node of the network and inducing a rotation of the vector in correspondence of each edge.
In this work, we are motivated by the success of the Magnetic Laplacian in handling directed networks and we formulate Higher-order Connection Laplacians for the study of directed simplicial complexes of dimension two. The 1-order Connection Laplacians, for example, rotate complex valued 2-dimensional vectors associated with edges when transported across a node or a triangle according to rules depending on the relative directions of the simplicial complex. In particular, we show that in order to take into account all possible configurations of relative directions of simplices we need to make use of the Pauli matrices as well as of an additional rotation of the complex phases. The higher-order Connection Laplacians are here adopted in order to define higher-order diffusion on directed simplicial complexes that can reveal important dynamical effects induced by the 'frustration' of the relative directions of the simplices as demonstrated from the study of instructive synthetic examples.
By formulating the higher-order Connection Laplacians this work demonstrates that a much unexplored yet very promising research direction in higher-order networks is the investigation of the dynamics of topological signals combined with rich algebraic structures. Other examples of this emerging topic are the adoption of the Dirac operator [66] and its associated gamma matrices [67] to study for instance Turing and Dirac-induced patterns of topological signals, higher-order synchronization dynamics [68, 69], the use of sheaves in opinion dynamics [70], and the extensive literature on physics-inspired neural networks [43, 71]. The mathematical methods that we present may also be used to develop random-walk centrality measures [72] and embeddings [55] for directed higher-order networks.
2. Combinatorial, connection and magnetic Laplacians on graphs
We consider a graph with N0 vertices and N1 edges. We are interested in the scenario in which this graph describes a real-world complex system; in this case, it is also referred to as a network. Here we discuss three definitions of Laplacians: the Combinatorial Graph Laplacian [73–76], the Connection Laplacian [63, 64], and the Magnetic Laplacian [55, 57]. The Laplacians are algebraic topology operators that can be used to describe diffusion on the graph and have wide applications in network science [57, 77, 78], non-linear dynamics [35, 36, 79], as well as in signal processing [33, 80–82] and machine learning [73, 83, 84].
2.1. Combinatorial graph Laplacian
The Combinatorial graph Laplacian [73, 76] is probably the most widely used Laplacian for undirected graphs and networks. Let us assume is simple (unweighted, undirected and without self-loops and reciprocated edges) and has adjacency matrix ; then the Combinatorial Graph Laplacian is the matrix defined as
where is the diagonal matrix having the degrees of the vertices in the network, i.e. for all vertices i of the graph. This Laplacian provides the paradigmatic example of Laplacian operator that reflects the graph's discrete geometry and topology in its spectral properties [76] strongly affecting the dynamics unfolding on the graph. Therefore provides a key way to relate the structure and dynamics of networks and has a key role in Network Science [79] and Machine Learning [85]. However, a limitation of the Combinatorial Graph Laplacian is the fact that the original definition only applies to undirected networks. In the following, we will discuss in detail the Magnetic Laplacian, which addresses this limitation by the adoption of Hermitian matrices.
2.2. Magnetic Laplacian on directed graph
Consider an unweighted directed graph with vertex set V and directed edge set E connecting pairs of distinct vertices (no self-loop and no reciprocated edges). Let a indicate the binary directed adjacency matrix, and let us define A as the adjacency matrix of its corresponding unweighted network, i.e. if (i, j) exists (in any direction) and otherwise. The Magnetic Laplacian [51, 55] is a Hermitian matrix defined as
where indicates the Hadamard product and assigns a rotation in the complex phase to a directed link, , with g being a constant parameter. Therefore, if ; if ; and otherwise. Thus a non-zero value of δij arises from directed (i.e. unreciprocated) edges and determines the phase change that occurs when crossing a link from node i to node j. Additionally, the definition of the Magnetic Laplacian involves the diagonal degree matrix is defined as in the previous paragraph.
For convenience, denote . Then
The Magnetic Laplacian acts on complex-valued cochains that can be represented as the vector , having complex values on each of the nodes. The Magnetic Laplacian is associated with the quadratic form
It is therefore apparent that the Magnetic Laplacian has a real and non-negative spectrum. Its associated quadratic form can be combined with machine learning algorithms to define efficiently network embeddings [55–59] that can reveal for instance non-trivial cyclic patterns or connections among clusters or communities of the network and neural networks [60].
2.3. Connection Laplacian
The Connection Laplacian [63–65] generalizes the definition of the Magnetic Laplacian and can be used to describe the motion of d-dimensional vectors along edges. The Connection Laplacian, denoted , is a matrix defined as
where is the d × d matrix having all elements equal to one, and the rotation matrix is given by where is the rotation matrix which represents the orthogonal transformation SO(d) satisfying .
The Connection Laplacian acts on real-valued cochains ν where each element of the cochain associated to a vertex i is a vector . Thus the quadratic form associated with the Connection Laplacian is given by
A Connection Laplacian is called consistent if, for every cycle in the graph, the total rotation is equivalent to the identity matrix. This property ensures that one can always rotate back to the same phase after completing any directed cycle [86]. Moreover, when a Connection Laplacian is consistent, there exist exactly d eigenvalues with a value of 0.
It can be easily shown that the Magnetic Laplacian [55, 57] is a special case of Connection Laplacian for directed graphs with a U(1) or SO(2) transformation. As we will see in the following, our manuscript proposes to generalize the notion of Graph Connection Laplacian to directed simplicial complexes with the goal of capturing in the spectral properties of these operators the information encoded in the directions of their simplices, in the same spirit as the use of the Magnetic Laplacian to capture the directionalities of edges in graphs and networks.
3. Simplicial complexes
Simplicial complexes are a class of higher-order networks that encode higher-order interactions in complex systems. In this work, we will consider 2-dimensional simplicial complexes formed by vertices (0-simplices), edges (1-simplices) and triangles (2-simplices). More formally, a simplex of dimension k (or k-simplex) is formed by n + 1 vertices, and the face of a simplex is a simplex of dimension formed by a proper subset of the vertices of the original simplex. A simplicial complex is a set of simplices closed under the inclusion of the faces of each of its simplices. The dimension of a simplicial complex is the largest dimension of its simplices. The use of simplicial complexes [1–4] is becoming popular in Network Science and complex systems research as it allows us to model complex systems such as the brain, protein assemblies, or social interactions, where each simplex characterizes a given higher-order interaction among their elements.
Simplicial complexes allow for higher-order extensions of Combinatorial Graph Laplacians called Hodge Laplacians that can reveal important properties of higher-order diffusion between n-simplices to n-simplices. In order to define the Hodge Laplacian it is important to associate to each simplex an orientation, typically chosen to be induced by the node labels. Here and in the following, unless clearly specified, we always adopt this convention as it has the advantage that the spectral properties of the Hodge Laplacians will be independent of the vertex labelling. Note most importantly that the notion of orientation is distinct from the notion of direction. For instance an oriented 1-dimensional simplex (an oriented graph) will attribute to each edge an orientation and not a direction. The orientation can be used for instance to determine if a flux through an edge is positive or negative; for instance if the edge is oriented positively, a flux going from vertex 1 to vertex 2 will be positive, and a flux from vertex 2 to vertex 1 will be negative. From this example, it is clear that the orientation of an edge is a different notion with respect to direction, as a directed link will allow only flux to go in one direction.
Hodge Laplacians are receiving increased interest because of their ability to encode the topology of simplicial complexes at the same time as offering the correct algebraic topology operator to define higher-order diffusion and to model, treat and process higher-order topological signals. In particular, the k-order Hodge Laplacian acts on k cochains, which can be represented as vectors assigning a dynamical value to each k-simplex of the simplicial complex. The action of the k-Laplacian on the k-cochain can describe diffusion from k-simplex to k-simplex passing either though or to simplices.
Here our intention is to give a brief computational introduction to Hodge Laplacians without giving the full background of these important algebraic topology operators. For further information we recommend the following literature, devoted to their spectral properties: [44, 46, 87].
In order to provide an operational definition of Hodge Laplacians let us introduce some notation. We consider the finite oriented simplicial complex formed by Nk simplices of dimension k, each denoted as with . Two distinct k-simplices and are upper adjacent if they both are faces of a -simplex, also known as a co-face. Two simplices that are upper-adjacent and have the same relative orientation with respect to the common co-face are indicated as , while otherwise we indicate . Two distinct k-simplices are lower adjacent if they share a common face. Two simplices that are lower-adjacent and have the same relative orientation with respect to the common face are indicated as , while otherwise, we indicate . The k-order Hodge Laplacian is a matrix given by
where we use the convention and in all other cases the up and the down Hodge Laplacians and have elements
From this definition, it follows that as long as k = 0 the Hodge Laplacian reduces to the Combinatorial Graph Laplacian while for k > 0 the Hodge Laplacian has elements
Hodge Laplacians encode fundamental topological properties of the simplicial complex. In particular, one of the most celebrated properties of Hodge Laplacians is that the dimension of the kernel of the n-Hodge Laplacian is given by the nth Betti number. Another crucial property of Hodge Laplacians is that they obey Hodge decomposition and thus allow, for instance, the decomposition of edge signals into harmonic, solenoidal, and irrotational components.
4. Higher-order connection Laplacians of 2-dimensional simplicial complexes
Hodge Laplacians constitute a powerful tool to study the topology of higher-order networks, however, they have the important limitation of only applying to undirected (although oriented) simplicial complexes. This is a drawback for studying real higher-order networks and represents also a significant challenge in mathematics in general and applied topology in particular.
Here our goal is to propose the study of Higher-order Connection Laplacians of 2-dimensional simplicial complexes, in order to capture spectral properties that are induced by introducing the directionality of the simplices. In doing so we are inspired by the recognized role of the Magnetic Laplacian as the key algebraic topology operator to handle directionality in the graph setting while preserving a real and non-negative spectrum. In particular, we will define the k-order Connection Laplacian that will determine how vectors defined on simplices are transformed when hopping though upper or lower adjacent simplices (see figure 1). As we will see the 0-Connection Laplacian can be defined trivially as the Combinatorial Graph Laplacian of the underlying network skeleton of the simplicial complex, i.e. the graph formed only by vertices and edges of the simplicial complex. Therefore, this operator can be defined on complex-valued 0-cochains assigned to each vertex of the graph. In order to take into account all possible configurations induced by the directions of edges and triangles, the 1-Connection Laplacian will however, require us to lift the dimensionality of the 1-cochain to a 2-dimensional complex valued vector defined on each edge of the simplicial complex. The 2-Connection Laplacian will be acting on a 2-cochain taking as well a 2-dimensional complex valued vector on each triangle of the simplicial complex. However, another difficulty arises, as to define an Hermitian 2-Connection Laplacian we will have to limit our discussion to simplicial complexes that tessellate 2-dimensional orientable manifolds.
4.1. Higher-order connection Laplacian for 2-dimensional simplicial complexes
Consider a simplicial complex of dimension 2, including three different types of simplices: nodes, edges, and triangles. We assume that the simplicial complex is unweighted and directed. The undirected version of this simplicial complex is given by the same simplicial complex that is oriented instead of directed, with nodes, edges, and triangles having an orientation induced by the vertex labels, and with nodes having a trivial positive orientation. The directed simplicial complex has both edges and triangles associated with a direction, either concordant or discordant with their own orientation of its undirected version. Here our goal is to generalize the notion of the Connection Laplacian to higher-order networks in order to capture the information encoded in the directionality of the simplices and to define a higher-order diffusion that takes into account the directions of the simplices on top of their orientation. Note however that we do not intend here to define the topology of the directed simplicial complexes, and that the Higher-order Connection Laplacians have significant differences with respect to the Hodge Laplacian of undirected networks. One of the main differences is that in general the Higher-order Connection Laplacian will not obey Hodge decomposition, and in addition, the 1-up Connection Laplacian and the 1-down Connection Laplacian might not even commute.
4.2. 0-up connection Laplacian
For the 0-Connection Laplacian, by adopting a minimal assumption, we propose to use the Magnetic Laplacian of the directed simplicial complex skeleton formed exclusively by the vertices and the directed edges of the simplicial complex. The graph Magnetic Laplacian uses complex numbers to encode the direction of the edges and simultaneously builds a Hermitian operator with real eigenvalues that can be useful for machine learning applications. Note that the vertices of a network have all the same (trivial) direction so that in a network it is sufficient to take into account the two different directions of the edges (accounted for by the sign of the argument of the corresponding complex number). It follows that the matrix element depends only on the direction of the link (i, j) which can be or . A question that arises is how to leverage this to define the 1-order Connection Laplacian or even the 2-down Connection Laplacian.
4.3. 1-up connection Laplacian
When one considers the 1-Connection Laplacian, the situation is much richer than at the network level. Indeed the matrix element describing higher-order diffusion between edge and edge will not only depend on the direction of the triangle and but also on the directions of the edges and . Taking into account all the possible combinations of the directions of the two edges and the upper incident triangle leads to eight possible configurations (see figure 1). If follows that it is not possible to use only the phase of complex numbers to distinguish between these 8 possible configurations. We therefore consider a complex-valued ν of elements defined on each edge of the simplicial complex. We then consider a 1-Connection Laplacian that will enforce rotations induced by the four Pauli matrices in conjunction with rotation of the complex phases of the elements . Since the Pauli matrices, together with the identity matrix, form a set of four, and the complex phase can rotate in two different directions, we can take into account all eight combinatorial options induced by the direction of the two incident edges and the shared triangle. This greatly enriches the complexity of the definition of the 1 Connection Laplacian. To construct the 1-up Connection Laplacian, we start by constructing the Bochner matrix [88] of the 1-up Hodge Laplacian of the undirected version of the simplicial complex whose elements are given by
This Bochner matrix is semi-definite positive and can be written as the difference of a diagonal part and a non-diagonal part , i.e.
Here, the diagonal matrix has elements given by , which are twice the number of triangles incident to edge l.
Moreover by indicating with the lth and the mth oriented edges (1-simplices), we have
With these definitions we define the 1-up Connection Laplacian, , acting on 1-cochains ν of elements associated to the generic edge of the directed simplicial complex as:
where is the matrix having all elements equal to one. The rotation matrix is a matrix that enforces a different type of rotation depending on the directions of the two incident edges and the direction of the incident triangle. Specifically, for a given choice of we define as:
where the letters refer to the labeling of the configurations in table 1. Here, σ are the Pauli matrices
Table 1. Schematic representation of the eight configurations induced by the directionality of edges and triangles which are distinguished by the Higher-order Connection Laplacian .
Motivated by the Magnetic Laplacian setting, we view δ as a phase rotation, and we aim to study the simplicial complex for various choices of δ.
From this definition of the 1-up Connection Laplacian it is straightforward to express the associated quadratic form as
Therefore it is apparent that is Hermitian and semi-definite positive.
4.4. 1-down connection Laplacian
Now, let us define the 1-down connection Laplacian describing diffusion from edges to edges through vertices. To this end, we will follow a procedure similar to that employed in formulating the 1-up Connection Laplacian. However, there is an important difference. Since vertices have only one (trivial) possible direction, the number of configurations to consider is reduced to four instead of eight. These configurations are induced by the relative directions of the two edges, as illustrated in table 2. Another difference is that, in this case, the 1-down Hodge Laplacian of the undirected version of the simplicial complex and its Bochner matrix coincide. Therefore we first extract the diagonal and the off-diagonal entries of :
where
and as the diagonal matrix of elements Finally, the 1-down Connection Laplacian is defined by incorporating information about edge orientation of the undirected version of the simplicial complex with and the edge directions of the actual directed simplicial complex using a rotation matrix :
where for a constant the 1-down rotation matrix is given by
Note that the letters in the above equation refer to the label of the configuration in table 2.
Table 2. Schematic representation of the four configurations induced by the directionality of the edges incident to the same nodes, which are captured by the Higher-order Connection Laplacian .
From this definition it can be easily shown that is Hermitian as both and are real and symmetric; and is Hermitian.
Assigning a complex vector to edge l, and let , we have:
Therefore we can conclude that is positive semi-definite.
4.5. 2-down connection Laplacian for 2-dimensional orientable manifolds
The extension to Higher-order Connection Laplacians comes with additional challenges. For instance, in order to extend the above definition to the 2-down Connection Laplacian, relying solely on the definition of orientation and direction of triangles induced by the node labels is not sufficient to obtain Hermitian matrices. This implies that we cannot extend the above definition to treat the 2-down diffusion on a general simplicial complex. What we can do, however, is to consider simplicial complexes forming discrete orientable surfaces. For triangles, we can adopt the notion of orientation (and direction) induced by the orientation of the manifold. As for orientable continuous manifolds, for discrete orientable manifolds, we can distinguish two sides of a surface, with the normal vector to the manifold pointing either to one side or the other side of the manifold. The orientation of the manifold is determined by the choice of the normal vector direction. When considering such that or any of its permutations form a 2-simplex, we represent its orientation as if, by following the right-hand rule and moving along the flow we obtain a vector pointing in the same direction as the normal vector to the manifold, otherwise we assign to the 2 simplex the orientation .
In this way, it can be easily checked that the number of configurations induced by the relative directions of two triangles and their common edges is always eight as in the case in section 4.3. These configurations are shown schematically in figure 3. As for the 1-down Laplacian, also the 2-down Laplacian and its the Bochner matrices coincide. Therefore we first we extract the diagonal and the off-diagonal entries of :
where
and as the diagonal matrix of non zero elements Finally, the 2-down Connection Laplacian is defined by incorporating both the triangle directions and the edge directions using a rotation matrix :
where, considering rotations induced by the four Pauli matrices and the complex phase, we have
with the letters referring to the labels of the configurations in table 3. The associated quadratic form reads
Table 3. Schematic representation of the eight configurations induced by the directionality of two lower adjacent triangles and their common lower adjacent edge on 2-dimensional orientable manifolds. These configurations are captured by the Higher-order Connection Laplacian .
Note that the 2-down Connection Laplacian can be also extended to define the n-down Connection Laplacian of n-dimensional orientable manifolds, as the definition of this Connection Laplacian will always entail treating eight different configurations of relative directions of the two n-dimensional simplices and their incident -dimensional simplex.
As we have seen, our formalism has allowed us to define the 0-up, the 1-up, the 1-down, and the 2-down Connection Laplacians of orientable, two-dimensional discrete manifolds. These operators allow us to distinguish between all possible configurations of the directions of the simplices by inducing rotations enforced through the matrices leveraging on the use of the Pauli matrices, and a rotation of the phase in the complex plane.
5. Higher-order diffusion on directed simplicial complexes
The Connection Laplacians defined in the previous section can be used to define higher-order diffusion processes that will reflect the directionality of the simplicial complex extending previous work on higher-order diffusion over undirected simplicial complexes [35–38]. If we focus on the diffusion induced by the 1-Connection Laplacian we can define three types of dynamical processes describing diffusion from edge to edge going exclusively through triangles (upper diffusion), going exclusively through nodes (lower diffusion), or going either through triangles or nodes (combined diffusion). These three types of diffusion process describe the evolution of the ν whose elements νl defined on each edge l are complex valued 2-dimensional vectors, i.e. . Specifically, we define three different types of higher-order dynamics: the upper, lower, and combined diffusion. In upper diffusion dynamics the dynamics of the edge topological signal is driven by the process
Similarly, when the edge topological signal follows the lower diffusion dynamics it obeys
Finally if the edge topological signal follows combined diffusion, then it will evolve according to
Note that since in general and do not obey Hodge decomposition, the combined diffusion process cannot be easily recast into the upper and the lower diffusion dynamics as happens in diffusion determined by the Hodge Laplacian in undirected simplicial complexes [35, 89].
The properties of the higher-order diffusion (of order 1) on directed simplicial complexes will depend strongly on the structure of the simplicial complex and the directionality of the edges. Here we provide a discussion of these higher-order diffusion processes in different cases of directed triangles and on a directed torus. For each case considered, we will investigate the spectral properties of the 1-up and 1-down Connection Laplacians as a function of the parameter δ and we will computer the commutator
While in this paper we mostly focus on these three types of topological diffusion, that define a classical dynamics, our results on the spectral properties of the Higher-order Connection Laplacian can be applied as well to the following three distinct types of Schrödinger equations: the upper, the lower and the combined Schrödinger equations. The upper-Schrödinger equation is driven by the upper Higher-Order Connection Laplacian
the lower-Schröedinger equation is driven by the lower Higher-Order Connection Laplacian,
and the combined Schröedinger equation is driven by the sum of the upper and the lower Higher-Order Connection Laplacian, i.e.
In main difference between the classical (topological) dynamics that we describe here in detail and these Schrödinger equations is that the diffusion dynamics will always relax to the fundamental state, while the quantum evolution will consist of sustained oscillations. This sustained oscillations include different modes corresponding to the different eigenvectors of the Higher-order Connection Laplacian, each one oscillating at a frequency where λ is their associated eigenvalue and their associated energy.
5.1. Directed simplicial triangles
Let us now explore some examples of directed triangles formed by three vertices , three edges , , , and one triangle , where the edges and the triangles have a given direction, leading to the four distinct scenarios depicted in table 4. In addition to analysing of the spectral properties of these simplicial triangles, for each considered case, we will also analyse the quadratic form of the Higher-order Connection Laplacians and determine conditions under which it can be minimized to zero. Finally, we will provide a numerical investigation of the dynamical properties of the induced higher-order diffusion processes.
Table 4. Schematic representation of the 4 distinct types of 2-dimensional directed simplicial complexes formed by one directed triangles, three directed edges and three vertices.
5.1.1. Case 1
We consider the directed 2-simplicial complex denoted as Case 1 in table 4, having edge directions given by , , and ; and triangle direction . This represents the scenario where all edge directions conform to the direction of the triangle. Hence, if we traverse from one edge to another, we either align with both the directions of the edge and the triangle, as shown in the first row of (14); or we go against both the edge and triangle directions, corresponding to the second row in (14). For the 1-up Connection Laplacian, we obtain the following:
In the top left panel of figure 2, we display the eigenvalues of in relation to δ. The corresponding eigenvalues are:
To compute the quadratic form, we denote the components of the 1-cochain as ν corresponding to the three edges , , and respectively. Here and in the following we parameterize each component νl of the 1-cochain with three angles (θl ,φl and ψl ) by setting
where , and . Therefore the 1-up Connection Laplacian is associated to the quadratic form
The quadratic form above equals zero when , and
A solution exists only when , or , as shown in the top-left panel of figure 2. When δ takes the aforementioned values, ν , which satisfy the above conditions, becomes an eigenvector of associated with an eigenvalue of zero.
Download figure:
Standard image High-resolution imageFor the 1-down Connection Laplacian, we have
Eigenvalues of , as shown in the top-right plot in figure 2, are:
The corresponding quadratic form of the 1-down Connection Laplacians are
It becomes zero when , and
A solution exists only when , or , as shown in the top-right panel in figure 2.
Upon combining the 1-up and 1-down Connection Laplacians, we obtain the eigenvalues of their sum, as depicted in the bottom-left panel of figure 2. The corresponding eigenvalues are
The 1-up and the 1-down Connection Laplacians and commute since the commutator is zero (bottom-right panel in figure 2). Furthermore, it can be shown that , which implies that the Hodge decomposition does not hold, i.e. for all values of δ.
Figure 3 plots two examples when the dynamics are described by (left), (middle), and their sum (right) for various value of δ. For visualization purposes, we only display the phase angles. Setting (figure 3(a)) and examining the plot for , we notice that it converges towards an eigenvector of associated with an eigenvalue of zero, which satisfies conditions (39) and (40). Since and only possess positive eigenvalues when , the vectors converge into their slow eigenmodes associated with the smallest eigenvalue. We observe similar results when (figure 3(b)), where the equilibrium vector is an eigenvector of corresponding to the 0 eigenvalue satisfying (44)–(46).
Download figure:
Standard image High-resolution image5.1.2. Case 2
Now, let us consider Case 2 in table 4, where the edge directions are as follows: , , and ; and the triangle direction is . This scenario represents a situation where all edge directions are opposite to the direction of the triangle. Consequently, when traversing from one edge to another, we either move against the edge direction while aligning with the triangle direction—as shown in the third row of (14)—or align with the edge direction while moving against the triangle direction, as depicted in the fourth row of (14). The corresponding 1-up Connection Laplacian is
Then the quadratic form can be calculated as
We plot its eigenvalues against δ in the top left panel of figure (2). The corresponding eigenvalues are:
It may be shown that when , and
The equations above have a solution only when , as can be seen in the plot. In Case 2, remains the same as in Case 1 since the edge directions stay unchanged. The eigenvalues of are
The commutator is zero, i.e. , as shown in the bottom-right of figure 4, however Hodge decomposition does not hold as in Case 1. Figure 5 displays two examples of vector diffusion. When , the vectors in the left plot converge toward an eigenvector of corresponding to eigenvalue zero, satisfying conditions (51)–(53). When , the equilibrium vector for both (on the left) and (in the middle) are eigenvectors associated with a zero eigenvalue, as specified by conditions (51)–(53) and (44)–(46) respectively. In the remaining plots, the final states converge toward the slowest eigenmodes associated with the smallest positive eigenvalue due to the absence of a zero eigenvalue.
Download figure:
Standard image High-resolution imageDownload figure:
Standard image High-resolution image5.1.3. Case 3
Now, let us look at the case of a 2-simplicial complex with triangle and link direction given by and , and , which is illustrated as Case 3 in table 4. First, we can write the 1-up and 1-down Connection Laplacian as
Its quadratic form is
and it becomes zero when and
The above system has a solution iff . This can be confirmed by the eigenvalue top-left plot in figure 6. Furthermore, the eigenvalues are given by
For the 1-down Connection Laplacian, we have
and
The quadratic form is zero when and
The equation above can be solved iff as shown in the top-right plot in figure 6. Furthermore, the eigenvalues are given by
Download figure:
Standard image High-resolution imageIn this case and do not commute except for the special case when δ = 0 as shown in the bottom-right panel in figure 6. Two examples of vector diffusion are displayed in figure 7 for and . In both scenarios, the vectors for and , the vectors approach some eigenvectors that correspond to eigenvalue zero, which satisfies conditions (57)–(59) and (63)–(65) respectively.
Download figure:
Standard image High-resolution image5.1.4. Case 4
Finally, we examine the directed 2-simplicial complex with triangle and link direction given by and , and illustrated as Case 4 in figure 4. As the edge directions are precisely the same as in Case 3, in this scenario is identical to the previous case. Therefore, we only need to discuss , which can be computed as follows:
This leads to
We can further prove that when , and
The solution to the equations exists iff as shown in the top-left plot in figure 8. The eigenvalues shown in the top-left subplot are:
Furthermore, we observe that and only commute when δ = 0 or π. In figure 9, we illustrate two vector diffusion processes where and . In the top row, the equilibrium vector is the eigenvector associated with a zero eigenvalue for both and . In the bottom plot, only the vector for converges to the eigenvector with a zero eigenvalue. For the remaining cases, the final state corresponds to the vector with the smallest positive eigenvalue, given the absence of a zero eigenvalue.
Download figure:
Standard image High-resolution imageDownload figure:
Standard image High-resolution image5.2. Case study on triangulated torus
In the previous examples, we only considered simplicial complexes with a single triangle. Now, we will examine examples where the simplicial complexes contain multiple triangles and edges. Specifically, we will focus on the triangulated torus as our example. The torus is a 2-manifold without boundary. To perform computations, we triangulate the torus into a simplicial complex and we consider two cases that differ only in the direction of the triangles (see figures 10 and 11). For each case, we will investigate the spectrum and the complete spectrum of the 1-up and 1-down Connection Laplacians and we provide a discussion of the effects of the frustration induced by the directions of the simplices.
Download figure:
Standard image High-resolution imageDownload figure:
Standard image High-resolution imageWe first consider the Type 1 Triangulated Torus illustrated in figure 10. In this case, all edge directions align with the triangle directions. Therefore the triangles fall under Case 1 of directed triangles in figure 4.
We then reverse the direction of the upper triangles above the diagonal edges to define the Type 2 Triangulated Torus illustrated in figure 11. As a result, these upper triangles align with Case 2 in figure 4 while the lower triangles correspond to Case 1. Note that for both the Type 1 and the Type 2 Torus we adopt the usual convention for defining the orientations of the edges of their undirected counterpart: instead of taking the orientations induced by the node labels we consider orientations that are consistent with periodic boundary conditions that in these cases are aligned to the direction of the edges depicted in figures 10 and 11.
The effect induced by the frustration of the flow direction is apparent from the comparison among the spectrum of the 1-Connection Laplacians of Type 1 and Type 2 Triangulated Tori (see figures 12 and 13). Indeed for the Type 1 Triangulated Torus it is clearly noticeable that the spectrum displays eigenvalues with much more significant degeneracy than for the Type 2 Triangulated Torus case. Hence in the Type 2 Triangulated Torus, the presence of the frustration induced by the triangle directions lifts the degeneracy of multiple eigenvalues, reflecting a decrease in the symmetries of these directed simplicial complexes.
Download figure:
Standard image High-resolution imageDownload figure:
Standard image High-resolution image6. Conclusion
Directed simplicial complexes constitute an important challenge in network theory as the directionality of interactions is ubiquitous in complex systems. Yet there is not a fully developed mathematical framework for addressing directionality of simplicial complexes. As a matter of fact, so far there is not even consensus on the most suitable definition of directed simplicial complexes. Here we tackle this challenge by leveraging the popular Magnetic Laplacian to address the study of graphs and networks. We show that to formulate corresponding Hermitian operators that can capture all the possible configurations induced by the relative directions of simplices we may consider Higher-order Connection Laplacians making use of the Pauli matrices and of an additional rotation in the complex plane. Specifically, we built the 0-up, 1-up, 1-down, and 2-up Connection Laplacians of tesselations of 2 dimensional orientable manifolds, where the 1-up and 1-down Connection Laplacians can be defined on arbitrary simplicial complexes of any dimensions. The higher-order Connection Laplacians are used to formulate higher-order diffusion dynamics that can capture the frustration induced by incoherent directions of incident simplices. The application of the framework is investigated on simple and instructive examples of 2-dimensional simplicial complexes. In conclusion this work provides a framework for defining directional simplicial complexes and higher-order diffusion dynamics enfolding on them. We build on the increasingly popular idea of adopting complex valued weights to combine dynamical processes on graphs and networks with non-trivial algebraic operations. We hope that this work will be useful for network scientists and applied mathematicians focusing on higher-order networks, complex weights and the interplay between dynamical processes and algebraic operations.
Acknowledgments
This project was carried out during X G's Alan Turing Institute Enrichment Scheme Placement, supported by the Alan Turing Institute. X G acknowledges support of MAC-MIGS CDT under EPSRC Grant EP/S023291/1 and NTU Presidential Postdoctoral Fellowship 023545-00001. D J H was supported by EPSRC Grant EP/P020720/1. K C Z was supported by the Leverhulme Trust Grant 2020-310 and EPSRC Grant EP/V006177/1.
Data availability statement
The data that support the findings of this study are openly available at the following URL/DOI: https://github.com/XueGong-git/Higher-order-Connection-Laplacians [90].
Data, code and materials
Code for the experiments is available at https://github.com/XueGong-git/Higher-order-Connection-Laplacians.
Conflict of interest
The authors declare that they have no conflicts of interest.