We consider the discrete Gaussian Free Field in a square box in ( Z ^2 ) of side length N with zero boundary conditions and study the joint law of its properly-centered extreme values (h) and their scaled spatial positions (x) in the limit as ( N ). Restricting attention to extreme local maxima, i.e., the extreme points that are maximal in an r N -neighborhood thereof, we prove that the associated process tends, whenever ( r_N ) and ( r_N N 0 ), to a Poisson point process with intensity measure ( Z ( dx) e ^ - h d h ), where ( := 2 g ) with g: = 2 π and where Z(dx) is a random Borel measure on [0, 1]2. In particular, this yields an integral representation of the law of the absolute maximum, similar to that found in the context of Branching Brownian Motion. We give evidence that the random measure Z is a version of the derivative martingale associated with the continuum Gaussian Free Field.
Let us now move to the subject of interest in the present paper, which is the behavior of the extreme values of the DGFF in the limit as @math . A particular aspect of this, the maximum has been studied very intensely. Indeed, Bolthausen, Deuschel and Giacomin @cite_20 showed that @math . More recently, building on Bolthausen, Deuschel and Zeitouni @cite_47 , Bramson and Zeitouni @cite_33 proved that the family @math is tight when @math is as in . Finally, in a very recent development, Bramson, Ding and Zeitouni @cite_7 proved the following result:
@cite_7 @cite_47 @cite_33 @cite_20
2964051416 1984642139 1965299092 2102318662
We consider the maximum of the discrete two-dimensional Gaussian free field (GFF) in a box and prove that its maximum, centered at its mean, is tight, settling a longstanding conjecture. The proof combines a recent observation by Bolthausen, Deuschel, and Zeitouni with elements from Bramson's results on branching Brownian motion and comparison theorems for Gaussian fields. An essential part of the argument is the precise evaluation, up to an error of order 1, of the expected value of the maximum of the GFF in a box. Related Gaussian fields, such as the GFF on a two-dimensional torus, are also discussed. © 2011 Wiley Periodicals, Inc. We consider the maximum of the discrete two dimensional Gaussian free field (GFF) in a box, and prove that its maximum, centered at its mean, is tight, settling a long-standing conjecture. The proof combines a recent observation of Bolthausen, Deuschel and Zeitouni with elements from (Bramson 1978) and comparison theorems for Gaussian fields. An essential part of the argument is the precise evaluation, up to an error of order 1, of the expected value of the maximum of the GFF in a box. Related Gaussian fields, such as the GFF on a two-dimensional torus, are also discussed. Selective families, a weaker variant of superimposed codes [KS64, F92, 197, CR96], have been recently used to design Deterministic Distributed Broadcast (DDB) protocols for unknown radio networks (a radio network is said to be unknown when the nodes know nothing about the network but their own label) [CGGPR00, CGOR00]. We first provide a general almost tight lower bound on the size of selective families. Then, by reverting the selective families - DDB protocols connection, we exploit our lower bound to construct a family of “hard” radio networks (i.e. directed graphs). These networks yield an O(n log D) lower bound on the completion time of DDB protocols that is superlinear (in the size n of the network) even for very small maximum eccentricity D of the network, while all the previous lower bounds (e.g. O(D log n) [CGGPR00]) are superlinear only when D is almost linear. On the other hand, the previous upper bounds are all superlinear in n independently of the eccentricity D and the maximum in-degree d of the network. We introduce a broadcast technique that exploits selective families in a new way. Then, by combining selective families of almost optimal size with our new broadcast technique, we obtain an O(Dd log3 n) upper bound that we prove to be almost optimal when d = O(n D). This exponentially improves over the best known upper bound [CGR00) when D, d = O(polylogn). Furthermore, by comparing our deterministic upper bound with the best known randomized one [BGI87] we obtain a new, rather surprising insight into the real gap between deterministic and randomized protocols. It turns out that this gap is exponential (as discovered in [BGI87]), but only when the network has large maximum in-degree (i.e. d = O(na), for some constant a > O). We then look at the multibroadcast problem on unknown radio networks. A similar connection to that between selective families and (single) broadcast also holds between superimposed codes and multibroadcast. We in fact combine a variant of our (single) broadcast technique with superimposed codes of almost optimal size available in literature [EFF85, HS87, I97, CHI99]. This yields a multibroadcast protocol having completion time O(Dd2 log3 n). Finally, in order to determine the limits of our multibroadcast technique, we generalize (and improve) the best known lower bound [CR96] on the size of superimposed codes. We study the maximum of a Gaussian field on @math ( @math ) whose correlations decay logarithmically with the distance. Kahane Kah85 introduced this model to construct mathematically the Gaussian multiplicative chaos in the subcritical case. Duplantier, Rhodes, Sheffield and Vargas DRSV12a DRSV12b extended Kahane's construction to the critical case and established the KPZ formula at criticality. Moreover, they made in DRSV12a several conjectures on the supercritical case and on the maximum of this Gaussian field. In this paper we resolve Conjecture 12 in DRSV12a : we establish the convergence in law of the maximum and show that the limit law is the Gumbel distribution convoluted by the limit of the derivative martingale.