arXiv (All)
open access
Path Laplacian Encodings for Directed Graphs
Directed graphs naturally model many real-world systems in which interactions are asymmetric, such as citation networks, web graphs, and information-flow networks. However, graph learning methods commonly rely on message passing with symmetrized graph representations or positional encodings that onl
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Causal graph rewriting#1051681
- Beyond the Laplacian: Doubly Stochastic Matrices for Graph Neural Networks#19023
- Scalable and Expressive Graph Representation Learning with Temporal, Structural, and Zero-Shot Capabilities#1071576
- S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs#200508
- Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)#670343
Record · ID 1200308
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive