Search arXivSearch

arXiv · 2005.05045

A Long-Range Ising Model of a Barabási-Albert Network

Abstract

Networks that have power-law connectivity, commonly referred to as the scale-free networks, are an important class of complex networks. A heterogeneous mean-field approximation has been previously proposed for the Ising model of the Barabási-Albert model of scale-free networks with classical spins on the nodes wherein it was shown that the critical temperature for such a system scales logarithmically with network size. For finite sizes, there is no criticality for such a system and hence no true phase transition in terms of singular behavior. Further, in the thermodynamic limit, the mean-field prediction of an infinite critical temperature for the system may exclude any true phase transition even then. Nevertheless, with an eye on potential applications of the model on biological systems that are generally finite, one may still try to find approximations that describe the relevant observables quantitatively. Here we present an alternative, approximate formulation for the description of the Ising model of a Barabási-Albert Network. Using the classical definition of magnetization, we show that Ising models on a network can be well-approximated by a long-range interacting homogeneous Ising model wherein each node of the network couples to all other spins with a strength determined by the mean degree of the Barabási-Albert Network. In such an effective long-range Ising model of a Barabási-Albert Network, the critical temperature is directly proportional to the number of preferentially attached links added to grow the network. The proposed model describes the magnetization of the majority of the sites with average or smaller than average degree better compared to the heterogeneous mean-field approximation. The long-range Ising model is the only homogeneous description of Barabási-Albert networks that we know of.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeyashree Krishnan, Reza Torabi, Edoardo Di Napoli, Carsten Honerkamp, Andreas Schuppert. 2020-05-07. A Long-Range Ising Model of a Barabási-Albert Network. https://arxiv.org/abs/2005.05045

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

KEEP EXPLORING

Related papers

The critical slowing down in training diffusion models

Computational sampling has been central to the sciences since the mid-20th century. While machine-learning-based approaches have recently enabled major advances, their behavior remains poorly understood, with limited theoretical control over when and why they succeed. Here we provide such insight for diffusion models---a class of generative schemes highly effective in practice---by analyzing their application to the $O(n)$ model of statistical field theory in the Gaussian limit $n \to \infty$. In this analytically tractable setting, we show that training a score model with a one-layer network architecture matching the exact solution exhibits a form of critical slowing down in parameter learning. This slowing down also impacts the generation process, indicating that the well-known difficulties of sampling near criticality persist even for learned generative models. To overcome this bottleneck, we consider the power of architectural depth. We find that using a two-layer architecture drastically reduces the critical slowing down, with the training time scaling logarithmically rather than quadratically with system size. Using a Fourier implementation of the architecture, we further show that this acceleration in training time can be achieved without drastically increasing operational complexity. Taken together, these results demonstrate that diffusion models can overcome the critical slowing down through appropriate architectural design, and establish a controlled framework for understanding and improving learned sampling methods in statistical physics and beyond.

cond-mat.dis-nn

Switching diffusivity selects Pareto tail exponent in random growth with redistribution

Random multiplicative growth with redistribution generates stationary Pareto wealth tails in the Bouchaud-Mézard model, but assumes a fixed multiplicative noise intensity. This is restrictive for physical and financial growth processes, where volatility (diffusivity) is often fluctuating. We replace the constant noise intensity by a switching diffusivity and ask how these fluctuations select the Pareto stationary tail. For a geometric Brownian motion with switching diffusivity, the long-time Gaussian limit holds when the redraw law has finite mean and variance. The asymptotic variance retains a contribution from diffusivity persistence. With redistribution and a general redraw law, the stationary large-wealth problem is characterized by a spectral condition for admissible algebraic modes. For a two-state diffusivity, an exact tail analysis gives a Pareto exponent interpolating between the high-diffusivity slow-refresh limit and the mean-diffusivity fast-refresh Bouchaud-Mézard limit.

cond-mat.dis-nn

Signatures of Nonergodicity in Sparse Random Matrices

The prevalence of sparsity in the Fock space graph of interacting many-body systems motivates an investigation into the spectral statistics of sparse random matrices with on-site disorder. We numerically determine the delocalization-localization transition in the ground state as a function of the sparsity. The short-range energy correlation in the bulk indicates that the Anderson transition at infinite temperature occurs at the critical percolation limit of the sparse graph. By analytically deriving the energy moments and calculating the shifted kurtosis, we show that the critical sparsity threshold matches the Anderson transition. Furthermore, long-range energy correlations in the bulk spectrum reveal a Thouless energy scale, suggesting a broad nonergodic regime within the delocalized phase.

cond-mat.dis-nn