Antiferromagnetic Ising model in scale-free networks
نویسندگان
چکیده
منابع مشابه
Antiferromagnetic Ising model in small-world networks.
The antiferromagnetic Ising model in small-world networks generated from two-dimensional regular lattices has been studied. The disorder introduced by long-range connections causes frustration, which gives rise to a spin-glass phase at low temperature. Monte Carlo simulations have been carried out to study the paramagnetic to spin-glass transition, as a function of the rewiring probability p , ...
متن کاملChaotic Repellers in Antiferromagnetic Ising Model
For the first time we present the consideration of the antiferromagnetic Ising model in case of fully developed chaos and obtain the exact connection between this model and chaotic repellers. We describe the chaotic properties of this statistical mechanical system via the invariants characterizing a fractal set and show that in chaotic region it displays phase transition at positive ”temperatur...
متن کاملCritical behavior of the Ising model in annealed scale-free networks.
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 for the finite-size scaling (FSS) near the phase transition, characterized by the cutoff-dependent two-parameter scaling with four distinct scaling regimes, ...
متن کاملExactly scale-free scale-free networks
Many complex natural and physical systems exhibit patterns of interconnection that conform, approximately, to a network structure referred to as scale-free. Preferential attachment is one of many algorithms that have been introduced to model the growth and structure of scale-free networks. With so many different models of scale-free networks it is unclear what properties of scale-free networks ...
متن کاملStructure learning of antiferromagnetic Ising models
In this paper we investigate the computational complexity of learning the graph structure underlying a discrete undirected graphical model from i.i.d. samples. Our first result is an unconditional computational lower bound of (pd/2) for learning general graphical models on p nodes of maximum degree d, for the class of so-called statistical algorithms recently introduced by Feldman et al. [1]. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal B
سال: 2009
ISSN: 1434-6028,1434-6036
DOI: 10.1140/epjb/e2009-00240-2