Definition
Heterophilic Graph
A heterophilic graph is a graph in which nodes tend to connect to other nodes that are dissimilar in their labels or features. It is the complement of a homophilic graph, where connected nodes are typically alike.
Formally, for an undirected graph with node labels , the graph exhibits heterophily when:
That is, the probability that two neighbours share the same label is much lower than the prior probability of label agreement in the graph.