Related papers: Macros and Multiscale Dynamics in Spin Glasses

Slow dynamics in disordered materials prohibits direct simulation of their rich nonequilibrium behavior at large scales. "Patchwork dynamics" is introduced to mimic relaxation over a very broad range of time scales by equilibrating or…

Kinetically constrained spin models are known to exhibit dynamical behavior mimicking that of glass forming systems. They are often understood as coarse-grained models of glass formers, in terms of some "mobility" field. The identity of…

We consider the problem of rational decision making in the presence of nonlinear constraints. By using tools borrowed from spin glass and random matrix theory, we focus on the portfolio optimisation problem. We show that the number of…

Creating low dimensional representations of a high dimensional data set is an important component in many machine learning applications. How to cluster data using their low dimensional embedded space is still a challenging problem in…

In an effort to understand the glass transition, the kinetics of a spin model with frustration but no quenched randomness has been analyzed. The phenomenology of the spin model is remarkably similiar to that of structural glasses. Analysis…

We consider optimization problems for complex systems in which the cost function has a multivalleyed landscape. We introduce a new class of dynamical algorithms which, using a suitable annealing procedure coupled with a balanced…

A new approach to combinatorial optimization based on systematic move-class deflation is proposed. The algorithm combines heuristics of genetic algorithms and simulated annealing, and is mainly entropy-driven. It is tested on two problems…

We report a very detailed relation about the study, by a constrained Monte Carlo dynamic, of a 4D EA spin glass model (J=+/- 1). In particular we concentrate our attention on the behaviour of the system under different bounds imposed in…

Monte Carlo simulations are widely employed to measure the physical properties of glass-forming liquids in thermal equilibrium. Combined with local Monte Carlo moves, the Metropolis algorithm can also be used to simulate the relaxation…

In this work, we theoretically demonstrate that a strong enhancement of the Magnetocaloric Effect is achieved in geometrically frustrated cluster spin-glass systems just above the freezing temperature. We consider a network of clusters…

We investigate the dynamics of spin glasses from the `rheological' point of view, in which aging is suppressed by the action of small, non-conservative forces. The different features can be expressed in terms of the scaling of relaxation…

We describe collective-move Monte Carlo algorithms designed to approximate the overdamped dynamics of self-assembling nanoscale components equipped with strong, short-ranged and anisotropic interactions. Conventional Monte Carlo simulations…

I give a very brief non-technical introduction to the intersection of the fields of spin systems and computational complexity. The focus is on spin glasses and their relationship to NP-complete problems.

An efficient Monte Carlo algorithm for the simulation of spin models with long-range interactions is discussed. Its central feature is that the number of operations required to flip a spin is independent of the number of interactions…

In 1986, Swendsen and Wang proposed a replica Monte Carlo algorithm for spin glasses [Phys. Rev. Lett. 57 (1986) 2607]. Two important ingredients are present, (1) the use of a collection of systems (replicas) at different of temperatures,…

Multi-dimensional density of states provides a useful description of complex frustrated systems. Recent advances in Monte Carlo methods enable efficient calculation of the density of states and related quantities, which renew the interest…

We consider two systems of Ising spins with plaquette interactions. They are simple models of glasses which have dual representations as kinetically constrained systems. These models allow an explicit analysis using the mosaic, or entropic…

To identify emerging microscopic structures in low temperature spin glasses, we study self-sustained clusters (SSC) in spin models defined on sparse random graphs. A message-passing algorithm is developed to determine the probability of…

Despite the extreme simplicity in their definition, spin glasses disclose a wide variety of non-trivial behaviors that are not yet fully understood. In this thesis we try to shed light on some of them, focusing on one hand on the search of…

We review the background of the cluster algorithms in Monte Carlo simulation of statistical physics problems. One of the first such successful algorithm was developed by Swendsen and Wang eight years ago. In contrast to the local…