arXiv:2608. 05016v1 Announce Type: cross Abstract: Predicting the existence and type of links (edges) between nodes in a multi-relational graph is key for applications from social interaction prediction to knowledge relationship identification.
By Zidu Yin, Yuankai Qi, Dong Gong, Ehsan Abbasnejad, Kun Yue, Javen Qinfeng Shi
The paper evaluates deep graph generative models against traditional network science models by comparing the topological similarity of generated networks to real-world networks and their effectiveness in identifying node immunization strategies for epidemic or misinformation spread. It finds that two deep graph generative models produce synthetic networks that closely resemble real-world structural properties, enabling them to identify effective immunization strategies.
By Tianrui Mao, Abele Malan, Megha Khosla, Lydia Chen, Huijuan Wang
The paper introduces an unsupervised graph neural network framework for solving the Minimum Dominating Set problem in social networks. By training on 12,000 synthetic graphs, the method achieves up to 55× faster inference than metaheuristic baselines and 14× faster than supervised approaches while producing optimal or near‑optimal dominating sets on real‑world benchmarks. The learned heuristic generalizes well to unseen graph distributions, indicating strong practical applicability for large‑scale social network analysis.
By Erfan Ahmadi, Mina Shirazi, Behnam Bahrak
arXiv:2606. 29596v1 Announce Type: cross Abstract: Characterizing the scenario underlying an epidemic from its disease cascade is an important task in simulation analytics.
By Amro Alabsi Aljundi, Galen Harrison, Jiangzhuo Chen, Abhijin Adiga, Anil Kumar Vullikanti, Madhav V. Marathe
The paper introduces DISCO, a deep‑learning framework for detecting overlapping communities in networks. DISCO integrates a diffusion‑based structural prior, sparse multi‑head attention, and a Bernoulli‑Poisson edge‑reconstruction objective to infer community affiliations from node attributes and structural profiles. Experiments show competitive performance against existing graph convolutional and attention methods, and a cybersecurity proof‑of‑concept demonstrates how community changes can signal anomalies in dynamic communication networks.
By Kosti Koistinen, Vesa Kuikka, Joni Herttuainen, Matthew Hendren, Brian Holt, Kimmo K. Kaski
arXiv:2507. 19702v1 Announce Type: cross Abstract: Identifying influential nodes in complex networks is a critical task with a wide range of applications across different domains.
By Mohammed A. Ramadhan, Abdulhakeem O. Mohammed