اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA general method for identifying node spreading influence via the adjacent matrix and spreading rate
148
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
With great theoretical and practical significance, identifying the node spreading influence of complex network is one of the most promising domains. So far, various topology-based centrality measures have been proposed to identify the node spreading influence in a network. However, the node spreading influence is a result of the interplay between the network topology structure and spreading dynamics. In this paper, we build up the systematic method by combining the network structure and spreading dynamics to identify the node spreading influence. By combining the adjacent matrix $A$ and spreading parameter $beta$, we theoretical give the node spreading influence with the eigenvector of the largest eigenvalue. Comparing with the Susceptible-Infected-Recovered (SIR) model epidemic results for four real networks, our method could identify the node spreading influence more accurately than the ones generated by the degree, K-shell and eigenvector centrality. This work may provide a systematic method for identifying node spreading influence.
قيم البحث
اقرأ أيضاً
Dynamic networks exhibit temporal patterns that vary across different time scales, all of which can potentially affect processes that take place on the network. However, most data-driven approaches used to model time-varying networks attempt to captu
re only a single characteristic time scale in isolation --- typically associated with the short-time memory of a Markov chain or with long-time abrupt changes caused by external or systemic events. Here we propose a unified approach to model both aspects simultaneously, detecting short and long-time behaviors of temporal networks. We do so by developing an arbitrary-order mixed Markov model with change points, and using a nonparametric Bayesian formulation that allows the Markov order and the position of change points to be determined from data without overfitting. In addition, we evaluate the quality of the multiscale model in its capacity to reproduce the spreading of epidemics on the temporal network, and we show that describing multiple time scales simultaneously has a synergistic effect, where statistically significant features are uncovered that otherwise would remain hidden by treating each time scale independently.
Identifying the node spreading influence in networks is an important task to optimally use the network structure and ensure the more efficient spreading in information. In this paper, by taking into account the shortest distance between a target node
and the node set with the highest $k$-core value, we present an improved method to generate the ranking list to evaluate the node spreading influence. Comparing with the epidemic process results for four real networks and the Barab{a}si-Albert network, the parameterless method could identify the node spreading influence more accurately than the ones generated by the degree $k$, closeness centrality, $k$-shell and mixed degree decomposition methods. This work would be helpful for deeply understanding the node importance of a network.
Improved mobility not only contributes to more intensive human activities but also facilitates the spread of communicable disease, thus constituting a major threat to billions of urban commuters. In this study, we present a multi-city investigation o
f communicable diseases percolating among metro travelers. We use smart card data from three megacities in China to construct individual-level contact networks, based on which the spread of disease is modeled and studied. We observe that, though differing in urban forms, network layouts, and mobility patterns, the metro systems of the three cities share similar contact network structures. This motivates us to develop a universal generation model that captures the distributions of the number of contacts as well as the contact duration among individual travelers. This model explains how the structural properties of the metro contact network are associated with the risk level of communicable diseases. Our results highlight the vulnerability of urban mass transit systems during disease outbreaks and suggest important planning and operation strategies for mitigating the risk of communicable diseases.
Background: Zipfs law and Heaps law are two representatives of the scaling concepts, which play a significant role in the study of complexity science. The coexistence of the Zipfs law and the Heaps law motivates different understandings on the depend
ence between these two scalings, which is still hardly been clarified. Methodology/Principal Findings: In this article, we observe an evolution process of the scalings: the Zipfs law and the Heaps law are naturally shaped to coexist at the initial time, while the crossover comes with the emergence of their inconsistency at the larger time before reaching a stable state, where the Heaps law still exists with the disappearance of strict Zipfs law. Such findings are illustrated with a scenario of large-scale spatial epidemic spreading, and the empirical results of pandemic disease support a universal analysis of the relation between the two laws regardless of the biological details of disease. Employing the United States(U.S.) domestic air transportation and demographic data to construct a metapopulation model for simulating the pandemic spread at the U.S. country level, we uncover that the broad heterogeneity of the infrastructure plays a key role in the evolution of scaling emergence. Conclusions/Significance: The analyses of large-scale spatial epidemic spreading help understand the temporal evolution of scalings, indicating the coexistence of the Zipfs law and the Heaps law depends on the collective dynamics of epidemic processes, and the heterogeneity of epidemic spread indicates the significance of performing targeted containment strategies at the early time of a pandemic disease.
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 spreaders. However,
most of the existing studies have overlooked the fact that in real social networks it is more costly and difficult to convince influential individuals to act as initial spreaders, resulting in a high risk in maximizing the spreading. In this paper, we address this problem on the basis of the assumption that large-degree nodes are activated with a higher risk than small-degree nodes. We aim to identify the effective initial spreaders to maximize spreading when considering both the activation risk and the outbreak size of initial spreaders. On random networks, the analytical analysis reveals that the degree of optimal initial spreaders does not correspond to the largest degree of nodes in the network but rather be determined by infection probability and difference of activation risk among nodes with different degree. Here, we propose a risk-aware metric to identify the effective spreaders on real networks. The numerical simulation shows that the risk-aware metric outperforms the existing benchmark centralities in maximizing the effective spreading.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
