Related papers: Competing contact processes in the Watts-Strogatz …
We analyze growing networks that are built by enhanced redirection. Nodes are sequentially added and each incoming node attaches to a randomly chosen 'target' node with probability 1-r, or to the parent of the target node with probability…
In this paper, we offer a competing dynamic analysis of the one-dimensional Ising model built on the small-world network (SWN). Adding-type SWNs are investigated in detail using a simplified Hamiltonian of mean-field nature, and the result…
We explore the synchronization behavior in interdependent systems, where the one-dimensional (1D) network (the intranetwork coupling strength $J_{\rm I}$) is ferromagnetically intercoupled (the strength $J$) to the Watts-Strogatz (WS)…
We propose a simple dynamical model that generates networks with power-law degree distributions with the exponent 2 through rewiring only. At each time step, two nodes, i and j, are randomly selected, and one incoming link to i is…
Systems which consist of many localized constituents interacting with each other can be represented by complex networks. Consistently, network science has become highly popular in vast fields focusing on natural, artificial and social…
We study the failure process of fiber bundles on complex networks focusing on the effect of the degree of disorder of fibers' strength on the transition from localized to mean field behaviour. Starting from a regular square lattice we apply…
The structure of a network can significantly influence the properties of the dynamical processes which take place on them. While many studies have been devoted to this influence, much less attention has been devoted to the interplay and…
A framework for studying the behavior of a classically frustrated signed network in the process of random rewiring is developed. We describe jump probabilities for change in frustration and formulate a theoretical estimate in terms of the…
We consider the process of reaching the final state in the coevolving voter model. There is a coevolution of state dynamics, where a node can copy a state from a random neighbor with probabilty $1-p$ and link dynamics, where a node can…
Networks of nanowires are currently under consideration for a wide range of electronic and optoelectronic applications. Nanowire devices are usually made by sequential deposition, which inevitably leads to stacking of the wires on top of…
We study a model for a statistical network formed by interactions between its nodes and links. Each node can be in one of two states (Ising spin up or down) and the node-link interaction facilitates linking between the like nodes. For high…
The famous Watts-Strogatz (WS) small-world network model does not approach the Erd\H{o}s-R\'enyi (ER) random graph model in the limit of total randomization which can lead to confusion and complicates certain analyses. In this paper we…
In this study we have carried out computer simulations of random walks on Watts-Strogatz-type small world networks and measured the mean number of visited sites and the return probabilities. These quantities were found to obey scaling…
The Watts-Strogatz algorithm of transferring the square lattice to a small world network is modified by introducing preferential rewiring constrained by connectivity demand. The evolution of the network is two-step: sequential preferential…
Disease awareness in infection dynamics can be modeled with adaptive contact networks whose rewiring rules reflect the attempt by susceptibles to avoid infectious contacts. Simulations of this type of models show an active phase with…
In two different classes of network models, namely, the Watts Strogatz type and the Euclidean type, subtle changes have been introduced in the randomness. In the Watts Strogatz type network, rewiring has been done in different ways and…
We investigate a nonlinear version of coevolving voter models, in which node states and network structure update as a coupled stochastic dynamical process. Most prior work on coevolving voter models has focused on linear update rules with…
We define a class of growing networks in which new nodes are given a spatial position and are connected to existing nodes with a probability mechanism favoring short distances and high degrees. The competition of preferential attachment and…
Network reconstruction consists in determining the unobserved pairwise couplings between $N$ nodes given only observational data on the resulting behavior that is conditioned on those couplings -- typically a time-series or independent…
We introduce a simple nearest-neighbor spin model with multiple metastable phases, the number and decay pathways of which are explicitly controlled by the parameters of the system. With this model we can construct, for example, a system…