Search arXivSearch

arXiv · 1509.02338

Ising model in clustered scale-free networks

Abstract

The Ising model in clustered scale-free networks has been studied by Monte Carlo simulations. These networks are characterized by a degree distribution of the form P(k) ~ k^(-gamma) for large k. Clustering is introduced in the networks by inserting triangles, i.e., triads of connected nodes. The transition from a ferromagnetic (FM) to a paramagnetic (PM) phase has been studied as a function of the exponent gamma and the triangle density. For gamma > 3 our results are in line with earlier simulations, and a phase transition appears at a temperature T_c(gamma) in the thermodynamic limit (system size N to infinity). For gamma <= 3, a FM-PM crossover appears at a size-dependent temperature T_co, so that the system remains in a FM state at any finite temperature in the limit N to infinity. Thus, for gamma = 3, T_co scales as ln N, whereas for gamma < 3, we find T_co ~ J N^z, where the exponent z decreases for increasing gamma. Adding motifs (triangles in our case) to the networks causes an increase in the transition (or crossover) temperature for exponent gamma > 3 (or <= 3). For gamma > 3, this increase is due to changes in the mean values < k > and < k^2 >, i.e., the transition is controlled by the degree distribution (nearest neighbor connectivities). For gamma <= 3, however, we find that clustered and unclustered networks with the same size and distribution P(k) have different crossover temperature, i.e., clustering favors FM correlations, thus increasing the temperature T_co. The effect of a degree cutoff k_cut on the asymptotic behavior of T_co is discussed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Carlos P. Herrero. 2015-09-08. Ising model in clustered scale-free networks. https://doi.org/10.1103/physreve.91.052812

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

R-transforms for non-Hermitian matrices: a spherical integral approach

In this paper, we establish a connection between the formalism of $\mathcal{R}$-transforms for non-Hermitian random matrices and the framework of spherical integrals, using the replica method. This connection was previously proved in the Hermitian setting and in the case of bi-invariant random matrices. We show that the $\mathcal{R}$-transforms used in the non-Hermitian context in fact originate from a single scalar function of two variables. This provides a new and transparent way to compute $\mathcal{R}$-transforms, which until now had been known only in restricted cases such as bi-invariant, Hermitian, or elliptic ensembles.

cond-mat.dis-nn

Spectral boundaries of deterministic matrices deformed by rotationally invariant random non-Hermitian ensembles

One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic solutions. In this paper, we illustrate this phenomenon in the context of spectral boundaries (or spectral edges) for deformed random matrices. Specifically, we consider matrices of the form $\mathbf{A} + \mathbf{B}$, where $\mathbf{A}$ is a deterministic $N\times N$ matrix (not necessarily Hermitian) and $\mathbf{B}$ is a rotationally invariant random matrix. In the large-$N$ limit, we show that the complex eigenvalue distribution of $\mathbf{A} + \mathbf{B}$ satisfies remarkably simple boundary equations that depend on the $\mathcal{R}_1$ and $\mathcal{R}_2$ transforms of $\mathbf{B}$. We illustrate our results on several explicit random matrix ensembles and support them with numerical simulations.

cond-mat.dis-nn

Electrical conductivity of crack-template-based transparent conducting films: mean-field approximation, effective-medium theory, and simulation

In this work, crack-template-based transparent conducting films were modeled as networks corresponding to the edges of a two-dimensional Poisson--Voronoi diagram. Two types of networks were considered: the original one, in which the conductance of each edge was inversely proportional to its length, and the effective one, in which all edges had the same conductance obtained from the effective-medium theory. The mean-field approximation was used for analytical evaluation of the electrical conductivity. Direct numerical calculations for the Poisson--Voronoi diagram showed that the mean-field approximation overestimated the effective conductivity of the original network by approximately 13\%, and of the effective network by 79\%. In addition, a honeycomb network with an edge conductance distribution corresponding to the Poisson--Voronoi diagram was studied: for it, the predictions of the effective-medium theory turned out to be more accurate than for the Poisson--Voronoi diagram, which was explained by the greater structural homogeneity of the periodic honeycomb lattice. The results indicate that, when modeling crack-template-based transparent conducting films, the application of the mean-field approximation may lead to significant errors if the resistance of individual conductors is not simply proportional to their length. This possibility is discussed as a motivation for future studies of hierarchical cracks with variable width, which are not directly investigated here.

cond-mat.dis-nn