Recursions and tightness for the maximum of the discrete, two dimensional Gaussian Free Field
arXiv:1005.5417
Abstract
We consider the maximum of the discrete two dimensional Gaussian free field in a box, and prove the existence of a (dense) deterministic subsequence along which the maximum, centered at its mean, is tight; this still leaves open the conjecture that tightness holds without the need for subsequences. The method of proof relies on an argument developed by Dekking and Host for branching random walks with bounded increments and on comparison results specific to Gaussian fields.
arXiv commentProof significantly shortened following a remark of Y. Peres
References in corpus (4)
- Glass transition of a particle in a random potential, front selection in nonlinear RG and entropic phenomena in Liouville and SinhGordon models
- Freezing and extreme value statistics in a Random Energy Model with logarithmically correlated potential
- Tightness for a family of recursion equations
- Chaos, concentration, and multiple valleys