mlsanityData to 7 Oct 2026

Not Just Oversmoothing: Detecting the Echo Chamber Effect in Graph Neural Networks

arXiv 2609.06521 ↗First posted 6 Sep 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Oversmoothing is a well-known failure mode of Graph Neural Networks (GNNs). However, most existing diagnostics rely on global aggregation measures that fail to capture the heterogeneous dynamics of message passing. Real-world graphs exhibit pronounced community structure, and message passing operates on two timescales, with representations collapsing rapidly within communities and slowly across them. This creates a critical gap in which intra-community representations can become indistinguishable while inter community separation persists, a failure mode that we refer to as the Echo Chamber Effect. To quantify this effect, we introduce the Echo Chamber Index (ECI), which stratifies pairwise distances by community membership and reveals when global energy diminishes while inter-community separation persists. ECI further shows that feature retention mechanisms can preserve the echo chamber under the conditions of our theoretical analysis. The consequences depend on label structure: when communities align with classes, the echo chamber can sharpen node classification, whereas when they do not, the same collapse makes classification provably harder. Motivated by this analysis, we propose Community-Aware Split Propagation (CASP), a lightweight plugin that decouples intra- and inter-community aggregation and learns their balance from label structure. CASP improves diverse backbone GNNs across most evaluated homophilic and heterophilic settings.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 42 of its 59 references that are in the map. First posted on arXiv 6 Sep 2026.

Builds on

42 of 59 references.

References · 42

  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. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  5. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  6. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
  7. 2019Simplifying Graph Convolutional Networkscited by 1,470
  8. 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
  9. 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
  10. 2020Simple and Deep Graph Convolutional Networkscited by 857
  11. 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
  12. 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 786
30 more
  1. 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
  2. 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
  3. 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
  4. 2019Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networkscited by 540
  5. 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 442
  6. 2019Diffusion Improves Graph Learningcited by 414
  7. 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 379
  8. 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 361
  9. 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 332
  10. 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
  11. 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 309
  12. 2023A Survey on Oversmoothing in Graph Neural Networkscited by 246
  13. 2020A Note on Over-Smoothing for Graph Neural Networkscited by 245
  14. 2021Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networkscited by 182
  15. 2022Finding Global Homophily in Graph Neural Networks When Meeting Heterophilycited by 179
  16. 2020Towards Deeper Graph Neural Networks with Differentiable Group Normalizationcited by 113
  17. 2022Not too little, not too much: a theoretical analysis of graph (over)smoothingcited by 106
  18. 2021Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patternscited by 95
  19. 2022Decoupling the Depth and Scope of Graph Neural Networkscited by 94
  20. 2023Edge Directionality Improves Learning on Heterophilic Graphscited by 88
  21. 2021Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?cited by 82
  22. 2022GraphWorld: Fake Graphs Bring Real Insights for GNNscited by 56
  23. 2021SkipNode: On Alleviating Performance Degradation for Deep Graph Convolutional Networkscited by 10
  24. 2025Depth-Adaptive Graph Neural Networks via Learnable Bakry-'Emery Curvaturecited by 8
  25. 2024AutoSGNN: Automatic Propagation Mechanism Discovery for Spectral Graph Neural Networkscited by 5
  26. 2025Beyond Fixed Depth: Adaptive Graph Neural Networks for Node Classification Under Varying Homophilycited by 5
  27. 2024Learn from Heterophily: Heterophilous Information-enhanced Graph Neural Networkcited by 3
  28. 2024Graph Neural Networks Need Cluster-Normalize-Activate Modulescited by 2
  29. 2023Quantifying the Echo Chamber Effect: An Embedding Distance-based Approachcited by 1
  30. 2025Analysis of Dirichlet Energies as Over-smoothing Measurescited by 1

Built on by

Not cited yet.