T-6: Difference between revisions
No edit summary |
|||
Line 18: | Line 18: | ||
=== Problem 6.1: the trap model, and its foundations === | === Problem 6.1: the trap model, and its foundations === | ||
The trap model is an effective model for the dynamics in complex landscapes. The configuration space is described as a collection of <math> M=2^N </math> traps labeled by <math> \alpha </math> having random depths/energies, see sketch. The dynamics is a sequence of jumps between the traps: the system spends in a trap <math> \alpha </math> an exponentially large time with average <math> \tau_\alpha</math> (the probability to jump out of the trap in time <math> [t, t+dt]</math> is <math> dt/\tau_\alpha </math>.). The average times are distributed as | The trap model is an abstract, effective model for the dynamics in complex landscapes. The configuration space is described as a collection of <math> M=2^N </math> traps labeled by <math> \alpha </math> having random depths/energies, see sketch. The dynamics is a sequence of jumps between the traps: the system spends in a trap <math> \alpha </math> an exponentially large time with average <math> \tau_\alpha</math> (the probability to jump out of the trap in time <math> [t, t+dt]</math> is <math> dt/\tau_\alpha </math>.). The average times are distributed as | ||
<center><math> P_m(\tau)= \frac{m \tau_0^m}{\tau^{1+m}} </math></center> | <center><math> P_m(\tau)= \frac{m \tau_0^m}{\tau^{1+m}} </math></center> | ||
where <math> m </math> is a parameter. When the system exits the trap, it jumps into another one randomly chosen among the <math> M=2^N </math>. In this exercise, we aim at understanding the main features of this dynamics and at connecting it to models discussed before, like the REM and the <math> p-</math>spin. <br> | where <math> m </math> is a parameter. When the system exits the trap, it jumps into another one randomly chosen among the <math> M=2^N </math>. In this exercise, we aim at understanding the main features of this dynamics and at connecting it to models discussed before, like the REM and the <math> p-</math>spin. <br> | ||
Revision as of 13:04, 12 January 2024
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: the trap model, and its foundations
The trap model is an abstract, effective model for the dynamics in complex landscapes. The configuration space is described as 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 .). The average times are distributed as
where is a parameter. When the system exits the trap, it jumps into another one randomly chosen among the . In this exercise, we aim at understanding the main features of this dynamics and at connecting it to models discussed before, like the REM and the spin.
- Aging. Compute the average trapping time and show that there is a critical value of below which the average trapping time diverges, and therefore the system needs infinite time to explore the whole configuration space.. Consider a trap-like dynamics from to some later time . Compute the typical value of the maximal trapping time encountered in this time interval, an show that below the critical temperature . Why is this interpretable as a condensation phenomenon, as the ones discussed in Problems 1? Why is this an indication of aging?
- Correlation functions. Assume now that the trap represent a coarse grained version of the energy landscape. A state with self-overlap . Justify why the correlation function can be written as. For one finds this. Consider the
- REM: golf course energy landscape. The smallest energies values among the , those with energy density , can be assumed to be distributed as
where is a normalisation factor. Justify the form of this distribution (Hint: recall the discussion on extreme value statistics in Lecture 1!). Consider now one of these deep configurations of very small energy, which we will call traps : what is the minimal energy density among the neighbouring configurations of the trap? Does it depend on the entry of the trap itself? Why is this consistent with the results on the entropy of the REM that we computed in Problem 1.1? - 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 . We call this a trapping time . Given the energy distribution , determine the distribution of trapping times . Do you recognise this temperature?
- p-spin: the “trap” picture of long time dynamics.
the system has spent almost all the time up to in only one trap, the deepest one.
the age of the system is also the typical timescale for its evolution