Dynamic Network Model Analysis Based on Communication Network

2014 ◽  
Vol 989-994 ◽  
pp. 2639-2642
Author(s):  
Nan Qi Yuan ◽  
Tian Jiang ◽  
Shi Bai ◽  
Hao Sun ◽  
Jing Mei Zhao

In order to research dynamic network astringency reaching uniformity, this paper perfects the Vicsek model and puts forward improving dynamic network astringency efficiency by weighted model. We prove that the convergence rate of weighted model is faster than the classic Vicsek model and it can optimize dynamic network.

2021 ◽  
Vol 235 ◽  
pp. 03035
Author(s):  
jiaojiao Lv ◽  
yingsi Zhao

Recommendation system is unable to achive the optimal algorithm, recommendation system precision problem into bottleneck. Based on the perspective of product marketing, paper takes the inherent attribute as the classification standard and focuses on the core problem of “matching of product classification and recommendation algorithm of users’ purchase demand”. Three hypotheses are proposed: (1) inherent attributes of the product directly affect user demand; (2) classified product is suitable for different recommendation algorithms; (3) recommendation algorithm integration can achieve personalized customization. Based on empirical research on the relationship between characteristics of recommendation information (independent variable) and purchase intention (dependent variable), it is concluded that predictability and difference of recommendation information are not fully perceived and stimulation is insufficient. Therefore, SIS dynamic network model based on the distribution model of SIS virus is constructed. It discusses the spreading path of recommendation information and “infection” situation of consumers to enhance accurate matching of recommendation system.


2015 ◽  
Vol 72 (5) ◽  
pp. 1153-1176 ◽  
Author(s):  
András Szabó-Solticzky ◽  
Luc Berthouze ◽  
Istvan Z. Kiss ◽  
Péter L. Simon

2016 ◽  
Vol 7 ◽  
Author(s):  
Ruud J. R. Den Hartigh ◽  
Marijn W. G. Van Dijk ◽  
Henderien W. Steenbeek ◽  
Paul L. C. Van Geert

Author(s):  
Istvan Z. Kiss ◽  
Luc Berthouze ◽  
Timothy J. Taylor ◽  
Péter L. Simon

In this paper a random link activation–deletion (RLAD) model is proposed that gives rise to a stochastically evolving network. This dynamic network is then coupled to a simple susceptible-infectious-suceptible ( SIS ) dynamics on the network, and the resulting spectrum of model behaviour is explored via simulation and a novel pairwise model for dynamic networks. First, the dynamic network model is systematically analysed by considering link-type independent and dependent network dynamics coupled with globally constrained link creation. This is done rigorously with some analytical results and we highlight where such analysis can be performed and how these simpler models provide a benchmark to test and validate full simulations. The pairwise model is used to study the interplay between SIS -type dynamics on the network and link-type-dependent activation–deletion. Assumptions of the pairwise model are identified and their implications interpreted in a way that complements our current understanding. Furthermore, we also discuss how the strong assumptions of the closure relations can lead to disagreement between the simulation and pairwise model. Unlike on a static network, the resulting spectrum of behaviour is more complex with the prevalence of infections exhibiting not only a single steady state, but also bistability and oscillations.


2011 ◽  
Vol 92 (1) ◽  
pp. 145-164 ◽  
Author(s):  
Glenn Tørå ◽  
Pål-Eric Øren ◽  
Alex Hansen

Sign in / Sign up

Export Citation Format

Share Document