Homophily is an important staticticis for network estimation, which indicates the consistency of labeling information and structural information (e.g., 1-hop neighborhood, adjacency matrix). On the contrary, heterophily is to depict the disconsistency of those information. Besides, assortative and disassortative are the synonyms for homophily and heterophily.
Originally, the idea of homophily is derived from social network, with strongly grounded explanation that similar people are more likely to make connections. This is a video of homophily in social network.
In recent years, the idea of homophily began to be explored in graph neural networks. It is a good point that more and more attention has been paid into the ralationships of the attributes of the networks themselves and the propagation mechanisms. Usually, homophily is taken as a prior assumption as the success of GNNs, demonstrated by the impressive performance on citation networks (e.g., cora, citeseer and pubmed) with high homophily. On the other hand, benchmarks with high heterophily are causing enmergerging interest to evaluate the effectiveness of a GNN model more comprehensively.
To sum up, this repository is made to provide a reading list of relative (basically) conference papers about homophily (heterophily) in GNNs, where two tracks are separated:
- ✔ Model improvements
- ✘ Analysis and discussions
| ID | Title | Year | Conference | Descriptions | Type | Group |
|---|---|---|---|---|---|---|
| 1️⃣ | Graph Neural Networks with Heterophily | 2021 | AAAI | It proposes a model called CPGNN that utilizes compatibility matrix to filter the signal from the compatible classes in every propagation step. | ✔ | Danai Koutra (University of Michigan) |
| 2️⃣ | Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs | 2020 | NeurIPS | It proposes H2GCN to flatten and maintain all the information that a network could provide. Three operations are adopted: ego- and neighbor- embedding seperation, higher-order neighborhoods and combination of intermediate representations. | ✔ | Danai Koutra (University of Michigan) |
| 3️⃣ | Is Homophily a Necessity for Graph Neural Networks? | 2021 | Arxiv | Designing experiments to indicate that homophily is not important to GNNs, and with fine-grid hyperparameters turning, GCN works well on heterophily datasets. | ✘ | Jiliang Tang (Michigan State University) |
| 4️⃣ | Non-Local Graph Neural Networks | 2020 | Arxiv | Targeting at disassortive graph, it designs various non-local aggregation operations on GNNs. | ✔ | Shuiwang Ji (Texas A&M University) |
| 5️⃣ | Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks | 2021 | Arxiv | It gives a unified framework to analyze over-smoothing and heterophily simultaneously. And the modeling novelty is a signed function for neighborhood aggregation, a filter by favoring the similar ones (similar to 1️⃣). | ✘ ✔ | Danai Koutra (University of Michigan) |
| 6️⃣ | Improving Robustness of Graph Neural Networks with Heterophily-Inspired Designs | 2021 | Arxiv | It attributes the sensitivity of GNNs to the homophily assumption that impactful structral attacks leads to increased heterophily. The improvements are similar to 2️⃣. | ✔ | Danai Koutra (University of Michigan) |
| 7️⃣ | Energy Levels Based Graph Neural Networks for Heterophily | 2021 | Journal of Physics: Conference Series | On the base of 2️⃣, it proposes an energy function based model to distinguish other classes besides itself, while 2️⃣ treats them equaly. | ✔ | Youfa Liu (Huazhong Agricultural University) |
| 8️⃣ | GCN-SL: Graph Convolutional Networks with Structure Learning for Graphs under Heterophily | 2021 | Arxiv | It proposes two operations: one is efficient aggregation of similar nodes avoiding long-range aggregation, the other is re-connected adjacency based on node similarity. | ✔ | Xinliang Wu (Xi’an Jiaotong University) |
| 9️⃣ | Unifying Homophily and Heterophily Network Transformation via Motifs | 2021 | Arxiv | It proposes a plugin to encode higher-order proximity under both homophily and heterophily conditions via a random-walking method. All the baselines are random-walking approaches. | ✔ | Haiping Lu (University of Sheffield) |
| 1️⃣0️⃣ | Label Propagation on K-Partite Graphs with Heterophily | 2021 | TKDE | In both heterogenous and heterophily graph, it proposes a novel label propagation algorithm. | ✔ | Linhong Zhu (Univ. of Southern California) |
| 1️⃣1️⃣ | Geom-GCN: Geometric Graph Convolutional Networks | 2020 | ICLR | ... | ✔ | Bo Yang (Jilin University) |
| 1️⃣2️⃣ | New Benchmarks for Learning on Non-Homophilous Graphs | 2021 | WWW | It presents a series of improved graph datasets with node label relationships that do not satisfy the homophily principle, with new measure approches. | ✘ | Cornell University & Facebook AI |
Summary of benchmarks