arXiv:2607. 28259v1 Announce Type: new Abstract: We introduce Topoformer, a lightweight and scalable framework for graph representation learning that encodes topological structure into attention-friendly sequences.
Message-passing Graph Neural Networks (GNNs) iteratively propagate and aggregate local neighborhood information followed by global readout to learn graph representations. However, their discriminative...
arXiv:2609.17061v1 Announce Type: cross Abstract: Message-passing Graph Neural Networks (GNNs) iteratively propagate and aggregate local neighborhood information followed by global readout to learn g...
The paper introduces higher-order positional encodings that enrich graph representations by incorporating topological information from lifted incidence structures, without altering existing graph learning backbones. It theoretically shows that these encodings can mix graph Laplacian frequencies beyond what scalar spectral filters achieve, and demonstrates their effectiveness on Graph Transformers for datasets like ZINC and synthetic benchmarks. The approach bridges graph positional encodings and topological deep learning, enabling standard models to exploit higher-order interactions.
arXiv:2609.37884v1 Announce Type: new Abstract: Topological structures such as simplicial complexes, hypergraphs, and cell complexes extend standard graph models by modeling higher-order relationship...
arXiv:2601. 21207v4 Announce Type: replace-cross Abstract: Combinatorial and topological structures, such as graphs, simplicial complexes, and cell complexes, form the foundation of geometric and topological deep learning (GDL and TDL) architectures.
arXiv:2505. 15405v3 Announce Type: replace Abstract: While Graph Neural Networks (GNNs) have proven highly effective at modeling relational data, pairwise connections cannot fully capture multi-way relationships naturally present in complex real-world systems.
arXiv:2609.08152v1 Announce Type: new Abstract: Graph representation learning has largely focused on designing increasingly sophisticated models to transform graph topology into vector representation...
The paper demonstrates that high‑quality graph embeddings can be produced without complex models or training by propagating random features through topological structures derived from random walks and anonymous walks. These training‑free embeddings capture node proximity and structural roles, respectively, and perform competitively on node, edge, and graph tasks while often requiring less computation. Combining the two embedding types further improves inference quality for some tasks.
arXiv:2608. 01160v1 Announce Type: new Abstract: Topological neural networks (TNNs) enable leveraging high-order structures on graphs (e.
arXiv:2608. 15388v1 Announce Type: new Abstract: Topological deep learning (TDL) methods rely on lifting raw data into higher-order discrete domains such as simplicial complexes, cell complexes, and hypergraphs.
arXiv:2602. 01553v3 Announce Type: replace-cross Abstract: Link prediction is a core challenge in graph machine learning, demanding models that capture rich and complex topological dependencies.
arXiv:2607. 03007v1 Announce Type: cross Abstract: Recent advances in molecular large language models have led to strong performance on molecular understanding and generation tasks, yet these gains often come without reliable structural grounding.