中文
相关论文

相关论文: A general method for identifying node spreading in…

200 篇论文

Network autocorrelation models are widely used to evaluate the impact of social influence on some variable of interest. This is a large class of models that parsimoniously accounts for how one's neighbors influence one's own behaviors or…

社会与信息网络 · 计算机科学 2020-05-21 Daniel K. Sewell

Identifying influential nodes in a network is a major issue due to the great deal of applications concerned, such as disease spreading and rumor dynamics. That is why, a plethora of centrality measures has emerged over the years in order to…

社会与信息网络 · 计算机科学 2023-01-04 Ahmed Ibnoulouafi , Mohamed El Haziti , Hocine Cherifi

Spreading is a ubiquitous process in the social, biological and technological systems. Therefore, identifying influential spreaders, which is important to prevent epidemic spreading and to establish effective vaccination strategies, is full…

物理与社会 · 物理学 2017-10-17 Senbin Yu , Liang Gao , Yi-Fan Wang , Ge Gao , Congcong Zhou , Zi-You Gao

Identifying influential spreaders in complex networks is a crucial problem which relates to wide applications. Many methods based on the global information such as $k$-shell and PageRank have been applied to rank spreaders. However, most of…

物理与社会 · 物理学 2015-06-16 Duan-Bing Chen , Rui Xiao , An Zeng , Yi-Cheng Zhang

It is widely acknowledged that the initial spreaders play an important role for the wide spreading of information in complex networks. Thus, a variety of centrality-based methods have been proposed to identify the most influential…

物理与社会 · 物理学 2021-04-15 Leyang Xue , Peng Zhang , An Zeng

The identification of important nodes in complex networks is an area of exciting growth due to its applications across various disciplines like disease controlling, community finding, data mining, network system controlling, just to name a…

社会与信息网络 · 计算机科学 2020-11-13 Qiuyan Shang , Yong Deng , Kang Hao Cheong

Measuring and optimizing the influence of nodes in big-data online social networks are important for many practical applications, such as the viral marketing and the adoption of new products. As the viral spreading on social network is a…

物理与社会 · 物理学 2018-07-31 Yanqing Hu , Shenggong Ji , Yuliang Jin , Ling Feng , H. Eugene Stanley , Shlomo Havlin

Many classes of network growth models have been proposed in the literature for capturing real-world complex networks. Existing research primarily focuses on global characteristics of these models, e.g., degree distribution. We aim to shift…

社会与信息网络 · 计算机科学 2020-09-02 Shravika Mittal , Tanmoy Chakraborty , Siddharth Pal

The identification of the most influential spreaders in networks is important to control and understand the spreading capabilities of the system as well as to ensure an efficient information diffusion such as in rumor-like dynamics. Recent…

Complex contagion phenomena, such as the spread of information or contagious diseases, often occur among the population due to higher-order interactions between individuals. Individuals who can be represented by nodes in a network may play…

物理与社会 · 物理学 2024-04-02 Su-Su Zhang , Xiaoyan Yu , Gui-Quan Sun , Chuang Liu , Xiu-Xiu Zhan

Infectious disease superspreading caused by heterogeneity in contact behavior has been observed to be an important determinant of epidemic dynamics and size in both empirical and theoretical settings. However, it has also been observed that…

Traditional metrics of node influence such as degree or betweenness identify highly influential nodes, but are rarely usefully accurate in quantifying the spreading power of nodes which are not. Such nodes are the vast majority of the…

社会与信息网络 · 计算机科学 2012-10-01 Glenn Lawyer

How to identify the influential spreaders in social networks is crucial for accelerating/hindering information diffusion, increasing product exposure, controlling diseases and rumors, and so on. In this paper, by viewing the k-shell value…

物理与社会 · 物理学 2016-03-30 Ling-Ling Ma , Chuang Ma , Hai-Feng Zhang , Bing-Hong Wang

Identifying influential nodes in the complex networks is of theoretical and practical significance. There are many methods are proposed to identify the influential nodes in the complex networks. In this paper, a local structure entropy…

社会与信息网络 · 计算机科学 2014-12-15 Qi Zhang , Meizhu Li , Yuxian Du , Yong Deng

We introduce a new method to efficiently approximate the number of infections resulting from a given initially-infected node in a network of susceptible individuals. Our approach is based on counting the number of possible infection walks…

生物物理 · 物理学 2012-10-25 Frank Bauer , Joseph T. Lizier

Identifying key nodes is crucial for accelerating or impeding dynamic spreading in a network. Community-aware centrality measures tackle this problem by exploiting the community structure of a network. Although there is a growing trend to…

社会与信息网络 · 计算机科学 2022-02-02 Stephany Rajeh , Marinette Savonnet , Eric Leclercq , Hocine Cherifi

The identification of key nodes in complex networks is an important topic in many network science areas. It is vital to a variety of real-world applications, including viral marketing, epidemic spreading and influence maximization. In…

社会与信息网络 · 计算机科学 2024-12-04 Mateusz Stolarski , Adam Piróg , Piotr Bródka

This survey presents the main results achieved for the influence maximization problem in social networks. This problem is well studied in the literature and, thanks to its recent applications, some of which currently deployed on the field,…

社会与信息网络 · 计算机科学 2018-06-21 Giuseppe De Nittis , Nicola Gatti

Inferring the network topology from the dynamics is a fundamental problem with wide applications in geology, biology and even counter-terrorism. Based on the propagation process, we present a simple method to uncover the network topology.…

物理与社会 · 物理学 2013-11-21 An Zeng

We propose a new method for assessing agents influence in network structures, which takes into consideration nodes attributes, individual and group influences of nodes, and the intensity of interactions. This approach helps us to identify…

社会与信息网络 · 计算机科学 2016-10-20 F. Aleskerov , N. Meshcheryakova , S. Shvydun