TBan-II

From Disordered Systems Wiki
Revision as of 20:26, 30 August 2025 by Rosso (talk | contribs) (Created page with "==Dijkstra Algorithm and transfer matrix== thumb|left|Sketch of the discrete Directed Polymer model. At each time the polymer grows either one step left either one step right. A random energy <math> V(\tau,x)</math> is associated at each node and the total energy is simply <math> E[x(\tau)] =\sum_{\tau=0}^t V(\tau,x)</math>. We introduce a lattice model for the directed polymer (see figure). In a companion notebook we provide the implementa...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Dijkstra Algorithm and transfer matrix

Sketch of the discrete Directed Polymer model. At each time the polymer grows either one step left either one step right. A random energy V(τ,x) is associated at each node and the total energy is simply E[x(τ)]=τ=0tV(τ,x).


We introduce a lattice model for the directed polymer (see figure). In a companion notebook we provide the implementation of the powerful Dijkstra algorithm.

Dijkstra allows to identify the minimal energy among the exponential number of configurations x(τ)

Emin=minx(τ)E[x(τ)].

We are also interested in the ground state configuration xmin(τ). For both quantities we expect scale invariance with two exponents θ,ζ for the energy and for the roughness

Emin=ct+btθχ,xmin(t/2))atζχ~

Universal exponents: Both θ,ζ are Independent of the lattice, the disorder distribution, the elastic constants, or the boudanry conditions. Note that ω=θ, while for an interface ω=dθ.

Non-universal constants: c,b,a are of order 1 and depend on the lattice, the disorder distribution, the elastic constants... However c is independent on the boudanry conditions!

Universal distributions: χ,χ~ are instead universal, but depends on the boundary condtions. Starting from 2000 a magic connection has been revealed between this model and the smallest eigenvalues of random matrices. In particular I discuss two different boundary conditions:

  • Droplet: x(τ=0)=x(τ=t)=0. In this case, up to rescaling, χ is distributed as the smallest eigenvalue of a GUE random matrix (Tracy Widom distribution F2(χ))
  • Flat: x(τ=0)=0 while the other end x(τ=t) is free. In this case, up to rescaling, χ is distributed as the smallest eigenvalue of a GOE random matrix (Tracy Widom distribution F1(χ))

Entropy and scaling relation

It is useful to compute the entropy

Entropy=ln(ttx2)tln2x2t+O(x4)

From which one could guess from dimensional analysis

θ=2ζ1

We will see that this relation is actually exact.