Abstract: Neural message passing serves as a cornerstone framework in graph neural networks, providing a clear and intuitive mathematical guideline for the propagation and aggregation of information among interconnected nodes within graphs. Throughout this process, node representations undergo dynamic updates, considering both the individual states and connections of neighboring nodes. Concurrently, social networks, as prominent forms of interconnected data, form dynamic systems that achieve stability through continuous internal communications and opinion exchanges among social actors along their social ties. Drawing upon the shared concepts between these two domains, our study establishes an explicit connection between message passing and opinion dynamics in sociology. Moreover, we introduce a novel continuous message passing scheme termed ODNet, which integrates bounded confidence to refine the influence weight of local nodes for message propagation. By adjusting the similarity cutoffs of bounded confidence and influence weights within ODNet, we define opinion exchange rules that align with the characteristics of neural message passing and can effectively mitigate the oversmoothing issue. We extend the framework to hypergraphs and formulate corresponding continuous message passing rules, which reveal a close association with particle dynamics. Empirically, we showcase that ODNet enhances prediction performance across various social networks presented as homophilic graphs, heterophilic graphs, and hypergraphs. Notably, our proposed ODNet outperforms existing GNNs with its straightforward construction and robust theoretical foundation.
Submission Length: Regular submission (no more than 12 pages of main content)
Changes Since Last Submission: We are very grateful to the reviewers for their constructive suggestions, which helped us improve the manuscript. In the revised version, we have followed the suggestions and made adjustments and updates to the text and experimental results, including:
1. Adding missing citations and updating the discussion of relevant literature in the Introduction and Related Works sections;
2. Including a large dataset (ogb-arXiv) to demonstrate the scalability of our method;
3. Updating two additional GNN baseline model for hypergraphs;
4. Adding a new case study on simplifying gene co-occurrence networks to showcase the applicability of our method to biological applications.
In the revised manuscript, all updates are highlighted in red.
Assigned Action Editor: ~Audra_McMillan1
Submission Number: 3134
Loading