Related papers: Critical behavior of the contact process on small-…
We investigate two competing contact processes on a set of Watts--Strogatz networks with the clustering coefficient tuned by rewiring. The base for network construction is one-dimensional chain of $N$ sites, where each site $i$ is directly…
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…
We analyze critical phenomena on networks generated as the union of hidden variables models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small-worlds similar to those a` la Watts and…
We study the XY-rotors model on small networks whose number of links scales with the system size $N_{links}\sim N^{\gamma}$, where $1\le\gamma\le2$. We first focus on regular one dimensional rings in the microcanonical ensemble. For…
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…
Quantitative descriptions of network structure in big data can provide fundamental insights into the function of interconnected complex systems. Small-world structure, commonly diagnosed by high local clustering yet short average path…
In this paper we study the small-world network model of Watts and Strogatz, which mimics some aspects of the structure of networks of social interactions. We argue that there is one non-trivial length-scale in the model, analogous to the…
We investigate two homogeneous networks: the Watts-Strogatz network and the random Erdos-Renyi network, the latter with tunable clustering coefficient $C$. The network is an area of two competing contact processes, where nodes can be in two…
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…
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 study a triplet majority-rule opinion-dynamics model with collective reversal on quenched networks. Interactions occur on local triplets composed of one agent and two of its neighbors, while collective reversal acts only on unanimous…
Inspired by dengue and yellow fever epidemics, we investigated the contact process (CP) in a multiscale network constituted by one-dimensional chains connected through a Barab\'asi-Albert scale-free network. In addition to the CP dynamics…
The contact process and the slightly different susceptible-infected-susceptible model are studied on long-range connected networks in the presence of random transition rates by means of a strong disorder renormalization group method and…
Recent renormalization group results predict non self averaging behaviour at criticality for relevant disorder. However, we find strong self averaging(SA) behaviour in the critical region of a quenched Ising model on an ensemble of…
Most real-world networks are endowed with the small-world property, by means of which the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. The evidence sparkled a wealth of studies…
We present an exact solution of percolation in a generalized class of Watts-Strogatz graphs defined on a 1-dimensional underlying lattice. We find a non-classical critical point in the limit of the number of long-range bonds in the system…
In this paper, we study detection and fast reconstruction of the celebrated Watts-Strogatz (WS) small-world random graph model \citep{watts1998collective} which aims to describe real-world complex networks that exhibit both high clustering…
Small-world networks, known for high local clustering and short path lengths, are a fundamental structure in many real-world systems, including social, biological, and technological networks. We apply the theory of (marked) local…
We study the Ising model in a hierarchical small-world network by renormalization group analysis, and find a phase transition between an ordered phase and a critical phase, which is driven by the coupling strength of the shortcut edges.…
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…