Related papers: On metastable configurations of small-world networ…
We calculate equilibrium solutions for Ising spin models on `small world' lattices, which are constructed by super-imposing random and sparse Poissonian graphs with finite average connectivity c onto a one-dimensional ring. The nearest…
We study the thermodynamic properties of spin systems on small-world hypergraphs, obtained by superimposing sparse Poisson random graphs with p-spin interactions onto a one-dimensional Ising chain with nearest-neighbor interactions. We use…
Small-world networks provide an interesting framework for studying the interplay between regular and random graphs, where links are located in a regular and random way, respectively. On one hand, the random links make the model to obey some…
One-flip stable configurations of an Ising-model on a random graph with fluctuating connectivity are examined. In order to perform the quenched average of the number of stable configurations we introduce a global order-parameter function…
Activated transitions have rates that are often exponentially small in system size. Extracting the associated activation barriers is challenging in practice, especially in the deeply metastable regimes and in the presence of disorder. Here,…
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 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 Ising model in small-world networks generated from two- and three-dimensional regular lattices has been studied. Monte Carlo simulations were carried out to characterize the ferromagnetic transition appearing in these systems. In the…
We study the small-world networks recently introduced by Watts and Strogatz [Nature {\bf 393}, 440 (1998)], using analytical as well as numerical tools. We characterize the geometrical properties resulting from the coexistence of a local…
We investigate the stochastic resonance phenomena in the field-driven Ising model on small-world networks. The response of the magnetization to an oscillating magnetic field is examined by means of Monte Carlo dynamic simulations, with the…
We study tensor network states defined on an underlying graph which is sparsely connected. Generic sparse graphs are expander graphs with a high probability, and one can represent volume law entangled states efficiently with only polynomial…
We consider the problem of learning the structure of ferromagnetic Ising models Markov on sparse Erdos-Renyi random graph. We propose simple local algorithms and analyze their performance in the regime of correlation decay. We prove that an…
The properties of the ground state of the simplest frustrated system, the dilute Ising chain in a magnetic field, are rigorously investigated over the entire range of concentrations of charged non-magnetic impurities. Analytical methods are…
Understanding the structural complexity and predictability of complex networks is a central challenge in network science. Although recent studies have revealed a relationship between compression-based entropy and link prediction…
Empirical networks are often globally sparse, with a small average number of connections per node, when compared to the total size of the network. However, this sparsity tends not to be homogeneous, and networks can also be locally dense,…
A transfer matrix scaling technique is developed for randomly diluted systems, and applied to the site-diluted Ising model on a square lattice in two dimensions. For each allowed disorder configuration between two adjacent columns, the…
We introduce an evolving network model in which a new node attaches to a randomly selected target node and also to each of its neighbors with probability $p$. The resulting network is sparse for $p<\frac{1}{2}$ and dense (average degree…
In the framework of time series analysis with recurrence networks, we introduce a self-adaptive method that determines the elusive recurrence threshold and identifies metastable states in complex real-world time series. As initial step, we…
In this note we study metastability phenomena for a class of long-range Ising models in one-dimension. We prove that, under suitable general conditions, the configuration -1 is the only metastable state and we estimate the mean exit time.…
We calculate the mean number of metastable states of an Ising ferromagnet on random thin graphs of fixed connectivity c. We find, as for mean field spin glasses that this mean increases exponentially with the number of sites, and is the…