A Brief Introduction To Anderson Localization: I E E He E I
A Brief Introduction To Anderson Localization: I E E He E I
The probability that the particle returns to the origin A. Tight-binding Hamiltonian
after 2n steps is:
1
2n
1 The original model is tight-binding model in the lattice
P (x2n = 0) = 2n ∼√ (4) system, which we would also use here in this paper.
2 n πn
Define
P∞the indicator random variable Xn = 1 if xn = 0. 1. Spatial discretization
X = i=1 Xi counts the total number of returns. Then:
∞ ∞ ∞
X X 1 X 1
hXi = hXi i = P (x2i = 0) ∼ √ √ = ∞,
π i=1 i 1 2 X
i=1 i=1 (− ∇ + Vk (r − rn ))Ψ(r) = EΨ(r) (10)
(5) 2m
k
which diverges.
The expected number of returns hXi is related to the where rk is the position of k th atom, and the potential
probability of return. Denote ρ as the probability that is the superposition of each atom’s central potential.
the particle ever returns to the origin, and ρk as the prob- In the tight-binding approximation, the electron wave-
ability that the particle returns to the origin exactly k function is a linear combination of orbitals of adjacent
times. We have: atoms.
ρk = ρk (1 − ρ) (6) X
Ψ((r)) = φj χj (r − rn ) (11)
We have:
ρ where χj (r − rj ) denotes the orbital of the j th atom,
hXi = (7) and φn is corresponding amplitude. Therefore, this
1−ρ
A brief introduction to Anderson Localization 3
This leads to the recursion relations as follows: Here n is the label of a site in the lattice of disorder
and d is the width between neighboring sites:
E − n 11 Vn−1,n 11
Pn11 = Pn−1 − P
Vn,n+1 Vn,n+1 n−2
Pn21 = Pn−1
11
(30)
E − n 12 Vn−1,n 12
Pn12 = Pn−1 − P
Vn,n+1 Vn,n+1 n−2
Pn22 = Pn−1
12
FIG. 2: Plane waves outside the lattice
And if only diagonal disorders are considered, the
transfer matrix would just be
E−
n
−1
an = Aeikdn + Be−ikdn −∞ < n ≤ 1
pn = V (31) ikdn −ikdn
(32)
1 0 an = Ce + De n≥N
A brief introduction to Anderson Localization 5
From the wavefunctions above, the relation between E using the elements of PN . And the expectation value of ρ
and k can also be determined as E = 2V0 cos(kd), which (also the iterative relations for FN , FN −1 and fN , fN −1 )
comes from dispersion in 1D lattice with no disorder. can be derived from the recursion relations by squaring
Next, we relate two boundaries of the random lattice and taking the expactation values of Equation 30. Defin-
using the matrix T and express the resistivity ρ using the ing Fn = h(PN11 )2 i and fn = h(PN12 )2 i would give hρi a
matrix elements: neat look:
Define T :
1 1
B D hρi = [FN + FN −1 + fN + fN −1 ] − (40)
T = (33)
A C 4 2
Scattering matrix (S-matrix), which also relates two The relation yielded for FN and FN −1 (Similar for fN
boundaries of the random lattice and thus looks pretty and fN −1 ) is written as
similar to the transfer matrix T , would help us build the 2 1
h ih V 2 i hV 2 ih V12 i
FN FN −1
relationship between T and ρ, where r, t and r̄, t̄ respec- = (41)
FN −1 1 0 FN −2
tively give the reflected and transmitted amplitudes for
waves incident from the left and right. 2 1
h ih V 2 i hV 2 ih V12 i
Let R = . We would use its
1 0
eigenvalues and corresponding eigen vectors, as well as
r t̄
S= (34) the boundary conditions to calculate the expressions of
t r̄
Fn , Fn−1 in the expectation values of 2 and V 2 together
with the eigenvalues of R.
The properties of the eigenvalues of R are the key for
A B
S = (35) further derivation:
D C
r
Our reflection and transmission rate can be expressed 1 2 1 1 1 1
λ± = h ih 2 i ± ( h2 ih 2 i + hV 2 ih 2 i) (42)
using the elements of S-matrices: R = |r|2 and T = |t|2 . 2 V 2 V V
Relating T and S we have: The acuatual expression for the expectation value of ρ
T12 is as following. But we do not have to pay much atten-
r = S11 =− tion to its details since we only want to research on its
T11
exponentially growing behavior when N → +∞:
1
t = S21 = (36)
T11 h2 i
1
R hρi = 1 + 2 (λN N
+ − λ− )
⇒ρ = ∗
= (−T12 )(−T12 ) = |T12 |2 4(λ+ − λ− ) V0
T 2
hV i
2 1 1 N −1 −1
+ + V 0 h i + h 2
ih i · (λ+ − λN
− )
To know how the boundaries relate to the sites inside V02 V2 V2
the random lattice, we are supposed to find the relation- 1
1
N −2 −2
ship between T and PN . In the following +hV 2 ih 2 i · (λ+ − λN ) −
ikN −ikdequations
we V −
2
e d 0 e eikd (43)
note θ as and Λ as :
0 e−ikN d 1 1 According to Schwartz Inequality of expectationvalues:
−ikd ikd −ikN d
aN +1 e e e 0 D 1
= E(X 2 )E(Y 2 ) ≥ (E(XY ))2 ⇒ hV 2 ih i ≥ 1 (44)
aN 1 1 0 eikN d C V2
(37)
−1 D Together with the condition that h2 i > 0, we have:
= Λθ
C
λ+ > 1, |λ− | < λ+ (45)
Similarly, we can also derive the relation between a1 , a0
and A, B Therefore, when N → +∞:
−ikd ikd
a1 e e B B hρi ∝ λN N ln λ+
= =Λ (38) + =e (46)
a0 1 1 A A
Recalling Equations 33, 37 and 38, we can get Since λ+ > 1, hρi grows exponentially with N as
N → +∞, leading to the localization of wave, no
T = θΛ−1 PN Λ (39) matter how big or tiny the randomness is.
As for the situation of diagonal disorders only,
Setting E = 0 here for simplicity and convinience, since hV 2 ih V12 i = 1. Still we have the same properties for
we have known that ρ is just T12 , ρ can be now expressed the eigenvalues, which lead to localization.
A brief introduction to Anderson Localization 6
a1 1 −g ... 0 −g a1
a2 −g 2 ... 0 0 a2
E ... = ... ... ... ... ... ... (47)
a
L−1
0 0 ...
L−1 −g aL−1
aL −g 0 ... −g L aL
2. Transfer matrix
FIG. 11: RW: naive pertubation expansion for the resolvent vetween a and b; SAW: Self-avoid random walk representation
using renormalized pertubation theory; DP: Forward approximation merely considering shortest path [2]
B. Forward Approximation
C. Numerci results of Higher dimension Apart from the eigenstates, the time-evolution of the
wavepacket can also be calculated.
1. 2D lattice eigenstates