Related papers: Active-absorbing phase transition and small world …
We investigate the critical properties of the Ising model in two dimensions on {\it directed} small-world lattice with quenched connectivity disorder. The disordered system is simulated by applying the Monte Carlo update heat bath…
We propose a growing model which interpolates between one-dimensional regular lattice and small-world networks. The model undergoes an interesting phase transition from large to small world. We investigate the structural properties by both…
We study the phase transition of the Ising model in networks with core-periphery structures. By Monte Carlo simulations, we show that prior to the order-disorder phase transition the system organizes into an inhomogeneous intermediate phase…
We study the critical behavior of the Ising model in annealed scale-free (SF) networks of finite system size with forced upper cutoff in degree. By mapping the model onto the weighted fully connected Ising model, we derive analytic results…
We study the collective behavior of an Ising system on a small-world network with the interaction $J(r) \propto r^{-\alpha}$, where $r$ represents the Euclidean distance between two nodes. In the case of $\alpha = 0$ corresponding to the…
The Ising model with ferromagnetic couplings on the Hanoi networks is analyzed with an exact renormalization group. In particular, the fixed-points are determined and the renormalization-group flow for certain initial conditions is…
We have obtained exact results for the Ising model on a hierarchical lattice with a scale-free degree distribution, high clustering coefficient, and small-world behavior. By varying the probability p of long-range bonds, the entire spectrum…
We study numerically the coarsening dynamics of the Ising model on a regular lattice with random bonds and on deterministic fractal substrates. We propose a unifying interpretation of the phase-ordering processes based on two classes of…
The small-world property in the context of complex networks implies structural benefits to the processes taking place within a network, such as optimal information transmission and robustness. In this paper, we study a model network of…
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…
Binary mixtures growing on small-world networks under far-from-equilibrium conditions are studied by means of extensive Monte Carlo simulations. For any positive value of the shortcut fraction of the network ($p>0$), the system undergoes a…
We analyse biased ensembles of trajectories for the random-field Ising model on a fully-connected lattice, which is described exactly by mean-field theory. By coupling the activity of the system to a dynamical biasing field, we find a range…
We demonstrate that two toric code layers on the square lattice coupled by an Ising interaction display two distinct phases with intrinsic topological order. The second-order quantum phase transition between the weakly-coupled…
We examine the global organization of growing networks in which a new vertex is attached to already existing ones with a probability depending on their age. We find that the network is infinite- or finite-dimensional depending on whether…
We perform simulations of random Ising models defined over small-world networks and we check the validity and the level of approximation of a recently proposed effective field theory. Simulations confirm a rich scenario with the presence of…
The small-world property is known to have a profound effect on the navigation efficiency of complex networks [J. M. Kleinberg, Nature 406, 845 (2000)]. Accordingly, the proper addition of shortcuts to a regular substrate can lead to the…
We explore the cooperative behaviour and phase transitions of interacting networks by studying a simplified model consisting of Ising spins placed on the nodes of two coupled Erd\"os-R\'enyi random graphs. We derive analytical expressions…
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…
We study the dynamics of the processes in the small-world networks with a power-law degree distribution where every node is considered to be in one of the two available statuses. We present an algorithm for generation of such network and…
Using a simulated annealing, we examine a bipartitioning of small worlds obtained by adding a fraction of randomly chosen links to a one-dimensional chain or a square lattice. Models defined on small worlds typically exhibit a mean-field…