Recursions and tightness for the maximum of the discrete, two dimensional Gaussian Free Field
Authors:
Open Access
- 1 January 2011
- journal article
- Published by Institute of Mathematical Statistics in Electronic Communications in Probability
- Vol. 16 (none) , 114-119
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. 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.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Thick points of the Gaussian free fieldThe Annals of Probability, 2010
- Statistical mechanics of logarithmic REM: duality, freezing and extreme value statistics of 1/f noises generated by Gaussian free fieldsJournal of Statistical Mechanics: Theory and Experiment, 2009
- Minima in branching random walksThe Annals of Probability, 2009
- Tightness for a family of recursion equationsThe Annals of Probability, 2009
- Freezing and extreme-value statistics in a random energy model with logarithmically correlated potentialJournal of Physics A: Mathematical and Theoretical, 2008
- A new method of normal approximationThe Annals of Probability, 2008
- Gaussian free fields for mathematiciansProbability Theory and Related Fields, 2007
- Extremes of the discrete two-dimensional Gaussian free fieldThe Annals of Probability, 2006
- Entropic Repulsion and the Maximum of the two-dimensional harmonicThe Annals of Probability, 2001
- Limit distributions for minimal displacement of branching random walksProbability Theory and Related Fields, 1991