اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAssessment of the risks of viral transmission in non-confined crowds
41
0
0.0
(
0
)
تأليف
Willy Garcia
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This work aims to assess the risks of Covid-19 disease spread in diverse daily-life situations (referred to as scenarios) involving crowds of maskless pedestrians, mostly outdoors. More concretely, we develop a method to infer the global number of new infections from patchyobservations of pedestrians. The method relies on ad hoc spatially resolved models for disease transmissionvia virus-laden respiratory droplets, which are fit to existing exposure studies about Covid-19. The approach is applied to the detailed field data about pedestrian trajectories and orientations that we acquired during the pandemic. This allows us to rank the investigated scenarios by the infection risks that they present; importantly, the obtained hierarchy of risks is conserved across all our transmission models (except the most pessimistic ones): Street caf{e}s present the largest average rate of new infections caused by an attendant, followed by busy outdoor markets, and then metro and train stations, whereas the risks incurred while walking on fairly busy streets (average density around 0.1 person/m${}^2$) are comparatively quite low. While none of our ad hoc models can claim accuracy, their converging predictions lend credence to these findings.} In scenarios with a moving crowd, we find that density is the main factor influencing the estimated infection rate. Finally, our study explores the efficiency of street and venue redesigns in mitigating the viral spread: While the benefits of enforcing one-way foot traffic in (wide) walkways are unclear, changing the geometry of queues substantially affects disease transmission risks.
قيم البحث
اقرأ أيضاً
In this paper, we study traffic dynamics in scale-free networks in which packets are generated with non-homogeneously selected sources and destinations, and forwarded based on the local routing strategy. We consider two situations of packet generatio
n: (i) packets are more likely generated at high-degree nodes; (ii) packets are more likely generated at low-degree nodes. Similarly, we consider two situations of packet destination: (a) packets are more likely to go to high-degree nodes; (b) packets are more likely to go to low-degree nodes. Our simulations show that the network capacity and the optimal value of $alpha$ corresponding to the maximum network capacity greatly depend on the configuration of packets sources and destinations. In particular, the capacity is greatly enhanced when most packets travel from low-degree nodes to high-degree nodes.
We study the directed and weighted network in which the wards of London are vertices and two vertices are connected whenever there is at least one person commuting to work from a ward to another. Remarkably the in-strength and in-degree distribution
tail is a power law with exponent around -2, while the out-strength and out-degree distribution tail is exponential. We propose a simple square lattice model to explain the observed empirical behaviour.
We study the betweenness centrality of fractal and non-fractal scale-free network models as well as real networks. We show that the correlation between degree and betweenness centrality $C$ of nodes is much weaker in fractal network models compared t
o non-fractal models. We also show that nodes of both fractal and non-fractal scale-free networks have power law betweenness centrality distribution $P(C)sim C^{-delta}$. We find that for non-fractal scale-free networks $delta = 2$, and for fractal scale-free networks $delta = 2-1/d_{B}$, where $d_{B}$ is the dimension of the fractal network. We support these results by explicit calculations on four real networks: pharmaceutical firms (N=6776), yeast (N=1458), WWW (N=2526), and a sample of Internet network at AS level (N=20566), where $N$ is the number of nodes in the largest connected component of a network. We also study the crossover phenomenon from fractal to non-fractal networks upon adding random edges to a fractal network. We show that the crossover length $ell^{*}$, separating fractal and non-fractal regimes, scales with dimension $d_{B}$ of the network as $p^{-1/d_{B}}$, where $p$ is the density of random edges added to the network. We find that the correlation between degree and betweenness centrality increases with $p$.
Inter-firm organizations, which play a driving role in the economy of a country, can be represented in the form of a customer-supplier network. Such a network exhibits a heavy-tailed degree distribution, disassortative mixing and a prominent communit
y structure. We analyze a large-scale data set of customer-supplier relationships containing data from one million Japanese firms. Using a directed network framework, we show that the production network exhibits the characteristics listed above. We conduct detailed investigations to characterize the communities in the network. The topology within smaller communities is found to be very close to a tree-like structure but becomes denser as the community size increases. A large fraction (~40%) of firms with relatively small in- or out-degrees have customers or suppliers solely from within their own communities, indicating interactions of a highly local nature. The interaction strengths between communities as measured by the inter-community link weights follow a highly heterogeneous distribution. We further present the statistically significant over-expressions of different prefectures and sectors within different communities.
We present an analysis of a person-to-person recommendation network, consisting of 4 million people who made 16 million recommendations on half a million products. We observe the propagation of recommendations and the cascade sizes, which we explain
by a simple stochastic model. We analyze how user behavior varies within user communities defined by a recommendation network. Product purchases follow a long tail where a significant share of purchases belongs to rarely sold items. We establish how the recommendation network grows over time and how effective it is from the viewpoint of the sender and receiver of the recommendations. While on average recommendations are not very effective at inducing purchases and do not spread very far, we present a model that successfully identifies communities, product and pricing categories for which viral marketing seems to be very effective.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
