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 general, @math will grow linearly with @math but for properly centered and normalized splitting processes --- the so called boundary cases --- the growth of @math is sublinear. Here McDiarmid @cite_45 showed that the correct order is @math while Bachmann @cite_39 and Bramson and Zeitouni @cite_46 proved tightness of @math under regularity conditions on the tail of the splitting process. Hu and Shi @cite_15 and Addario-Berry and Reed @cite_9 then established @math is tight. Pursuing the strategy that proved to be so useful for the BBM, Biggins and Kyprianou @cite_26 showed the convergence of the corresponding derivative martingale @math while A "id 'ekon @cite_16 established a representation for the limiting law of @math as the Laplace transform of @math .
@cite_26 @cite_15 @cite_9 @cite_39 @cite_45 @cite_46 @cite_16
2952056253 2102318662 2889042315 2807635458
We give an approximation algorithm for non-uniform sparsest cut with the following guarantee: For any @math , given cost and demand graphs with edge weights @math respectively, we can find a set @math with @math at most @math times the optimal non-uniform sparsest cut value, in time @math provided @math . Here @math is the @math 'th smallest generalized eigenvalue of the Laplacian matrices of cost and demand graphs; @math (resp. @math ) is the weight of edges crossing the @math cut in cost (resp. demand) graph and @math is the sparsity of the optimal cut. In words, we show that the non-uniform sparsest cut problem is easy when the generalized spectrum grows moderately fast. To the best of our knowledge, there were no results based on higher order spectra for non-uniform sparsest cut prior to this work. Even for uniform sparsest cut, the quantitative aspects of our result are somewhat stronger than previous methods. Similar results hold for other expansion measures like edge expansion, normalized cut, and conductance, with the @math 'th smallest eigenvalue of the normalized Laplacian playing the role of @math in the latter two cases. Our proof is based on an l1-embedding of vectors from a semi-definite program from the Lasserre hierarchy. The embedded vectors are then rounded to a cut using standard threshold rounding. We hope that the ideas connecting @math -embeddings to Lasserre SDPs will find other applications. Another aspect of the analysis is the adaptation of the column selection paradigm from our earlier work on rounding Lasserre SDPs [GS11] to pick a set of edges rather than vertices. This feature is important in order to extend the algorithms to non-uniform sparsest cut. 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. Oliveira conjectured that the order of the mixing time of the exclusion process with @math -particles on an arbitrary @math -vertex graph is at most that of the mixing-time of @math independent particles. We verify this up to a constant factor for @math -regular graphs when each edge rings at rate @math in various cases: (1) when @math or (2) when @math the spectral-gap of a single walk is @math and @math or (3) when @math for some constant @math . In these cases our analysis yields a probabilistic proof of a weaker version of Aldous' famous spectral-gap conjecture (resolved by ). We also prove a general bound which is at worst @math , which is within a @math factor from Oliveira's conjecture when @math . As applications we get new mixing bounds: (a) @math for expanders, (b) order @math for the hypercube @math and (c) order @math for vertex-transitive graphs of moderate growth and for supercritical percolation on a fixed dimensional torus. We consider the simple exclusion process with @math particles on a segment of length @math performing random walks with transition @math to the right and @math to the left. We focus on the case where the asymmetry in the jump rates @math vanishes in the limit when @math and @math tend to infinity, and obtain sharp asymptotics for the mixing times of this sequence of Markov chains in the two cases where the asymmetry is either much larger or much smaller than @math . We show that in the former case ( @math ), the mixing time corresponds to the time needed to reach macroscopic equilibrium, like for the strongly asymmetric (i.e. constant @math ) case studied in [LL18], while the latter case ( @math ) macroscopic equilibrium is not sufficient for mixing and one must wait till local fluctuations equilibrate, similarly to what happens in the symmetric case worked out in [Lac16b]. In both cases, convergence to equilibrium is abrupt: we have a cutoff phenomenon for the total-variation distance. We present a conjecture for the remaining regime when the asymmetry is of order @math .