Topological aspects, like community structure, and temporal activity patterns, like burstiness, have been shown to severly influence the speed of spreading in temporal networks. We study the influence of the topology on the susceptible-infected (SI) spreading on time stamped communication networks, as obtained from a dataset of mobile phone records. We consider city level networks with intra- and inter-city connections. The networks using only intra-city links are usually sparse, where the spreading depends mainly on the average degree. The inter-city links serve as bridges in spreading, speeding up considerably the process. We demonstrate the effect also on model simulations.
The mitigation of an infectious disease spreading has recently gained considerable attention from the research community. It may be obtained by adopting sanitary measurements social rules, together with an extensive vaccination campaign. Vaccination is currently the primary way for mitigating the Coronavirus Disease (COVID-19) outbreak without severe lockdown. Its effectiveness also depends on the number and timeliness of administrations and thus demands strict prioritization criteria. Almost all countries have prioritized similar classes of exposed workers obtaining to maximize the survival o…
Many dynamical phenomena in complex systems concern spreading that plays out on top of networks with changing architecture over time -- commonly known as temporal networks. A complex system's proneness to facilitate spreading phenomena, which we abbreviate as its `spreading vulnerability', is often surmised to be related to the topology of the temporal network featured by the system. Yet, cleanly extracting spreading vulnerability of a complex system directly from the topological information of the temporal network remains a challenge. Here, using data from a diverse set of real-world complex …
The propagations of diseases, behaviors and information in real systems are rarely independent of each other, but they are coevolving with strong interactions. To uncover the dynamical mechanisms, the evolving spatiotemporal patterns and critical phenomena of networked coevolution spreading are extremely important, which provide theoretical foundations for us to control epidemic spreading, predict collective behaviors in social systems, and so on. The coevolution spreading dynamics in complex networks has thus attracted much attention in many disciplines. In this review, we introduce recent pr…
The collective behaviour of people adopting an innovation, product or online service is commonly interpreted as a spreading phenomenon throughout the fabric of society. This process is arguably driven by social influence, social learning and by external effects like media. Observations of such processes date back to the seminal studies by Rogers and Bass, and their mathematical modelling has taken two directions: One paradigm, called simple contagion, identifies adoption spreading with an epidemic process. The other one, named complex contagion, is concerned with behavioural thresholds and suc…
The safety and robustness of the network have attracted the attention of people from all walks of life, and the damage of several key nodes will lead to extremely serious consequences. In this paper, we proposed the clustering H-index mixing (CHM) centrality based on the H- index of the node itself and the relative distance of its neighbors. Starting from the node itself and combining with the topology around the node, the importance of the node and its spreading capability were determined. In order to evaluate the performance of the proposed method, we use Susceptible-Infected-Recovered (SIR)…
Influence overlap is a universal phenomenon in influence spreading for social networks. In this paper, we argue that the redundant influence generated by influence overlap cause negative effect for maximizing spreading influence. Firstly, we present a theoretical method to calculate the influence overlap and record the redundant influence. Then in term of eliminating redundant influence, we present two algorithms, namely, Degree-Redundant-Influence (DRS) and Degree-Second-Neighborhood (DSN) for multiple spreaders identification. The experiments for four empirical social networks successfully v…
Using network-based information to facilitate information spreading is an essential task for spreading dynamics in complex networks, which will benefit the promotion of technical innovations, healthy behaviors, new products, etc. Focusing on degree correlated networks, we propose a preferential contact strategy based on the local network structure and local informed density to promote the information spreading. During the spreading process, an informed node will preferentially select a contact target among its neighbors, basing on their degrees or local informed densities. By extensively imple…
Agent-based simulations of emotion spreading in online social networks
对来自在线社交网络的经验数据的定量分析揭示了情感参与的群体动态（Šuvakov et al）。然而，充分了解其内在机制仍然是一项具有挑战性的任务。利用基于Agent的计算机模拟，本文研究了在线社交网络中情感交流的动力学。从\texttt{MySpace}社会网络的经验数据集出发，得到了指导主体如何交互的规则，并推导出了现实的网络结构和一些重要的参数。Agent的情绪状态由两个变量表征，一个是对刺激的反应性，另一个是吸引力或厌恶度，通过这两个变量可以定义常见的情绪。代理人的行动是由增强的唤醒触发的。高分辨率的动态实现，其中每个消息携带代理的情绪沿网络链路被确定，其对接收代理的影响被认为是不断老化的时间。我们的研究结果表明：（i）聚合的群体行为可能产生于个体的情感行为;（ii）集体状态的特点是时间的相关性和占主导地位的积极情绪出现，类似于经验系统;（iii）驱动信号的性质--用户进入网络世界的速度，对建立连贯的行为有深远的影响，这是观察到的用户在在线社交网络。此外，我们的模拟表明，情绪的传播模式不同，例如，“热情”和“惭愧”，这两个词的情感内涵完全不同。{ \bf {本研究中使用的所有数据均完全匿名。}}
Online social media have greatly affected the way in which we communicate with each other. However, little is known about what are the fundamental mechanisms driving dynamical information flow in online social systems. Here, we introduce a generative model for online sharing behavior that is analytically tractable and which can reproduce several characteristics of empirical micro-blogging data on hashtag usage, such as (time-dependent) heavy-tailed distributions of meme popularity. The presented framework constitutes a null model for social spreading phenomena which, in contrast to purely empi…
The effective use of limited resources for controlling spreading processes on networks is of prime significance in diverse contexts, ranging from the identification of "influential spreaders" for maximizing information dissemination and targeted interventions in regulatory networks, to the development of mitigation policies for infectious diseases and financial contagion in economic systems. Solutions for these optimization tasks that are based purely on topological arguments are not fully satisfactory; in realistic settings the problem is often characterized by heterogeneous interactions and …
A model for the spreading of online information or "memes" on multiplex networks is introduced and analyzed using branching-process methods. The model generalizes that of [Gleeson et al., Phys.Rev. X., 2016] in two ways. First, even for a monoplex (single-layer) network, the model is defined for any specific network defined by its adjacency matrix, instead of being restricted to an ensemble of random networks. Second, a multiplex version of the model is introduced to capture the behaviour of users who post information from one social media platform to another. In both cases the branching proce…
Although viral spreading processes taking place in networks are often analyzed using Markovian models in which both the transmission and the recovery times follow exponential distributions, empirical studies show that, in many real scenarios, the distribution of these times are not necessarily exponential. To overcome this limitation, we first introduce a generalized susceptible-infected-susceptible (SIS) spreading model that allows transmission and recovery times to follow phase-type distributions. In this context, we derive a lower bound on the exponential decay rate towards the infection-fr…
Understanding the importance of links in transmitting information in a network can provide ways to hinder or postpone ongoing dynamical phenomena like the spreading of epidemic or the diffusion of information. In this work, we propose a new measure based on stochastic diffusion processes, the \textit{transmission centrality}, that captures the importance of links by estimating the average number of nodes to whom they transfer information during a global spreading diffusion process. We propose a simple algorithmic solution to compute transmission centrality and to approximate it in very large n…
The spread of ideas in online social networks is a crucial phenomenon to understand nowadays the proliferation of fake news and their impact in democracies. This makes necessary to use models that mimic the circulation of rumors. The law of large numbers as well as the probability distribution of contact groups allow us to construct a model with a minimum number of hypotheses. Moreover, we can analyze with this model the presence of very polarized groups of individuals (humans or bots) who spread a rumor as soon as they know about it. Given only the initial number of individuals who know any n…
The networked structure of contacts shapes the spreading of epidemic processes. Recent advances on network theory have improved our understanding of the epidemic processes at large scale. The relevance of several considerations still needs to be evaluated in the study of epidemic spreading. One of them is that of accounting for the influence of origin and destination patterns in the flow of the carriers of an epidemic. Here we compute origin-destination patterns compatible with empirical data of coarse grained flows in the air transportation network. We study the incidence of epidemic processe…
Link prediction can be used to extract missing information, identify spurious interactions as well as forecast network evolution. Network embedding is a methodology to assign coordinates to nodes in a low dimensional vector space. By embedding nodes into vectors, the link prediction problem can be converted into a similarity comparison task. Nodes with similar embedding vectors are more likely to be connected. Classic network embedding algorithms are random-walk-based. They sample trajectory paths via random walks and generate node pairs from the trajectory paths. The node pair set is further …
Finding the infection sources in a network when we only know the network topology and infected nodes, but not the rates of infection, is a challenging combinatorial problem, and it is even more difficult in practice where the underlying infection spreading model is usually unknown a priori. In this paper, we are interested in finding a source estimator that is applicable to various spreading models, including the Susceptible-Infected (SI), Susceptible-Infected-Recovered (SIR), Susceptible-Infected-Recovered-Infected (SIRI), and Susceptible-Infected-Susceptible (SIS) models. We show that under …
Identifying the most influential spreaders that maximize information flow is a central question in network theory. Recently, a scalable method called "Collective Influence (CI)" has been put forward through collective influence maximization. In contrast to heuristic methods evaluating nodes' significance separately, CI method inspects the collective influence of multiple spreaders. Despite that CI applies to the influence maximization problem in percolation model, it is still important to examine its efficacy in realistic information spreading. Here, we examine real-world information flow in v…
A spreading process on a network is influenced by the network's underlying spatial structure, and it is insightful to study the extent to which a spreading process follows such structure. We consider a threshold contagion model on a network whose nodes are embedded in a manifold and which has both `geometric edges', which respect the geometry of the underlying manifold, and `nongeometric edges' that are not constrained by that geometry. Building on ideas from Taylor et al. \cite{Taylor2015}, we examine when a contagion propagates as a wave along a network whose nodes are embedded in a torus an…
This paper studies topology inference, from agent states, of a directed cyber-social network with opinion spreading dynamics model that explicitly takes confirmation bias into account. The cyber-social network comprises a set of partially connected directed network of agents at the social level, and a set of information sources at the cyber layer. The necessary and sufficient conditions for the existence of exact inference solution are characterized. A method for exact inference, when it is possible, of entire network topology as well as confirmation bias model parameters is proposed for the c…
In this brief, we study epidemic spreading dynamics taking place in complex networks. We specifically investigate the effect of synergy, where multiple interactions between nodes result in a combined effect larger than the simple sum of their separate effects. Although synergistic effects play key roles in various biological and social phenomena, their analyses have been often performed by means of approximation techniques and for limited types of networks. In order to address this limitation, this paper proposes a rigorous approach to quantitatively understand the effect of synergy in the Sus…
Human contact networks are constituted by a multitude of individuals and pairwise contacts among them. However, the dynamic nature, which generates the evolution of human contact networks, of contact patterns is not known yet. Here, we analyse three empirical datasets and identify two crucial mechanisms of the evolution of temporal human contact networks, i.e. the activity state transition laws for an individual to be socially active, and the contact establishment mechanism that active individuals adopt. We consider both of the two mechanisms to propose a temporal network model, named the memo…
Understanding the dynamics of computer virus (malware, worm) in cyberspace is an important problem that has attracted a fair amount of attention. Early investigations for this purpose adapted biological epidemic models, and thus inherited the so-called homogeneity assumption that each node is equally connected to others. Later studies relaxed this often-unrealistic homogeneity assumption, but still focused on certain power-law networks. Recently, researchers investigated epidemic models in {\em arbitrary} networks (i.e., no restrictions on network topology). However, all these models only capt…
Distance Backbones Optimize Spreading Dynamics and Centrality Ranks in the Sparsification of Complex Networks
Politecnico di Torino（都灵理工大学）；CENTAI Institute（CENTAI研究所）；Universidade Católica Portuguesa, Católica Medical School, Católica Biomedical Research Centre（葡萄牙天主教大学，天主教医学院，天主教生物医学研究中心）；Binghamton University (State University of New York)（宾厄姆顿大学（纽约州立大学））
