اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDetecting the Influence of Spreading in Social Networks with Excitable Sensor Networks
211
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Detecting spreading outbreaks in social networks with sensors is of great significance in applications. Inspired by the formation mechanism of humans physical sensations to external stimuli, we propose a new method to detect the influence of spreading by constructing excitable sensor networks. Exploiting the amplifying effect of excitable sensor networks, our method can better detect small-scale spreading processes. At the same time, it can also distinguish large-scale diffusion instances due to the self-inhibition effect of excitable elements. Through simulations of diverse spreading dynamics on typical real-world social networks (facebook, coauthor and email social networks), we find that the excitable senor networks are capable of detecting and ranking spreading processes in a much wider range of influence than other commonly used sensor placement methods, such as random, targeted, acquaintance and distance strategies. In addition, we validate the efficacy of our method with diffusion data from a real-world online social system, Twitter. We find that our method can detect more spreading topics in practice. Our approach provides a new direction in spreading detection and should be useful for designing effective detection methods.
قيم البحث
اقرأ أيضاً
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.
Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however,
two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using a static, structurally realistic social network as a platform for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Although partial observation inflates the length of the shortest path, the stochastic nature of the spreading process also frequently derails the dynamic path from the shortest path. We find that the partially observed shortest path does not necessarily give an inflated estimate of the length of the process path; in fact, partial observation may, counterintuitively, make the path seem shorter than it actually is.
In this Letter, we empirically study the influence of reciprocal links, in order to understand its role in affecting the structure and function of directed social networks. Experimental results on two representative datesets, Sina Weibo and Douban, d
emonstrate that the reciprocal links indeed play a more important role than non-reciprocal ones in both spreading information and maintaining the network robustness. In particular, the information spreading process can be significantly enhanced by considering the reciprocal effect. In addition, reciprocal links are largely responsible for the connectivity and efficiency of directed networks. This work may shed some light on the in-depth understanding and application of the reciprocal effect in directed online social networks.
Most infectious diseases spread on a dynamic network of human interactions. Recent studies of social dynamics have provided evidence that spreading patterns may depend strongly on detailed micro-dynamics of the social system. We have recorded every s
ingle interaction within a large population, mapping out---for the first time at scale---the complete proximity network for a densely-connected system. Here we show the striking impact of interaction-distance on the network structure and dynamics of spreading processes. We create networks supporting close (intimate network, up to ~1m) and longer distance (ambient network, up to ~10m) modes of transmission. The intimate network is fragmented, with weak ties bridging densely-connected neighborhoods, whereas the ambient network supports spread driven by random contacts between strangers. While there is no trivial mapping from the micro-dynamics of proximity networks to empirical epidemics, these networks provide a telling approximation of droplet and airborne modes of pathogen spreading. The dramatic difference in outbreak dynamics has implications for public policy and methodology of data collection and modeling.
We study a multi-type SIR epidemic process among a heterogeneous population that interacts through a network. When we base social contact on a random graph with given vertex degrees, we give limit theorems on the fraction of infected individuals. For
a given social distancing individual strategies, we establish the epidemic reproduction number $R_0$ which can be used to identify network vulnerability and inform vaccination policies. In the second part of the paper we study the equilibrium of the social distancing game, in which individuals choose their social distancing level according to an anticipated global infection rate, which then must equal the actual infection rate following their choices. We give conditions for the existence and uniqueness of equilibrium. For the case of random regular graphs, we show that voluntary social distancing will always be socially sub-optimal.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
