---
title: Topological Message-Passing Beyond Graphs
url: https://www.emergentmind.com/topics/topological-message-passing-beyond-graphs
type: topic
---

# Topological Message-Passing Beyond Graphs

Topological message-passing beyond graphs generalizes the classical message-passing paradigm of graph neural networks (GNNs) to higher-order topological domains, including simplicial complexes, cell complexes, and CW-complexes. These frameworks systematically extend from modeling pairwise relationships (edges) to encoding genuine multi-way (polyadic) interactions (e.g., triangles, rings, higher-dimensional cells) and topological invariants, leveraging algebraic-topological operators—such as boundary, coboundary, and Hodge Laplacian—as the substrate for localized or data-driven message computation. By unifying combinatorial topology with neural architectures, topological message-passing networks have established state-of-the-art expressivity and empirical performance across molecular modeling, many-body physics, and relational domains.

## 1. Mathematical Foundations: Complexes, Neighborhoods, and Operators

Higher-order message passing takes place over discrete topological domains such as simplicial or cell complexes. An abstract simplicial complex $K$ is a set of nonempty subsets of a finite vertex set $V$ closed under inclusion, so if $\sigma \in K$ and $\tau \subset \sigma$ then $\tau \in K$. Each $\sigma$ is a $k$-simplex ($|\sigma| = k+1$), representing vertices ($k=0$), edges ($k=1$), triangles ($k=2$), etc. More generally, cell and CW-complexes allow $k$-cells with flexible attaching maps, modeling structures (e.g., rings, higher-genus surfaces) outside the expressivity of simplicial complexes [2304.10031, 2406.03145].

Neighborhoods of a cell or simplex $\sigma$ are defined in several canonical ways:
- **Boundary $\partial(\sigma)$**: lower-dimensional faces, e.g., the set of $(k-1)$-simplices contained in $\sigma$.
- **Coboundary $\delta(\sigma)$**: higher cofaces, i.e., $(k+1)$-simplices in which $\sigma$ is a face.
- **Lower adjacency**: same-dimension neighbors sharing a common face.
- **Upper adjacency**: same-dimension neighbors sharing a common coface.

Boundary and coboundary operators, written $\partial_k$ and $\delta_{k-1}$, are fundamental in the algebraic-topological formalism. Hodge theory provides graded Laplacians $\Delta^k$, generalizing the graph Laplacian to all dimensions. These operators underpin message-passing, enforcing local-to-global consistency aligned with topological invariants such as Betti numbers or (co)homological features [2304.10031, 2509.23020].

## 2. Generalized Message-Passing Architectures

Topological message-passing frameworks prescribe feature updates over cells/simplices using local (multi)relational aggregations:
- For each $k$-cell $\sigma$, a learnable update combines its own features with aggregated messages from boundary (downward), coboundary (upward), and lateral (adjacent) cells of appropriate dimension [2304.10031, 2307.05392, 2306.03561].
- In Simplicial Message Passing Networks (SMPNN/MPSN) [2307.05392, 2103.03212], a canonical $t$-th layer update takes the form:
  $$
  m_\sigma^{(t)} = \sum_{\ell=k-1}^{k+1} \left[\sum_{\tau \in N^\ell(\sigma)} \varphi_{\mathrm{msg}}^{(t)}(h_\sigma^{(t-1)}, h_\tau^{(t-1)}, \mathrm{Geom}(\sigma, \tau))\right],
  $$
  $$
  h_\sigma^{(t)} = \varphi_{\mathrm{upd}}^{(t)}(h_\sigma^{(t-1)}, \bigoplus_{\tau \in N(\sigma)} m_{\tau \to \sigma}^{(t)}),
  $$
  with $N^\ell(\sigma)$ aggregating faces ($k-1$), same-rank, and cofaces ($k+1$); $\oplus$ is a permutation-invariant aggregation.

- Cellular Isomorphism Networks (CIN, CIN++) [2306.03561] on cell complexes include lateral "lower" messages, enabling direct interaction among same-dimension cells via a common boundary, further increasing representational capacity and convergence speed.

Specialized mechanisms, such as attention (Simplicial Attention Networks), orientation-equivariant or E(n)-equivariant updates [2402.10011, 2406.03145], and persistent homology vectorization [2406.03164], can be layered onto this general template for domain-specific inductive biases.

## 3. Expressivity and Algorithmic Implications

Topological message-passing architectures strictly generalize GNNs in expressivity. Classical MPNNs are bounded by the 1-Weisfeiler–Lehman (WL) test, unable to distinguish certain non-isomorphic graphs or higher-order motifs (e.g., triangle faces vs. cycles). Simplicial Message Passing and the associated Simplicial Weisfeiler–Lehman (SWL) test provably extend this discriminative power:
- SWL distinguishes graph pairs that 1-WL and even 3-WL cannot, especially when lifting graphs to their clique complexes [2103.03212].
- MPSN-like networks with injective aggregators match SWL's power and can compute low-dimensional Betti numbers, capturing subtle topological distinctions such as the presence or absence of filled cliques or higher-order cycles [2307.05392, 2103.03212].
- The inclusion of lateral (lower and upper) adjacency relations (as in CIN++) further increases expressivity and alleviates structural oversquashing in dense topologies [2306.03561, 2506.06582].

