Complexity

Link Prediction for Tree-Like Networks and Computational Communication


Publishing date
01 Jun 2022
Status
Closed
Submission deadline
14 Jan 2022

Lead Editor

1Nangjing University, Nanjing, China

2University of Western Australia, Perth, Australia

3Nanjing University, Nanjing, China

This issue is now closed for submissions.
More articles will be published in the near future.

Link Prediction for Tree-Like Networks and Computational Communication

This issue is now closed for submissions.
More articles will be published in the near future.

Description

Link prediction is the problem of predicting the location of either unknown and fake links in static networks or future and disappearing links in evolving networks. Link prediction algorithms are useful in gaining insights into different network structures from partial observations of exemplars.

However, existing link prediction algorithms only focus on regular complex networks and are overly dependent on either the closed triangular structure of networks or the so-called preferential attachment phenomenon. The performance of these algorithms on tree-like networks is poor. A high-accuracy link prediction algorithm in tree-like networks can help us understand the mechanism of online information propagation. The study of online information is an important branch of the field of computational communication or computational social science. Understanding the rules of online information or event propagation is still a challenge that is deeply related to social tie (link) prediction, user (node) ranking, community density, etc.

This Special Issue aims to improve link prediction accuracy for tree-like social (propagation) networks, and further our understanding of the online mass computational communication mechanism. Original research and review articles are welcome.

Potential topics include but are not limited to the following:

  • Link prediction for sparse networks
  • Null models for link prediction or complex networks
  • Online information propagation
  • Online mass computational communication
  • Community detection for link prediction or information propagation
  • Time series or chaos for information propagation
  • Information propagation for economic behavior
Complexity
Publishing Collaboration
More info
Wiley Hindawi logo
 Journal metrics
See full report
Acceptance rate28%
Submission to final decision77 days
Acceptance to publication24 days
CiteScore3.500
Journal Citation Indicator0.740
Impact Factor2.121
 Submit

Article of the Year Award: Outstanding research contributions of 2021, as selected by our Chief Editors. Read the winning articles.