aiqbench analysis
This research investigates how graph compression techniques like coarsening and sparsification impact signal propagation dynamics, revealing an inherent trade-off between preserving fidelity and maintaining signal diversity. The study demonstrates that while one method may better mimic original trajectories, it often sacrifices structural richness or suffers from rank collapse, challenging existing evaluation metrics in graph learning. These findings are critical for advancing efficient machine learning on graphs where understanding information flow is central to model performance.
Does Graph Compression Preserve Signal Propagation?
arXiv:2607.23338v1 Announce Type: new Abstract: Graph compression reduces the computational cost of graph learning, but its effect on signal propagation remains largely underexplored. Existing work evaluates compression through downstream task performance or structural preservation, neither of which directly captures how propagation dynamics change after compression. We study two fundamental compression paradigms, coarsening and sparsification, and ask whether they preserve the propagation behavior of the original graph. Across five datasets, varying compression rates, and propagation depths, we measure signal behavior through three complementary metrics. Our results reveal a consistent tension between the two compression families. Sparsification retains higher signal diversity and mitigates oversmoothing, but its propagation trajectory progressively diverges from that of the original graph. Coarsening more faithfully preserves propagation behavior, but at the cost of stronger smoothing and rank collapse. These findings demonstrate that two propagation-centric objectives, preserving signal diversity and preserving propagation fidelity, are distinct and empirically at odds under graph compression, highlighting the need for evaluation protocols that jointly consider both dimensions. The code and results are available at: https://github.com/KawshikBanerjee/Compression-Propagation-Duality
Title:Does Graph Compression Preserve Signal Propagation?
Abstract:Graph compression reduces the computational cost of graph learning, but its effect on signal propagation remains largely underexplored. Existing work evaluates compression through downstream task performance or structural preservation, neither of which directly captures how propagation dynamics change after compression. We study two fundamental compression paradigms, coarsening and sparsification, and ask whether they preserve the propagation behavior of the original graph. Across five datasets, varying compression rates, and propagation depths, we measure signal behavior through three complementary metrics. Our results reveal a consistent tension between the two compression families. Sparsification retains higher signal diversity and mitigates oversmoothing, but its propagation trajectory progressively diverges from that of the original graph. Coarsening more faithfully preserves propagation behavior, but at the cost of stronger smoothing and rank collapse. These findings demonstrate that two propagation-centric objectives, preserving signal diversity and preserving propagation fidelity, are distinct and empirically at odds under graph compression, highlighting the need for evaluation protocols that jointly consider both dimensions. The code and results are available at: this https URL
Machine Learning (cs.LG)
arXiv:2607.23338 [cs.LG]
(or arXiv:2607.23338v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2607.23338 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 269 words
Related coverage
Channel-Adaptive Region Adjacency Graph Carriers for Semantic Image Communication
arXiv · Sep 15, 2026

Presentation: Ontology‐Driven Observability: Building the E2E Knowledge Graph at Netflix Scale
InfoQ · Oct 9, 2026

AI and Quantum Computing Briefing
livetradingnews.com · Aug 4, 2026
Context-aware Modality-Topology Co-Alignment for Multimodal Attributed Graphs
arXiv · Jun 15, 2026