اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدProbabilistic spreading of information in a spatial network
69
0
0.0
(
0
)
تأليف
Krzysztof Malarz
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Spread of information in crowd is analysed in terms of directed percolation in two-dimensional spatial network. We investigate the case when the information transmitted can be incomplete or damaged. The results indicate that for small or moderate probability of errors, it is only the critical connectivity that varies with this probability, but the shape of the transmission velocity curve remains unchanged in a wide range of the probability. The shape of the boundary between those already informed and those yet uninformed becomes complex when the connectivity of agents is small.
قيم البحث
اقرأ أيضاً
Epidemic spread on networks is one of the most studied dynamics in network science and has important implications in real epidemic scenarios. Nonetheless, the dynamics of real epidemics and how it is affected by the underline structure of the infecti
on channels are still not fully understood. Here we apply the SIR model and study analytically and numerically the epidemic spread on a recently developed spatial modular model imitating the structure of cities in a country. The model assumes that inside a city the infection channels connect many different locations, while the infection channels between cities are less and usually directly connect only a few nearest neighbor cities in a two-dimensional plane. We find that the model experience two epidemic transitions. The first lower threshold represents a local epidemic spread within a city but not to the entire country and the second higher threshold represents a global epidemic in the entire country. Based on our analytical solution we proposed several control strategies and how to optimize them. We also show that while control strategies can successfully control the disease, early actions are essentials to prevent the disease global spread.
Models of disease spreading are critical for predicting infection growth in a population and evaluating public health policies. However, standard models typically represent the dynamics of disease transmission between individuals using macroscopic pa
rameters that do not accurately represent person-to-person variability. To address this issue, we present a dynamic network model that provides a straightforward way to incorporate both disease transmission dynamics at the individual scale as well as the full spatiotemporal history of infection at the population scale. We find that disease spreads through a social network as a traveling wave of infection, followed by a traveling wave of recovery, with the onset and dynamics of spreading determined by the interplay between disease transmission and recovery. We use these insights to develop a scaling theory that predicts the dynamics of infection for diverse diseases and populations. Furthermore, we show how spatial heterogeneities in susceptibility to infection can either exacerbate or quell the spread of disease, depending on its infectivity. Ultimately, our dynamic network approach provides a simple way to model disease spreading that unifies previous findings and can be generalized to diverse diseases, containment strategies, seasonal conditions, and community structures.
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.
Recently, the impacts of spatiotemporal heterogeneities of human activities on spreading dynamics have attracted extensive attention. In this paper, to study heterogeneous response times on information spreading, we focus on the susceptible-infected
spreading dynamics with adjustable power-law response time distribution based on uncorrelated scale-free networks. We find that the stronger the heterogeneity of response times is, the faster the information spreading is in the early and middle stages. Following a given heterogeneity, the procedure of reducing the correlation between the response times and degrees of individuals can also accelerate the spreading dynamics in the early and middle stages. However, the dynamics in the late stage is slightly more complicated, and there is an optimal value of the full prevalence time changing with the heterogeneity of response times and the response time-degree correlation, respectively. The optimal phenomena results from the efficient allocation of heterogeneous response times.
A Random Geometric Graph (RGG) ensemble is defined by the disordered distribution of its node locations. We investigate how this randomness drives sample-to-sample fluctuations in the dynamical properties of these graphs. We study the distributional
properties of the algebraic connectivity which is informative of diffusion and synchronization timescales in graphs. We use numerical simulations to provide the first characterisation of the algebraic connectivity distribution for RGG ensembles. We find that the algebraic connectivity can show fluctuations relative to its mean on the order of $30 %$, even for relatively large RGG ensembles ($N=10^5$). We explore the factors driving these fluctuations for RGG ensembles with different choices of dimensionality, boundary conditions and node distributions. Within a given ensemble, the algebraic connectivity can covary with the minimum degree and can also be affected by the presence of density inhomogeneities in the nodal distribution. We also derive a closed-form expression for the expected algebraic connectivity for RGGs with periodic boundary conditions for general dimension.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
