Percolation
-
1
Percolation on the Bethe lattice
An exactly solvable case: on a tree with coordination number z, the percolation threshold, the order parameter and the mean cluster size follow from simple self-consistency equations.
pc = 1z − 1 -
2
Percolation on the 2D square lattice
Clusters on the square lattice near the threshold, the emergence of a spanning cluster, and critical exponents beyond mean-field theory.
P∞ ∝ (p − pc)β, β = 536 -
3
Percolation on networks
Percolation on random networks with arbitrary degree distributions, the Molloy–Reed criterion, and the robustness of heterogeneous networks.
φc = ⟨k⟩⟨k2⟩ − ⟨k⟩
The Ising model
-
4
The Ising model: introduction
The model, its Hamiltonian and partition function, and why a system of interacting binary spins is the standard testing ground for phase transitions.
H = −J ∑⟨ij⟩ sisj − h ∑i si -
5
The 1D Ising model
The transfer-matrix solution in one dimension, and why there is no ordered phase at any nonzero temperature.
ξ = −1ln tanh(βJ) -
6
Mean-field and Landau theory of the Ising model
The self-consistent mean-field equation, the Landau free energy expanded in the order parameter, and the resulting mean-field exponents.
m = tanh[β(qJm + h)] -
7
The 2D Ising model
Monte Carlo simulations on the square lattice, Onsager's exact critical temperature, and finite-size behavior near the transition.
kBTc/J = 2ln(1 + 2) ≈ 2.269 -
8
The renormalization group for the Ising model
Coarse-graining by block spins, the flow of couplings under repeated transformations, fixed points, and critical exponents from the linearized flow.
ν = ln bln λt
References
- Kim Christensen and Nicholas R. Moloney, Complexity and Criticality (Imperial College Press, 2005).
- Prof. Sang Hoon Lee, lecture notes for Special Topics in Complex Systems.