Self-averaging

A self-averaging physical property of a disordered system is one that can be described by averaging over a sufficiently large sample. The concept was introduced by Ilya Mikhailovich Lifshitz.

Definition

Frequently in physics one comes across situations where quenched randomness plays an important role. Any physical property X of such a system, would require an averaging over all disorder realisations. The system can be completely described by the average [X] where [...] denotes averaging over realisations (“averaging over samples”) provided the relative variance R_X = V_X / [X]² → 0 as N→∞, where V_X = [X²] − [X]² and N denotes the size of the realisation. In such a scenario a single large system is sufficient to represent the whole ensemble. Such quantities are called self-averaging. Away from criticality, when the larger lattice is built from smaller blocks, then due to the additivity property of an extensive quantity, the central limit theorem guarantees that R_X ~ N⁻¹ thereby ensuring self-averaging. On the other hand, at the critical point, the question whether is self-averaging or not becomes nontrivial, due to long range correlations.

Non self-averaging systems

At the pure critical point randomness is classified as relevant if, by the standard definition of relevance, it leads to a change in the critical behaviour (i.e., the critical exponents) of the pure system. It has been shown by recent renormalization group and numerical studies that self-averaging property is lost if randomness or disorder is relevant.^[1] Most importantly as N → ∞, R_X at the critical point approaches a constant. Such systems are called non self-averaging. Thus unlike the self-averaging scenario, numerical simulations cannot lead to an improved picture in larger lattices (large N), even if the critical point is exactly known. In summary, various types of self-averaging can be indexed with the help of the asymptotic size dependence of a quantity like R_X. If R_X falls off to zero with size, it is self-averaging whereas if R_X approaches a constant as N → ∞, the system is non-self-averaging.

Strong and weak self-averaging

There is a further classification of self-averaging systems as strong and weak. If the exhibited behavior is R_X ~ N⁻¹ as suggested by the central limit theorem, mentioned earlier, the system is said to be strongly self-averaging. Some systems shows a slower power law decay R_X ~ N^−z with 0 < z < 1. Such systems are classified weakly self-averaging. The known critical exponents of the system determine the exponent z.

It must also be added that relevant randomness does not necessarily imply non self-averaging, especially in a mean-field scenario. ^[2] The RG arguments mentioned above need to be extended to situations with sharp limit of T_c distribution and long range interactions.

References

1. ↑ -A. Aharony and A.B. Harris (1996). "Absence of Self-Averaging and Universal Fluctuations in Random Systems near Critical Points". Phys. Rev. Lett. 77 (18): 3700–3703. Bibcode:1996PhRvL..77.3700A. doi:10.1103/PhysRevLett.77.3700. PMID 10062286. 
2. ↑ - S Roy and SM Bhattacharjee (2006). "Is small-world network disordered?". Physics Letters A 352: 13. arXiv:cond-mat/0409012. Bibcode:2006PhLA..352...13R. doi:10.1016/j.physleta.2005.10.105.