Related papers: Complex Networks: effect of subtle changes in natu…
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…
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…
We consider a one-dimensional network in which the nodes at Euclidean distance $l$ can have long range connections with a probabilty $P(l) \sim l^{-\delta}$ in addition to nearest neighbour connections. This system has been shown to exhibit…
We consider a version of the Watts cascade model on directed multiplex configuration model networks, and present a detailed analysis of the cascade size, single-seed cascade probability and cascade condition. We then introduce a smaller…
Recently, Watts and Strogatz introduced the so-called small-world networks in order to describe systems which combine simultaneously properties of regular and of random lattices. In this work we study diffusion processes defined on such…
Real-world dynamics running on networks can be characterized in terms of their respective diversity, or heterogeneity of state values. Spatial networks can be understood as networks exhibiting limited small world characteristics. In the…
A computer model is described which is used to assess the dynamical complexity of a class of networks of spiking neurons with small-world properties. Networks are constructed by forming an initially segregated set of highly intra-connected…
Many complex systems can be described in terms of networks of interacting units. Recent studies have shown that a wide class of both natural and artificial nets display a surprisingly widespread feature: the presence of highly heterogeneous…
The combination of the compactness of networks, featuring small diameters, and their complex architectures results in a variety of critical effects dramatically different from those in cooperative systems on lattices. In the last few years,…
Latent Euclidean embedding models a given network by representing each node in a Euclidean space, where the probability of two nodes sharing an edge is a function of the distances between the nodes. This implies that for two nodes to share…
We show that subsets of interacting oscillators may synchronize in different ways within a single network. This diversity of synchronization patterns is promoted by increasing the heterogeneous distribution of coupling weights and/or…
Dynamic systems characterized by diversified evolutions are not only more flexible, but also more resilient to attacks, failures and changing conditions. This article addresses the quantification of the diversity of non-linear transient…
Small-world networks are the focus of recent interest because they appear to circumvent many of the limitations of either random networks or regular lattices as frameworks for the study of interaction networks of complex systems. Here, we…
We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…
Most agent-based models include a social network that describes the structure of interactions within the artificial population. Because of the dramatic impact of this structure on the simulated dynamics, modelers create this network for it…
Real-world networks such as the Internet and WWW have many common traits. Until now, hundreds of models were proposed to characterize these traits for understanding the networks. Because different models used very different mechanisms, it…
We study the evolution of a random weighted network with complex nonlinear dynamics at each node, whose activity may cease as a result of interactions with other nodes. Starting from a knowledge of the micro-level behaviour at each node, we…
We analyze Axelrod's model of social interactions on coevolving complex networks. We introduce four extensions with different mechanisms of edge rewiring. The models are intended to catch two kinds of interactions - preferential attachment,…
Weighted networks capture the structure of complex systems where interaction strength is meaningful. This information is essential to a large number of processes, such as threshold dynamics, where link weights reflect the amount of…
Some features of random networks with excitable nodes that are embeddable in the Euclidean space are not describable in terms of the conventional integrate and fire model (IFM) alone, and some further details should be involved. In the…