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.
In two other recent papers, Ding @cite_43 and Ding and Zeitouni @cite_4 have studied the tails of the maximum. Specifically, for the upper tail they derived for some @math . For the lower tail, they got the estimates for some @math . The recent work of Bramson, Ding and Zeitouni @cite_7 controls the asymptotic form of the upper tail of @math including the multiplicative constant. Indeed, recasting Proposition 2.2 of @cite_7 into a simpler form, we get:
@cite_43 @cite_4 @cite_7
2592044494 2000931246 1993598763 1969848549
We study the tail behavior for the maximum of discrete Gaussian free field on a 2D box with Dirichlet boundary condition after centering by its expectation. We show that it exhibits an exponential decay for the right tail and a double exponential decay for the left tail. In particular, our result implies that the variance of the maximum is of order 1, improving an (o( n) ) bound by Chatterjee (Chaos, concentration, and multiple valleys, 2008) and confirming a folklore conjecture. An important ingredient for our proof is a result of Bramson and Zeitouni (Commun. Pure Appl. Math, 2010), who proved the tightness of the centered maximum together with an evaluation of the expectation up to an additive constant. Let f be a random Boolean formula that is an instance of 3-SAT. We consider the problem of computing the least real number k such that if the ratio of the number of clauses over the number of variables of f strictly exceeds k , then f is almost certainly unsatisfiable. By a well-known and more or less straightforward argument, it can be shown that kF5.191. This upper bound was improved by to 4.758 by first providing new improved bounds for the occupancy problem. There is strong experimental evidence that the value of k is around 4.2. In this work, we define, in terms of the random formula f, a decreasing sequence of random variables such that, if the expected value of any one of them converges to zero, then f is almost certainly unsatisfiable. By letting the expected value of the first term of the sequence converge to zero, we obtain, by simple and elementary computations, an upper bound for k equal to 4.667. From the expected value of the second term of the sequence, we get the value 4.601q . In general, by letting the U This work was performed while the first author was visiting the School of Computer Science, Carleton Ž University, and was partially supported by NSERC Natural Sciences and Engineering Research Council . of Canada , and by a grant from the University of Patras for sabbatical leaves. The second and third Ž authors were supported in part by grants from NSERC Natural Sciences and Engineering Research . Council of Canada . During the last stages of this research, the first and last authors were also partially Ž . supported by EU ESPRIT Long-Term Research Project ALCOM-IT Project No. 20244 . †An extended abstract of this paper was published in the Proceedings of the Fourth Annual European Ž Symposium on Algorithms, ESA’96, September 25]27, 1996, Barcelona, Spain Springer-Verlag, LNCS, . pp. 27]38 . That extended abstract was coauthored by the first three authors of the present paper. Correspondence to: L. M. Kirousis Q 1998 John Wiley & Sons, Inc. CCC 1042-9832r98r030253-17 253 We consider the integral of fractional Brownian motion (IFBM) and its functionals ξ T on the intervals (0,T) and (−T,T) of the following types: the maximum M T , the position of the maximum, the occupation time above zero etc. We show how the asymptotics of P(ξ T <1)=p T ,T→∞, is related to the Hausdorff dimension of Lagrangian regular points for the inviscid Burgers equation with FBM initial velocity. We produce computational evidence in favor of a power asymptotics for p T . The data do not reject the hypothesis that the exponent θ of the power law is related to the similarity parameter H of fractional Brownian motion as follows: θ=−(1−H) for the interval (−T,T) and θ=−H(1−H) for (0,T). The point 0 is special in that IFBM and its derivative both vanish there. We study the asymptotic-capacity-achieving score function that was recently proposed by for bias-based traitor tracing codes. For the bias function, we choose the Dirichlet distribution with a cutoff. Using Bernstein's inequality and Bennett's inequality, we upper bound the false-positive and false-negative error probabilities. From these bounds we derive sufficient conditions for the scheme parameters. We solve these conditions in the limit of large coalition size c0 and obtain asymptotic solutions for the cutoff, the sufficient code length, and the corresponding accusation threshold. We find that the code length converges to its asymptote approximately as c0?1 2 @math , which is faster than the c0?1 3 @math of Tardos' score function. MSC:94B60