Ising model in clustered scale-free networks

Network science: Ising states of matter

Network science provides very powerful tools for extracting information from interacting data. Although recently the unsupervised detection of phases of matter using machine learning has raised significant interest, the full prediction power of network science has not yet been systematically explored in this context. Here we fill this gap by providing an in-depth statistical, combinatorial, geometrical, and topological characterization of 2D Ising snapshot networks (IsingNets) extracted from Monte Carlo simulations of the 2D Ising model at different temperatures, going across the phase transition. Our analysis reveals the complex organization properties of IsingNets in both the ferromagnetic and paramagnetic phases and demonstrates the significant deviations of the IsingNets with respect to randomized null models. In particular percolation properties of the IsingNets reflect the existence of the symmetry between configurations with opposite magnetization below the critical temperature and the very compact nature of the two emerging giant clusters revealed by our persistent homology analysis of the IsingNets. Moreover, the IsingNets display a very broad degree distribution and significant degree-degree correlations and weight-degree correlations demonstrating that they encode relevant information present in the configuration space of the 2D Ising model. The geometrical organization of the critical IsingNets is reflected in their spectral properties deviating from the one of the null model. This work reveals the important insights that network science can bring to the characterization of phases of matter. The set of tools described hereby can be applied as well to numerical and experimental data.

Self-avoiding walks and connective constants in clustered scale-free networks

Various types of walks on complex networks have been used in recent years to model search and navigation in several kinds of systems, with particular emphasis on random walks. This gives valuable information on network properties, but self-avoiding walks (SAWs) may be more suitable than unrestricted random walks to study long-distance characteristics of complex systems. Here we study SAWs in clustered scale-free networks, characterized by a degree distribution of the form P(k)∼k^{-γ} for large k. Clustering is introduced in these networks by inserting three-node loops (triangles). The long-distance behavior of SAWs gives us information on asymptotic characteristics of such networks. The number of self-avoiding walks, a_{n}, has been obtained by direct enumeration, allowing us to determine the connective constant μ of these networks as the large-n limit of the ratio a_{n}/a_{n-1}. An analytical approach is presented to account for the results derived from walk enumeration, and both methods give results agreeing with each other. In general, the average number of SAWs a_{n} is larger for clustered networks than for unclustered ones with the same degree distribution. The asymptotic limit of the connective constant for large system size N depends on the exponent γ of the degree distribution: For γ>3, μ converges to a finite value as N→∞; for γ=3, the size-dependent μ_{N} diverges as lnN, and for γ<3 we have μ_{N}∼N^{(3-γ)/2}.

Ising Ferromagnets on Proximity Graphs with Varying Disorder of the Node Placement

We perform Monte Carlo simulations to determine the critical temperatures of Ising Ferromagnets (IFM) on different types of two-dimensional proximity graphs, in which the distribution of their underlying node sets has been changed systematically by means of a parameter σ. This allows us to interpolate between regular grids and proximity graphs based on complete random placement of nodes. Each edge of the planar proximity graphs carries a weighted ferromagnetic coupling. The coupling strengths are determined via the Euclidean distances between coupled spins. The simulations are carried out on graphs with N = 16² to N = 128² nodes utilising the Wolff cluster algorithm and parallel tempering method in a wide temperature range around the critical point to measure the Binder cumulant in order to obtain the critical temperature for different values of σ. Interestingly, the critical temperatures depend partially non-monotonously on the disorder parameter σ, corresponding to a non-monotonous change of the graph structure. For completeness, we further verify using finite-size scaling methods that the IFM on proximity graphs is for all values of the disorder in the same universality class as the IFM on the two-dimensional square lattice.

Kinetic Ising models with various single-spin-flip dynamics on quenched and annealed random regular graphs

We investigate a kinetic Ising model with several single-spin-flip dynamics (including Metropolis and heat bath) on quenched and annealed random regular graphs. As expected, on the quenched structures all proposed algorithms reproduce the same results since the conditions for the detailed balance and the Boltzmann distribution in an equilibrium are satisfied. However, on the annealed graphs the situation is far less clear-the network annealing disturbs the equilibrium moving the system away from it. Consequently, distinct dynamics lead to different steady states. We show that some algorithms are more resistant to the annealed disorder, which causes only small quantitative changes in the model behavior. On the other hand, there are dynamics for which the influence of annealing on the system is significant, and qualitative changes arise like switching the type of phase transition from a continuous to a discontinuous one. We try to identify features of the proposed dynamics which are responsible for the above phenomenon.

Center of mass in complex networks

Network dynamics is always a big challenge in nonlinear dynamics. Although great advancements have been made in various types of complex systems, an universal theoretical framework is required. In this paper, we introduce the concept of center of ‘mass’ of complex networks, where ‘mass’ stands for node importance or centrality in contrast to that of particle systems, and further prove that the phase transition and evolutionary state of the system can be characterized by the activity of center of ‘mass’. The steady states of several complex networks (gene regulatory networks and epidemic spreading systems) are then studied by analytically calculating the decoupled equation of the dynamic activity of center of ‘mass’, which is derived from the dynamic equation of the complex networks. The limitations of this method are also pointed out, such as the dynamical problems that related with the relative activities among components, and those systems that consist of oscillatory or chaotic motions.

Tweaking synchronization by connectivity modifications

Natural and man-made networks often possess locally treelike substructures. Taking such tree networks as our starting point, we show how the addition of links changes the synchronization properties of the network. We focus on two different methods of link addition. The first method adds single links that create cycles of a well-defined length. Following a topological approach, we introduce cycles of varying length and analyze how this feature, as well as the position in the network, alters the synchronous behavior. We show that in particular short cycles can lead to a maximum change of the Laplacian's eigenvalue spectrum, dictating the synchronization properties of such networks. The second method connects a certain proportion of the initially unconnected nodes. We simulate dynamical systems on these network topologies, with the nodes' local dynamics being either discrete or continuous. Here our main result is that a certain number of additional links, with the relative position in the network being crucial, can be beneficial to ensure stable synchronization.