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. Enhancing local features with relevant global information is crucial for accurate link prediction, yet it remains challenging.
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.
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.
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.
arXiv:2606. 29596v1 Announce Type: cross Abstract: Characterizing the scenario underlying an epidemic from its disease cascade is an important task in simulation analytics.
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.
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.
arXiv:2608. 08406v1 Announce Type: new Abstract: Existing learning-based influence maximization frameworks rely heavily on complex neural architectures and continuous optimization over seed representations.
arXiv:2602. 14239v3 Announce Type: replace-cross Abstract: Predicting links in sparse, continuously evolving networks is a central challenge in network science.
arXiv:2607. 00671v1 Announce Type: cross Abstract: Graphs are a complex and versatile data structure used across various domains, with possibly multi-label nodes playing a particularly crucial role.
arXiv:2607. 16198v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) have emerged as the leading paradigm for link prediction, enabling the inference of missing connections and the anticipation of potential future links.
arXiv:2606. 16509v1 Announce Type: new Abstract: Link prediction in knowledge graphs fundamentally depends on the quality of learned embeddings for entities and relations.
arXiv:2606. 27201v1 Announce Type: new Abstract: Event-based Temporal Graph Neural Networks (ETGNNs) have demonstrated strong performance across a wide range of applications, including social network analysis, epidemic tracing, recommender systems, and political event forecasting.