L-3: Difference between revisions

From Disordered Systems Wiki
Jump to navigation Jump to search
Line 29: Line 29:
Z[x_t,t ; x_0, 0] =\int_{x(0)=x_0}^{x(t)=x_t} {\cal D} x \exp\left[- \int_0^t d \tau (\partial_\tau x)^2 +V(x,\tau)\right]
Z[x_t,t ; x_0, 0] =\int_{x(0)=x_0}^{x(t)=x_t} {\cal D} x \exp\left[- \int_0^t d \tau (\partial_\tau x)^2 +V(x,\tau)\right]
</math></center>
</math></center>
The previous equation gives the path integral expression of the propagator quantum particle, evolving in imaginary time. The Hamiltonian of the particle is
The previous equation gives the path integral expression of the propagator for a quantum particle, in the imaginary time. Note the the potential is a white noise and thus a time dependent potential.
 
In the spirit of the Feyman Kac formula we write the time-dependent Hamiltonian of the particle  
<center> <math>
<center> <math>
\hat H= - \frac{d^2}{d x^2} +V(x,\tau)
\hat H= - \frac{d^2}{d x^2} +V(x,\tau)
</math></center>
</math></center>
And the partition function is the solution of the Schrodinger-like equation:
Hhe partition function is the solution of the Schrodinger-like equation:
<center> <math>
<center> <math>
\partial_t Z =-  \hat H Z = \frac{d^2 Z}{d x^2} - V(x,\tau) Z , \quad \text{with}\; Z[x_t,t=0 ; x_0, 0]=\delta(x-x_0)
\partial_t Z =-  \hat H Z = \frac{d^2 Z}{d x^2} - V(x,\tau) Z  
</math></center>
</math></center>
DISCUTERE CON SATYA LEGAMI FEYMAN KAC FORMULA
The initial condition is  <math>  Z[x_t,t=0 ; x_0, 0]=\delta(x-x_0) </math>.
In this equation the noise in multiplicative and not additive as in the previous lecture. However some of the work we did last lecture will be useful today, thank to a miracoul transformation the Cole Hopf transformation.
 
DISCUTERE CON SATYA LEGAMI FEYMAN KAC FORMULA / transfer matrix
 
In this equation the noise is multiplicative and not additive as in the previous lecture. However, all KPZ results can be employed today, thanks to the Cole Hopf transformation.
 
==Dijkstra Algorithm and transfer matrix==
 
== Cole Hopf Transformation==
 
 
== Dictionary of the Mapping==

Revision as of 19:08, 1 January 2024

Goal: This lecture is dedicated to a classical model in disordered systems: the directed polymer in random media. It has been introduced to model vortices in superconductur or domain wall in magnetic film. We will focus here on the algorithms that identify the ground state or compute the free energy at temperature T, as well as, on the Cole-Hopf transformation that map this model on the KPZ equation.

Polymers, interfaces and manifolds in random media

We consider the following potential energy

The first term represents the elasticity of the manifold and the second term is the quenched disorder, due to the impurities. In general, the medium is D-dimensional, the internal coordinate of the manifold is d-dimensional and the height filed is N-dimensional. Hence,the following equations always holds:

In practice, we will study two cases:

  • Directed Polymers (), . Examples are vortices, fronts...
  • Elastic interfaces (), . Examples are domain walls...

Today we restrict to polymers. Note that they are directed because their configuration is uni-valuated.

Directed polymers and Quantum Mechanics

It is useful to re-write the model using the following change of variable

To fix the idea we can consider polymers of length , starting in and ending in . We sum over all possible polymers to compute the partition function at temperature

The previous equation gives the path integral expression of the propagator for a quantum particle, in the imaginary time. Note the the potential is a white noise and thus a time dependent potential.

In the spirit of the Feyman Kac formula we write the time-dependent Hamiltonian of the particle

Hhe partition function is the solution of the Schrodinger-like equation:

The initial condition is .

DISCUTERE CON SATYA LEGAMI FEYMAN KAC FORMULA / transfer matrix

In this equation the noise is multiplicative and not additive as in the previous lecture. However, all KPZ results can be employed today, thanks to the Cole Hopf transformation.

Dijkstra Algorithm and transfer matrix

Cole Hopf Transformation

Dictionary of the Mapping