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: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 article reviews the problem of learning graph structures from data, noting that research has traditionally split into two paths: inferring the topology of a single graph from observations on it, and learning a generative distribution from multiple observed graphs to sample new ones. It proposes a unified framework that treats both as inverse problems of a common graph generation process, reviews key methods, and discusses their interrelations, strengths, and limitations. The review highlights opportunities for cross‑paradigm integration and outlines future research directions.
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.
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:2608. 01160v1 Announce Type: new Abstract: Topological neural networks (TNNs) enable leveraging high-order structures on graphs (e.
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.
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:2608. 07029v1 Announce Type: new Abstract: Hyperbolic embeddings provide compact geometric representations of complex networks in hyperbolic spaces, but systematic comparisons of methods developed in machine learning, network science, and algorithmics remain rare.
Bridge-LP is a new framework for link prediction on text‑attributed graphs that combines Graph Neural Networks and Language Models. It introduces three design components: jumping connections for robust language model training, compressed embeddings to encode neighborhood information, and a cache embedding strategy to reduce computational cost. Experiments on nine datasets show that Bridge‑LP outperforms 40 existing models, achieving up to a 43.06% improvement in Mean Reciprocal Rank.
arXiv:2607. 10074v1 Announce Type: new Abstract: Graph machine learning provides powerful tools for understanding complex networks and learning meaningful node representations.
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...
arXiv:2509. 24256v2 Announce Type: replace-cross Abstract: The pretrain-transfer paradigm, which underpins the success of large language models (LLMs), has demonstrated the immense power of creating foundation models that learn generalizable representations from vast datasets.