Related papers: Degree-targeted cascades in modular, degree-hetero…
The threshold model has been widely adopted as a classic model for studying contagion processes on social networks. We consider asymmetric individual interactions in social networks and introduce a persuasion mechanism into the threshold…
Elements of networks interact in many ways, so modeling them with graphs requires multiple types of edges (or network layers). Here we show that such multiplex networks are generically more vulnerable to global cascades than simplex…
For the purpose of propagating information and ideas through a social network, a seeding strategy aims to find a small set of seed users that are able to maximize the spread of the influence, which is termed as influence maximization…
As a widely observable social effect, influence diffusion refers to a process where innovations, trends, awareness, etc. spread across the network via the social impact among individuals. Motivated by such social effect, the concept of…
We develop a methodology for analyzing the percolation phenomena of two mutually coupled (interdependent) networks based on the cavity method of statistical mechanics. In particular, we take into account the influence of degree-degree…
The multiplex network growth literature has been confined to homogeneous growth hitherto, where the number of links that each new incoming node establishes is the same across layers. This paper focuses on heterogeneous growth. We first…
Information spreading is an interesting field in the domain of online social media. In this work, we are investigating how well different seed selection strategies affect the spreading processes simulated using independent cascade model on…
In many complex networked systems, such as online social networks, activity originates at certain nodes and subsequently spreads on the network through influence. In this work, we consider the problem of modeling the spread of influence and…
Adding edges between layers of interconnected networks is an important way to optimize the spreading dynamics. While previous studies mostly focus on the case of adding a single edge, the theoretical optimal strategy for adding multiple…
The dynamics of cascading failures in spatial interdependent networks significantly depend on the interaction range of dependency couplings between layers. In particular, for increasing range of dependency couplings, different types of…
This paper introduces a method to generate hierarchically modular networks with prescribed node degree list by link switching. Unlike many existing network generating models, our method does not use link probabilities to achieve modularity.…
When evolutionary games are contested in structured populations, the degree of each player in the network plays an important role. If they exist, hubs often determine the fate of the population in remarkable ways. Recent research based on…
The diffusion of information, norms, and practices across a social network can be initiated by compelling a small number of seed individuals to adopt first. Strategies proposed in previous work either assume full network information or…
Motivated by the analysis of social networks, we study a model of random networks that has both a given degree distribution and a tunable clustering coefficient. We consider two types of growth processes on these graphs: diffusion and…
Networks of person-person contacts form the substrate along which infectious diseases spread. Most network-based studies of the spread focus on the impact of variations in degree (the number of contacts an individual has). However, other…
Bridging nodes, which connect critical components of a network, play an important role in maintaining structural integrity and facilitating communication within the network, representing indirect yet relevant connections. Epidemic…
In a recent work \cite{LiuJoladSchZia13}, we introduced dynamic networks with preferred degrees and presented simulation and analytic studies of a single, homogeneous system as well as two interacting networks. Here, we extend these studies…
An algorithm for efficiently calculating the expected size of single-seed cascade dynamics on networks is proposed and tested. The expected size is a time-dependent quantity and so enables the identification of nodes who are the most…
We model smart grids as complex interdependent networks, and study targeted attacks on smart grids for the first time. A smart grid consists of two networks: the power network and the communication network, interconnected by edges.…
Burstiness, the tendency of interaction events to be heterogeneously distributed in time, is critical to information diffusion in physical and social systems. However, an analytical framework capturing the effect of burstiness on generic…