Research map / Graph learning / GNN architectures
k-th Order Deep Homomorphism Networks
Takanori Maehara
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Extends Deep Homomorphism Networks to k-labelled patterns, giving a pattern-algebraic framework for higher-order GNN expressivity along skeleton complexity k and pattern vocabulary axes.
Problem
Characterizing the expressivity of higher-order graph neural networks, which depends on both global structures and local structures captured by pattern vocabularies.
Approach
Extends rooted-pattern Deep Homomorphism Networks to k-labelled patterns, separating expressivity into two independent axes (skeleton complexity k for global structure, pattern vocabulary for local structure), and introduces an auxiliary gluing operation to combine patterns.
Experimental setup
Builds on: Deep Homomorphism Networks
Closest papers by meaning
- Deep Homomorphism Networks (NeurIPS 2024 · similarity 0.91)
- Homomorphism Expressivity of Spectral Invariant Graph Neural Networks (ICLR 2025 · similarity 0.91)
- Homomorphism Counts for Graph Neural Networks: All About That Basis (ICML 2024 · similarity 0.89)
- Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness (ICLR 2024 · similarity 0.89)
- Schur Nets: exploiting local structure for equivariance in higher order graph neural networks (NeurIPS 2024 · similarity 0.88)
- Weisfeiler and Leman Go Loopy: A New Hierarchy for Graph Representational Learning (NeurIPS 2024 · similarity 0.88)
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.
