17,359 research outputs found
Rigorous Inequalities between Length and Time Scales in Glassy Systems
Glassy systems are characterized by an extremely sluggish dynamics without
any simple sign of long range order. It is a debated question whether a correct
description of such phenomenon requires the emergence of a large correlation
length. We prove rigorous bounds between length and time scales implying the
growth of a properly defined length when the relaxation time increases. Our
results are valid in a rather general setting, which covers finite-dimensional
and mean field systems.
As an illustration, we discuss the Glauber (heat bath) dynamics of p-spin
glass models on random regular graphs. We present the first proof that a model
of this type undergoes a purely dynamical phase transition not accompanied by
any thermodynamic singularity.Comment: 24 pages, 3 figures; published versio
Next nearest neighbour Ising models on random graphs
This paper develops results for the next nearest neighbour Ising model on
random graphs. Besides being an essential ingredient in classic models for
frustrated systems, second neighbour interactions interactions arise naturally
in several applications such as the colour diversity problem and graphical
games. We demonstrate ensembles of random graphs, including regular
connectivity graphs, that have a periodic variation of free energy, with either
the ratio of nearest to next nearest couplings, or the mean number of nearest
neighbours. When the coupling ratio is integer paramagnetic phases can be found
at zero temperature. This is shown to be related to the locked or unlocked
nature of the interactions. For anti-ferromagnetic couplings, spin glass phases
are demonstrated at low temperature. The interaction structure is formulated as
a factor graph, the solution on a tree is developed. The replica symmetric and
energetic one-step replica symmetry breaking solution is developed using the
cavity method. We calculate within these frameworks the phase diagram and
demonstrate the existence of dynamical transitions at zero temperature for
cases of anti-ferromagnetic coupling on regular and inhomogeneous random
graphs.Comment: 55 pages, 15 figures, version 2 with minor revisions, to be published
J. Stat. Mec
Spin Glasses on Thin Graphs
In a recent paper we found strong evidence from simulations that the
Isingantiferromagnet on ``thin'' random graphs - Feynman diagrams - displayed
amean-field spin glass transition. The intrinsic interest of considering such
random graphs is that they give mean field results without long range
interactions or the drawbacks, arising from boundary problems, of the Bethe
lattice. In this paper we reprise the saddle point calculations for the Ising
and Potts ferromagnet, antiferromagnet and spin glass on Feynman diagrams. We
use standard results from bifurcation theory that enable us to treat an
arbitrary number of replicas and any quenched bond distribution. We note the
agreement between the ferromagnetic and spin glass transition temperatures thus
calculated and those derived by analogy with the Bethe lattice, or in previous
replica calculations. We then investigate numerically spin glasses with a plus
or minus J bond distribution for the Ising and Q=3,4,10,50 state Potts models,
paying particular attention to the independence of the spin glass transition
from the fraction of positive and negative bonds in the Ising case and the
qualitative form of the overlap distribution in all the models. The parallels
with infinite range spin glass models in both the analytical calculations and
simulations are pointed out.Comment: 13 pages of LaTex and 11 postscript figures bundled together with
uufiles. Discussion of first order transitions for three or more replicas
included and similarity to Ising replica magnet pointed out. Some additional
reference
AKLT Models with Quantum Spin Glass Ground States
We study AKLT models on locally tree-like lattices of fixed connectivity and
find that they exhibit a variety of ground states depending upon the spin,
coordination and global (graph) topology. We find a) quantum paramagnetic or
valence bond solid ground states, b) critical and ordered N\'eel states on
bipartite infinite Cayley trees and c) critical and ordered quantum vector spin
glass states on random graphs of fixed connectivity. We argue, in consonance
with a previous analysis, that all phases are characterized by gaps to local
excitations. The spin glass states we report arise from random long ranged
loops which frustrate N\'eel ordering despite the lack of randomness in the
coupling strengths.Comment: 10 pages, 1 figur
Critical phenomena in complex networks
The combination of the compactness of networks, featuring small diameters,
and their complex architectures results in a variety of critical effects
dramatically different from those in cooperative systems on lattices. In the
last few years, researchers have made important steps toward understanding the
qualitatively new critical phenomena in complex networks. We review the
results, concepts, and methods of this rapidly developing field. Here we mostly
consider two closely related classes of these critical phenomena, namely
structural phase transitions in the network architectures and transitions in
cooperative models on networks as substrates. We also discuss systems where a
network and interacting agents on it influence each other. We overview a wide
range of critical phenomena in equilibrium and growing networks including the
birth of the giant connected component, percolation, k-core percolation,
phenomena near epidemic thresholds, condensation transitions, critical
phenomena in spin models placed on networks, synchronization, and
self-organized criticality effects in interacting systems on networks. We also
discuss strong finite size effects in these systems and highlight open problems
and perspectives.Comment: Review article, 79 pages, 43 figures, 1 table, 508 references,
extende
Spin Models on Thin Graphs
We discuss the utility of analytical and numerical investigation of spin
models, in particular spin glasses, on ordinary ``thin'' random graphs (in
effect Feynman diagrams) using methods borrowed from the ``fat'' graphs of two
dimensional gravity. We highlight the similarity with Bethe lattice
calculations and the advantages of the thin graph approach both analytically
and numerically for investigating mean field results.Comment: Contribution to Parallel Session at Lattice95, 4 pages. Dodgy
compressed ps file replaced with uuencoded LaTex original + ps figure
- …