Research map / Graph learning / Graph algorithms and clustering
Transduction on Directed Graphs via Absorbing Random Walks
Jaydeep De, Xiaowei Zhang, Feng Lin, Li Cheng
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Diffusion Probabilistic Models for Structured Node Classification (NeurIPS 2023 · similarity 0.88)
- Revisiting Random Walks for Learning on Graphs (ICLR 2025 · similarity 0.87)
- Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs (ICML 2025 · similarity 0.87)
- Learning Long Range Dependencies on Graphs via Random Walks (ICLR 2025 · similarity 0.86)
- What Are Good Positional Encodings for Directed Graphs? (ICLR 2025 · similarity 0.86)
- Random Search Neural Networks for Efficient and Expressive Graph Learning (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