Integrating topological invariants (e.g., persistent homology descriptors) as network features further extends the classical expressivity hierarchy, enabling discrimination of cases indistinguishable even by the SWL procedure [2406.03164].

## 4. Theoretical Limits: Oversquashing, Cohomology, and Sheafification

Higher-order message-passing frameworks inherit and extend core phenomena from graph GNNs, such as oversquashing (exponential decay of distant node influence) and oversmoothing (collapse of local features). The relational framework in [2506.06582] treats message passing on complexes as neural computation over general relational structures, introducing influence matrices and curvature-based characterizations:
- The sensitivity of a cell's output to distant inputs decays exponentially with topological "distance" in the extended influence graph, analogous to the spectral gap in graphs.
- Relational rewiring—adding artificial higher-arity relations—can increase long-range influence and mitigate oversquashing.

Many high-dimensional message-passing schemes admit a Laplacian (diffusional) interpretation. For $k>0$, the classical combinatorial Hodge Laplacian $\Delta^k$ implements diffusion that biases toward harmonic $k$-cochains (i.e., features supported on $k$-dimensional "holes"), but this can be opaque or degenerate, for example when cohomology vanishes [2509.23020]. Sheaf-theoretic generalizations replace singular cohomology with (data-driven) sheaf cohomology, using a learned sheaf Laplacian $\Delta_F^k$, thus enabling data-aware and flexible inductive biases adaptable to local constraints or physical symmetries [2509.23020].

## 5. Equivariance, Geometry, and Implementation Variants

In geometric domains, it is often crucial to encode equivariance under Euclidean symmetry groups $\mathrm{E}(n)$. E(n)-equivariant message-passing cellular networks (EMPCNs) [2406.03145] and Clifford group equivariant simplicial message passing (CSMPN) [2402.10011] use cell-wise or simplex-wise features initialized with geometric invariants (distances, volumes, areas, higher-grade Clifford multivectors) and update these through equivariant message and aggregation functions. Parameter sharing across dimensions and conditioning on simplex/simplicial type can improve scalability and preserve symmetry.

Implementation strategies for scalability include decoupling dense node-to-node communication from communication over higher-order cells (rings, faces) and using sparse adjacency or incidence data structures [2406.03145, 2307.05392]. Purely feed-forward approaches (Topo-MLP) inject topological priors at training time via contrastive losses over the incidence structure, enabling robust, inference-time connectivity independence [2312.11862].

## 6. Empirical Performance and Domain-Specific Insights

Topological message-passing networks have demonstrated empirical gains in diverse benchmarks:
- SMPNN significantly outperforms GCN/GAT/MPNN on molecular property regression (QM9, MD17, solubility), particularly when higher-order features (triangles, rings) are prevalent [2307.05392].
- CIN++ achieves state-of-the-art or near-best accuracy on molecular regression (ZINC), peptide structure/function, and real-world graph classification (TUDatasets), with lower messages facilitating non-local communication and denser ring-dominated regimes [2306.03561].
- E(n)-equivariant generalizations (EMPCN, CSMPN) yield substantial improvements in many-body prediction, motion forecasting, and atomic trajectory modeling over non-topological or non-equivariant baselines [2402.10011, 2406.03145].
- Integration of persistent homology (TopNets) provably boosts expressivity and yields further performance increases in molecular, protein, and antibody design benchmarks [2406.03164].

These successes are attributed to the ability of higher-order message-passing to capture both fine-grained combinatorial structure and global homological properties inaccessible to edge-based GNNs.

## 7. Open Questions and Future Directions

Key directions for ongoing research include:
- Developing equivariant and sheafified topological layers with learnable restriction maps, enabling end-to-end adaptation to data and physical symmetries [2509.23020].
- Extending frameworks from simplicial to generic cellular/CW complexes and arbitrary relational structures, enabling modeling of arbitrary group interactions and mixed set-based/part-whole relations [2306.03561, 2406.03145, 2506.06582].
- Formulating multi-scale and continuous-depth TNNs, leveraging persistence and dynamic complexes for temporal and multi-scale relational modeling [2406.03164, 2509.23020].
- Quantifying and mitigating oversquashing via curvature- or spectral-based rewiring and layer-wise regularization [2506.06582].
- Designing faster persistent homology computations and efficient batching for higher-dimensional complexes [2406.03164].
- Unifying frameworks and benchmarks to promote systematic comparison and adoption across applied domains [2304.10031].

Topological message passing beyond graphs thus constitutes a rapidly evolving synthesis of combinatorial topology, spectral theory, and deep learning, with demonstrable advantages in expressivity, robustness, and modeling of higher-order and topologically structured data [2304.10031, 2103.03212, 2307.05392, 2306.03561, 2402.10011, 2406.03145, 2406.03164, 2506.06582, 2509.23020].

Source: https://www.emergentmind.com/topics/topological-message-passing-beyond-graphs