scholarly journals Dynamics of information diffusion and its applications on complex networks

2016 ◽  
Vol 651 ◽  
pp. 1-34 ◽  
Author(s):  
Zi-Ke Zhang ◽  
Chuang Liu ◽  
Xiu-Xiu Zhan ◽  
Xin Lu ◽  
Chu-Xu Zhang ◽  
...  
Entropy ◽  
2021 ◽  
Vol 23 (9) ◽  
pp. 1216
Author(s):  
Jedidiah Yanez-Sierra ◽  
Arturo Diaz-Perez ◽  
Victor Sosa-Sosa

One of the main problems in graph analysis is the correct identification of relevant nodes for spreading processes. Spreaders are crucial for accelerating/hindering information diffusion, increasing product exposure, controlling diseases, rumors, and more. Correct identification of spreaders in graph analysis is a relevant task to optimally use the network structure and ensure a more efficient flow of information. Additionally, network topology has proven to play a relevant role in the spreading processes. In this sense, more of the existing methods based on local, global, or hybrid centrality measures only select relevant nodes based on their ranking values, but they do not intentionally focus on their distribution on the graph. In this paper, we propose a simple yet effective method that takes advantage of the underlying graph topology to guarantee that the selected nodes are not only relevant but also well-scattered. Our proposal also suggests how to define the number of spreaders to select. The approach is composed of two phases: first, graph partitioning; and second, identification and distribution of relevant nodes. We have tested our approach by applying the SIR spreading model over nine real complex networks. The experimental results showed more influential and scattered values for the set of relevant nodes identified by our approach than several reference algorithms, including degree, closeness, Betweenness, VoteRank, HybridRank, and IKS. The results further showed an improvement in the propagation influence value when combining our distribution strategy with classical metrics, such as degree, outperforming computationally more complex strategies. Moreover, our proposal shows a good computational complexity and can be applied to large-scale networks.


2019 ◽  
Vol 9 (18) ◽  
pp. 3758 ◽  
Author(s):  
Xiang Li ◽  
Xiaojie Wang ◽  
Chengli Zhao ◽  
Xue Zhang ◽  
Dongyun Yi

Locating the source that undergoes a diffusion-like process is a fundamental and challenging problem in complex network, which can help inhibit the outbreak of epidemics among humans, suppress the spread of rumors on the Internet, prevent cascading failures of power grids, etc. However, our ability to accurately locate the diffusion source is strictly limited by incomplete information of nodes and inevitable randomness of diffusion process. In this paper, we propose an efficient optimization approach via maximum likelihood estimation to locate the diffusion source in complex networks with limited observations. By modeling the informed times of the observers, we derive an optimal source localization solution for arbitrary trees and then extend it to general graphs via proper approximations. The numerical analyses on synthetic networks and real networks all indicate that our method is superior to several benchmark methods in terms of the average localization accuracy, high-precision localization and approximate area localization. In addition, low computational cost enables our method to be widely applied for the source localization problem in large-scale networks. We believe that our work can provide valuable insights on the interplay between information diffusion and source localization in complex networks.


2020 ◽  
Vol 08 (01) ◽  
pp. 93-112
Author(s):  
Péter Marjai ◽  
Attila Kiss

For decades, centrality has been one of the most studied concepts in the case of complex networks. It addresses the problem of identification of the most influential nodes in the network. Despite the large number of the proposed methods for measuring centrality, each method takes different characteristics of the networks into account while identifying the “vital” nodes, and for the same reason, each has its advantages and drawbacks. To resolve this problem, the TOPSIS method combined with relative entropy can be used. Several of the already existing centrality measures have been developed to be effective in the case of static networks, however, there is an ever-increasing interest to determine crucial nodes in dynamic networks. In this paper, we are investigating the performance of a new method that identifies influential nodes based on relative entropy, in the case of dynamic networks. To classify the effectiveness, the Suspected-Infected model is used as an information diffusion process. We are investigating the average infection capacity of ranked nodes, the Time-Constrained Coverage as well as the Cover Time.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Liang’an Huo ◽  
Xiaoxiao Xie

With the development of science and technology, products are being updated more and more quickly. Therefore, the diffusion of product information can make people better choose products. It is very meaningful to study the competition and diffusion of multiple product information. In this paper, the dual product information diffusion model with preference was proposed based on the mean-field equation in complex networks. The dynamic of the model was analyzed by the analysis of Markov chains. According to the Monte Carlo simulation mechanism, the critical threshold of product information was obtained. The accuracy of the theory and model results is verified by computer simulation, and the scenarios in which the two products information are mutually promoted and mutually suppressed are simulated.


2019 ◽  
Vol 06 (03) ◽  
pp. 285-309
Author(s):  
Thi Kim Thoa Ho ◽  
Quang Vu Bui ◽  
Marc Bui

In this research, we exploit a novel approach for propagation processes on a network related to textual information by using topic modeling and pretopology theory. We first introduce the textual agent’s network in which each agent represents a node which contains specific properties, particularly the agent’s interest. Agent’s interest is illustrated through the topic’s probability distribution which is estimated based on textual information using topic modeling. Based on textual agent’s network, we proposed two information diffusion models. The first model, namely Textual-Homo-IC, is an expanded model of independent cascade model in which the probability of infection is formed on homophily that is measured based on agent’s interest similarity. In addition to expressing the Textual-Homo-IC model on the static network, we also reveal it on dynamic agent’s network where there is transformation of not only the structure but also the node’s properties during the spreading process. We conducted experiments on two collected datasets from NIPS and a social network platform, Twitter, and have attained satisfactory results. On the other hand, we continue to exploit the dissemination process on a multi-relational agent’s network by integrating the pseudo-closure function from pretopology theory to the cascade model. By using pseudo-closure or stochastic pseudo-closure functions to define the set of neighbors, we can capture more complex kind of neighbors of a set. In this study, we propose the second model, namely Textual-Homo-PCM, an expanded model of pretopological cascade model, a general model for information diffusion process that can take place in more complex networks such as multi-relational networks or stochastic graphs. In Textual-Homo-PCM, pretopology theory will be applied to determine the neighborhood set on multi-relational agent’s network through pseudo-closure functions. Besides, threshold rule based on homophily will be used for activation. Experiments are implemented for simulating Textual-Homo-PCM and we obtained expected results. The work in this paper is an extended version of our paper [T. K. T. Ho, Q. V. Bui and M. Bui, Homophily independent cascade diffusion model based on textual information, in Computational Collective Intelligence, eds. N. T. Nguyen, E. Pimenidis, Z. Khan and B. Trawiski, Lecture Notes in Computer Science, Vol. 11055 (Springer International Publishing, 2018), pp. 134–145] presented in ICCCI 2018 conference.


Sign in / Sign up

Export Citation Format

Share Document