2022
DOI: 10.48550/arxiv.2206.07369
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

DiffWire: Inductive Graph Rewiring via the Lovász Bound

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
1
0
Order By: Relevance
“…The above discussion highlights the importance of amplifying information flow from distant nodes to alleviate over-squashing in graphs and the aforementioned graph rewiring is an effective to achieve the goal. There are wo main types of graph rewiring methods that are spatial graph rewiring [221,244,247,248,249,250,251,252] and spectral graph rewiring [246,253,254,255,256,257,258]. The spatial graph rewiring usually connect one node to another node within its receptive field while spectral graph rewiring often optimize some metrics that measures connectivity of graphs.…”
Section: Over-squashingmentioning
confidence: 99%
“…The above discussion highlights the importance of amplifying information flow from distant nodes to alleviate over-squashing in graphs and the aforementioned graph rewiring is an effective to achieve the goal. There are wo main types of graph rewiring methods that are spatial graph rewiring [221,244,247,248,249,250,251,252] and spectral graph rewiring [246,253,254,255,256,257,258]. The spatial graph rewiring usually connect one node to another node within its receptive field while spectral graph rewiring often optimize some metrics that measures connectivity of graphs.…”
Section: Over-squashingmentioning
confidence: 99%
“…GSL methods aim to jointly learn an optimized graph structure and its corresponding node representations [7,9,11]. Methods that change the structure of graphs to enhance performance for downstream tasks are often generically referred to as graph rewiring [2,6,10,26]. For instance, in the extensive applications of GR, Bi et al and Li et al [3,16] adopt GR methods to approach the low homophily problems in the classification of heterophily graph, Guo et al design a GR method to handle low homophily problem of heterogeneous graphs [12].…”
Section: Graph Rewiringmentioning
confidence: 99%