mlsanityData to 7 Oct 2026

ECHO: Encoding Communities via High-order Operators

arXiv 2602.22446 ↗First posted 25 Feb 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Community detection in attributed networks faces a fundamental divide: topological algorithms ignore semantic features, while Graph Neural Networks (GNNs) encounter devastating computational bottlenecks. Specifically, GNNs suffer from a Semantic Wall of feature over smoothing in dense or heterophilic networks, and a Systems Wall driven by the O(N2) memory constraints of pairwise clustering. To dismantle these barriers, we introduce ECHO (Encoding Communities via High order Operators), a scalable, self supervised architecture that reframes community detection as an adaptive, multi scale diffusion process. ECHO features a Topology Aware Router that automatically analyzes structural heuristics sparsity, density, and assortativity to route graphs through the optimal inductive bias, preventing heterophilic poisoning while ensuring semantic densification. Coupled with a memory sharded full batch contrastive objective and a novel chunked O(N · K) similarity extraction method, ECHO completely bypasses traditional O(N2) memory bottlenecks without sacrificing the mathematical precision of global gradients. Extensive evaluations demonstrate that this topology feature synergy consistently overcomes the classical resolution limit. On synthetic LFR benchmarks scaled up to 1 million nodes, ECHO achieves scale invariant accuracy despite severe topological noise. Furthermore, on massive real world social networks with over 1.6 million nodes and 30 million edges, it completes clustering in mere minutes with throughputs exceeding 2,800 nodes per second matching the speed of highly optimized purely topological baselines. The implementation utilizes a unified framework that automatically engages memory sharded optimization to support adoption across varying hardware constraints. GitHub Repository: https://github.com/emilioferrara/ECHO-GNN

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 38 references that are in the map. First posted on arXiv 25 Feb 2026.

Builds on

19 of 38 references.

References · 19

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  5. 2014DeepWalk: Online Learning of Social Representationscited by 1,543
  6. 2020Graph Contrastive Learning with Augmentationscited by 1,203
  7. 2018Deep Graph Infomaxcited by 1,101
  8. 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
  9. 2018Pitfalls of Graph Neural Network Evaluationcited by 994
  10. 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
  11. 2020Contrastive Multi-View Representation Learning on Graphscited by 651
  12. 2015LINE: Large-scale Information Network Embeddingcited by 582
7 more
  1. 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 379
  2. 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 332
  3. 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
  4. 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 309
  5. 2017Graph Embedding Techniques, Applications, and Performance: A Surveycited by 188
  6. 2022Finding Global Homophily in Graph Neural Networks When Meeting Heterophilycited by 179
  7. 2013Mixing local and global information for community detection in large networkscited by 1

Built on by

Not cited yet.