相关论文: The Routing of Complex Contagion in Kleinberg's Sm…

A classic experiment by Milgram shows that individuals can route messages along short paths in social networks, given only simple categorical information about recipients (such as "he is a prominent lawyer in Boston" or "she is a Freshman…

Time plays an essential role in the diffusion of information, influence and disease over networks. In many cases we only observe when a node copies information, makes a decision or becomes infected -- but the connectivity, transmission…

The contagion threshold for diffusion of innovations is defined and calculated in finite graphs (two-dimensional regular lattices, regular random networks (RRNs), and two kinds of scale-free networks (SFNs)) with and without the bilingual…

Small-world networks by Watts and Strogatz are a class of networks that are highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. These characteristics result in networks with unique…

Small-world networks---complex networks characterized by a combination of high clustering and short path lengths---are widely studied using the paradigmatic model of Watts and Strogatz (WS). Although the WS model is already quite minimal…

Contact tracing can be thought of as a race between two processes: an infection process and a tracing process. In this paper, we study a simple model of infection spreading on a tree, and a tracer who stabilizes one node at a time. We focus…

In a randomized study, leveraging covariates related to the outcome (e.g. disease status) may produce less variable estimates of the effect of exposure. For contagion processes operating on a contact network, transmission can only occur…

Understanding cascading processes on complex network topologies is paramount for modelling how diseases, information, fake news and other media spread. In this paper, we extend the multi-type branching process method developed in Keating et…

We consider the target set selection problem. In this problem, a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least $k$ active neighbors ($k$ is identical for all vertices of…

One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper investigates how big the failure probability can be, before the…

Human social networks are inherently multiplex, comprising overlapping layers of relationships. Different layers may have distinct structural properties and interpersonal dynamics, but also may interact to form complex interdependent…

The spread of infectious diseases, rumors, fashions, innovations are complex contagion processes, embedded both in networked and spatial contexts. Here we investigate the pattern dynamics of a complex contagion, where two agents, say $A$…

One of the key features of small-worlds is the ability to route messages with few hops only using local knowledge of the topology. In 2000, Kleinberg proposed a model based on an augmented grid that asymptotically exhibits such property. In…

The dynamics of diffusion in complex networks are widely studied to understand how entities, such as information, diseases, or behaviors, spread in an interconnected environment. Complex networks often present community structure, and tools…

We live in a modern world supported by large, complex networks. Examples range from financial markets to communication and transportation systems. In many realistic situations the flow of physical quantities in the network, as characterized…

We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…

Routing strategies under the aegis of dynamic traffic assignment have been proposed in the literature to optimize system performance. However, challenges have persisted in their deployment ability and effectiveness due to inherent strong…

The investigation of dynamical processes on networks has been one focus for the study of contagion processes. It has been demonstrated that contagions can be used to obtain information about the embedding of nodes in a Euclidean space.…

Since the publication of 'Complex Contagions and the Weakness of Long Ties' in 2007, complex contagions have been studied across an enormous variety of social domains. In reviewing this decade of research, we discuss recent advancements in…

Our ability to uncover complex network structure and dynamics from data is fundamental to understanding and controlling collective dynamics in complex systems. Despite recent progress in this area, reconstructing networks with stochastic…