- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work focuses on understanding whether degree dispersion informs GNN performance, going beyond what existing homophily measures enable. Building on prior work connecting degree and homophily to graph learning, the authors introduce degree regularity, which measures how concentrated the degree distribution is, and incorporate it into Tri-Hom to construct a degree-aware global homophily. Additionally, the authors develop a calibrated synthetic graph generator to investigate this relationship, finding that more uniform degrees can help or hurt performance depending on label homophily. On a large set of real-world datasets, the proposed metric achieves higher correlations with GNN accuracy than the evaluated alternatives.
Critical strengths
- I think the joint understanding of degree and homophily is very important for graph learning, and the authors do a good job of looking at a large set of metrics.
- I found the synthetic analysis useful and interesting, particularly the demonstration that changing degree dispersion can unintentionally change graph density. The finding that the direction of the effect depends on label homophily is also interesting, although it would benefit for further situation within the literature (see W1)
- The empirical results seem fairly comprehensive given the wide array of properties studied, as well as datasets covered.
Critical weaknesses
- One thing that remains unclear to me is the novelty of the work. I think the analysis is comprehensive, but several previous works already examine how degree and homophily interact to affect GNN behavior. For instance, [1] and [2] study these interactions, albeit at the node-level. Can the authors comment on what additional understanding is provided by this work? The authors should also consider ESNR [3], which already evaluates GNN performance across different connectivity and homophily settings. Comparing against ESNR would help establish whether the proposed metric captures additional information beyond existing approaches with a similar objective.
- I am also somewhat uncertain about how reliably the proposed metric improves on Tri-Hom. The gains in correlation are quite small, and, while the authors acknowledge the limited statistical power, the generalization results raise a related concern where performance on unseen benchmark families is mixed. I appreciate that the authors include these checks, but in total the results seem somewhat inconclusive. Perhaps this would be partially addressed by addressing W1 and clarifying novelty.
- Another question is whether the global degree adequately captures the interaction motivating the paper. For instance, two graphs can have the same degree distribution and homophily while differing in whether their high-degree nodes tend to have homophilous or heterophilous neighborhoods. Could the authors examine performance jointly by degree and node-level homophily, and investigate whether degree regularity remains informative after accounting for their relationship?
Minor point:
- While I appreciate the intention behind Table 43, the “claim/evidence/verdict” format reads more like an internal review checklist than part of a scientific paper. I think discussing their implications within the work itself would be more beneficial.
[1] Yan et al. "Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks" [2] Loveland et al. "On Performance Discrepancies Across Local Homophily Levels in Graph Neural Networks" [3] Dong and Kluger "Towards Understanding and Reducing Graph Structural Noise for GNNs"
Questions for authors
Please see weaknesses