T-6
Goal: Trap model. Captures aging in a simplified single particle description.
Key concepts: gradient descent, rugged landscapes, metastable states, Hessian matrices, random matrix theory, landscape’s complexity.
Langevin, Activation
- Monte Carlo dynamics.Langevin dynamics.
-Arrhenius law, trapping and activation.
-aging
The energy landscape of the REM. Consider the REM discussed in Problems 1. Assume that the configurations are organised in an hypercube of connectivity : each configuration has neighbours, that are obtained flipping one spin of the first configuration.
Problem 6.1: a simple model for aging
The trap model is an abstract model for the dynamics in complex landscapes introduced in [1] . The configuration space is a collection of traps labeled by having random depths/energies (see sketch). The dynamics is a sequence of jumps between the traps: the system spends in a trap an exponentially large time with average (the probability to jump out of the trap in time is .). When the system exits the trap, it jumps into another one randomly chosen among the . The average times are distributed as
where is a parameter. In this exercise, we aim at understanding the main features of this dynamics.
- Aging. Compute the average trapping time (between the various traps) and show that there is a critical value of below which it diverges, signalling a non-ergodic phase (the system needs infinite time to explore the whole configuration space). Consider a dynamics running from time to some later time : compute the typical value of the maximal trapping time encountered in this time interval, assuming that the system has spent time in each visited trap . Show that in the non-ergodic phase . Why is this interpretable as a condensation phenomenon, as the ones discussed in Problems 1? Why is this an indication of aging?
- Correlation functions and weak ergodicity breaking. Assume now that the trap represent a collection of microscopic configurations having self overlap . Assume that the overlap between configurations of different traps is . Justify why the correlation function can be written as
In the non-ergodic regime, one finds:
Why is this, again, an indication of aging? Study the asymptotic behaviour of the correlation function for and . Show that
Problem 6.2: from traps to landscapes
In this exercise, we aim at understanding why the trap model is a good effective model for activated dynamics in glassy landscapes. In particular, we will discuss connections with the landscape structure of two models that we have studied so far: the REM and spherical p-spin model.
- REM: the golf course landscape. In the REM, the smallest energies values among the can be assumed to be distributed as
- REM: trapping times. The results above show that the energy landscape of the REM has a "golf course" structure: configuration with deep energy are isolated, surrounded by configurations of much higher energy (zero energy density). The Arrhenius law states that the time needed for the system to escape from a trap of energy and reach a configuration of zero energy is . This is a trapping time. Given the energy distribution , determine the distribution of trapping times : what is ? What is the critical temperature?
- p-spin: the “trap” picture and the assumptions behind. In Problems 5, we have seen that the energy landscape of the spherical p-spin is characterized by the threshold energy, below which plenty of minima appear. The region below the threshold is explored by activated dynamics. Explain why the tap model corresponds to the following picture for the dynamics: the system is trapped into minima for exponentially large times, and then jumps from minimum to minimum passing through the threshold energy. Do you see any assumption behind the trap description that is not straightforwardly justified in the p-spin case?
Check out: key concepts of this TD
Annealed vs quenched averages, replica trick, fully-connected models, order parameters, the three steps of a replica calculation.
References
- Bouchaud. Weak ergodicity breaking and aging in disordered systems [1]