scholarly journals Competing Complex Information Spreading in Multiplex Social Network

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Xiang Li ◽  
Bocheng Hou

Coevolution spreading dynamics on complex networks is a hot topic, which attracts much attention in network science. This paper proposes a mathematical model to describe the two competing complex information spreading dynamics on multiplex networks. An individual can only accept one of the two pieces of information. A heterogeneous mean-field theory is developed to describe the spreading dynamics. We reveal different regions through Monte Carlo simulations of the competing complex information spreading dynamics: no global information, one information dominant, and two information coexistence. We finally find that the heterogeneity of the multiplex networks’ degree distributions does not qualitatively affect the results.

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Jian Wang ◽  
Xiaolin Qin ◽  
Hongying Fang

Virus and information spreading dynamics widely exist in complex systems. However, systematic study still lacks for the interacting spreading dynamics between the two types of dynamics. This paper proposes a mathematical model on multiplex networks, which considers the heterogeneous susceptibility and infectivity in two subnetworks. By using a heterogeneous mean-field theory, we studied the dynamic process and outbreak threshold of the system. Through extensive numerical simulations on artificial networks, we find that the virus’s spreading dynamics can be suppressed by increasing the information spreading probability, decreasing the protection power, or decreasing the susceptibility and infectivity.


2012 ◽  
Vol 562-564 ◽  
pp. 1386-1389
Author(s):  
Yuan Mei Wang ◽  
Tao Li

In the SIR model once a node is cured after infection it becomes permanently immune,but we assume this immunity to be temporary. So we obtain an epidemic model with time delay on scale-free networks. Using the mean field theory the spreading threshold and the spreading dynamics is analyzed. Theoretical results indicate that the threshold is significantly dependent on the topology of scale-free networks and time delay. Numerical simulations confirmed the theoretical results.


1993 ◽  
Vol 3 (3) ◽  
pp. 385-393 ◽  
Author(s):  
W. Helfrich

2000 ◽  
Vol 61 (17) ◽  
pp. 11521-11528 ◽  
Author(s):  
Sergio A. Cannas ◽  
A. C. N. de Magalhães ◽  
Francisco A. Tamarit

2021 ◽  
Vol 104 (1) ◽  
Author(s):  
Qinghong Yang ◽  
Zhesen Yang ◽  
Dong E. Liu

Materials ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 778
Author(s):  
Yingli Niu ◽  
Xiangyu Bu ◽  
Xinghua Zhang

The application of single chain mean-field theory (SCMFT) on semiflexible chain brushes is reviewed. The worm-like chain (WLC) model is the best mode of semiflexible chain that can continuously recover to the rigid rod model and Gaussian chain (GC) model in rigid and flexible limits, respectively. Compared with the commonly used GC model, SCMFT is more applicable to the WLC model because the algorithmic complexity of the WLC model is much higher than that of the GC model in self-consistent field theory (SCFT). On the contrary, the algorithmic complexity of both models in SCMFT are comparable. In SCMFT, the ensemble average of quantities is obtained by sampling the conformations of a single chain or multi-chains in the external auxiliary field instead of solving the modified diffuse equation (MDE) in SCFT. The precision of this calculation is controlled by the number of bonds Nm used to discretize the chain contour length L and the number of conformations M used in the ensemble average. The latter factor can be well controlled by metropolis Monte Carlo simulation. This approach can be easily generalized to solve problems with complex boundary conditions or in high-dimensional systems, which were once nightmares when solving MDEs in SCFT. Moreover, the calculations in SCMFT mainly relate to the assemble averages of chain conformations, for which a portion of conformations can be performed parallel on different computing cores using a message-passing interface (MPI).


Sign in / Sign up

Export Citation Format

Share Document