Graph Aggregating-Repelling Network: Do Not Trust All Neighbors in Heterophilic Graphs.
Yuhu WangJinyong WenChunxia ZhangShiming XiangPublished in: Neural Networks (2024)
Keyphrases
- random graphs
- spanning tree
- graph theory
- graph theoretic
- highly connected
- graph structure
- dynamic networks
- fully connected
- graph representation
- finding the shortest path
- small world
- graph matching
- bipartite graph
- weighted graph
- subgraph isomorphism
- graph clustering
- edge weights
- directed graph
- graph mining
- graph construction
- community discovery
- densely connected
- graph properties
- network structure
- graph model
- graph data
- adjacency matrix
- protein interaction networks
- graph structures
- degree distribution
- maximal cliques
- graph databases
- complex networks
- clustering coefficient
- graph theoretical
- series parallel
- minimum spanning tree
- graph search
- graph classification
- labeled graphs
- peer to peer
- graph partitioning
- graph isomorphism
- average degree
- connected subgraphs
- structural pattern recognition
- directed edges
- neighboring nodes
- reachability queries
- trust model
- link prediction
- strongly connected
- wireless sensor networks
- nearest neighbor
- random walk
- dynamic graph
- undirected graph
- social network analysis
- social networks
- planar graphs
- knn
- connected components
- social graphs
- real world graphs
- power law
- query graph
- real world networks
- scale free
- neighborhood graph
- topological information