Link prediction in complex networks: A survey
Reads0
Chats0
TLDR
Recent progress about link prediction algorithms is summarized, emphasizing on the contributions from physical perspectives and approaches, such as the random-walk-based methods and the maximum likelihood methods.Abstract:
Link prediction in complex networks has attracted increasing attention from both physical and computer science communities. The algorithms can be used to extract missing information, identify spurious interactions, evaluate network evolving mechanisms, and so on. This article summaries recent progress about link prediction algorithms, emphasizing on the contributions from physical perspectives and approaches, such as the random-walk-based methods and the maximum likelihood methods. We also introduce three typical applications: reconstruction of networks, evaluation of network evolving mechanism and classification of partially labeled networks. Finally, we introduce some applications and outline future challenges of link prediction algorithms.read more
Citations
More filters
Journal ArticleDOI
Rate-optimal graphon estimation
Chao Gao,Yu Lu,Harrison H. Zhou +2 more
TL;DR: In this paper, the authors established the optimal rate of convergence for graphon estimation for the stochastic block model with k-clusters and showed that the optimal convergence rate is n −1/log k+k −2/n −2 +k−2 +n−2.
Journal ArticleDOI
Combining complex networks and data mining: Why and how
Massimiliano Zanin,David Papo,Pedro Sousa,Ernestina Menasalvas,Andrea Nicchi,Elaine Kubik,Stefano Boccaletti +6 more
TL;DR: The starting point of this review is that these two fields can in fact advantageously be used in a synergistic manner, and that this state of affairs should be put down to contingent rather than conceptual differences.
Proceedings ArticleDOI
Co-evolution of social and affiliation networks
TL;DR: This work proposes a novel model which captures the co-evolution of social and affiliation networks and facilitates controlled experiments which study the effect of actors' behavior on the evolution of affiliation networks, and it allows the generation of realistic synthetic datasets.
Journal ArticleDOI
Ranking in evolving complex networks
Hao Liao,Manuel Sebastian Mariani,Manuel Sebastian Mariani,Matúš Medo,Matúš Medo,Matúš Medo,Yi-Cheng Zhang,Zhou Mingyang +7 more
TL;DR: In this article, a review of existing ranking algorithms, both static and time-aware, and their applications to evolving networks is presented, emphasizing both the impact of network evolution on well-established static algorithms and the benefits from including the temporal dimension for tasks such as prediction of real network traffic, prediction of future links, and identification of highly significant nodes.
Journal ArticleDOI
Foundations and Modeling of Dynamic Networks Using Dynamic Graph Neural Networks: A Survey
TL;DR: This work establishes a foundation of dynamic networks with consistent, detailed terminology and notation and presents a comprehensive survey of dynamic graph neural network models using the proposed terminology.
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI
Equation of state calculations by fast computing machines
TL;DR: In this article, a modified Monte Carlo integration over configuration space is used to investigate the properties of a two-dimensional rigid-sphere system with a set of interacting individual molecules, and the results are compared to free volume equations of state and a four-term virial coefficient expansion.
Journal ArticleDOI
Emergence of Scaling in Random Networks
TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Journal ArticleDOI
The meaning and use of the area under a receiver operating characteristic (ROC) curve.
TL;DR: A representation and interpretation of the area under a receiver operating characteristic (ROC) curve obtained by the "rating" method, or by mathematical predictions based on patient characteristics, is presented and it is shown that in such a setting the area represents the probability that a randomly chosen diseased subject is (correctly) rated or ranked with greater suspicion than a random chosen non-diseased subject.
Journal ArticleDOI
Statistical mechanics of complex networks
TL;DR: In this paper, a simple model based on the power-law degree distribution of real networks was proposed, which was able to reproduce the power law degree distribution in real networks and to capture the evolution of networks, not just their static topology.