We study the asymptotic growth of the diameter of a graph obtained by adding sparse “long” edges to a square box in article amsmath,amsfonts empty . We focus on the cases when an edge between x and y is added with probability decaying with the Euclidean distance as |x − y|−s+o(1) when |x − y| → ∞. For s ∈ (d, 2d) we show that the graph diameter for the graph reduced to a box of side L scales like (log L)Δ+o(1) where Δ−1 := log2(2d s). In particular, the diameter grows about as fast as the typical graph distance between two vertices at distance L. We also show that a ball of radius r in the intrinsic metric on the (infinite) graph will roughly coincide with a ball of radius exp r1 Δ+o(1) in the Euclidean metric. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 39, 210-227, 2011 (Reproduction, by any means, of the entire article for non-commercial purposes is permitted without charge.)
Long-range percolation, of which our model is an example, originated in the mathema -ti -cal-physics literature as a model that exhibits a phase transition even in spatial dimension one (e.g., Newman and Schulman @cite_1 , Schulman @cite_2 , Aizenman and Newman @cite_3 , Imbrie and Newman @cite_10 ). It soon became clear that @math and @math are two distinguished values; for @math the model is essentially mean-field (or complete-graph) alike, for @math the behavior is more or less as for the nearest-neighbor percolation. The regime @math turned out to be quite interesting; indeed, it is the only general class of percolation models with Euclidean (or amenable) geometry where one can prove absence of percolation at the percolation threshold (Berger @cite_7 ). In all dimensions, the model with @math has a natural continuum scaling limit.
@cite_7 @cite_1 @cite_3 @cite_2 @cite_10
2523448217 2806580934 1580648572 2123703403
We generalize the standard site percolation model on the @math -dimensional lattice to a model on random tessellations of @math . We prove the uniqueness of the infinite cluster by adapting the Burton-Keane argument burton1989density , develop two frameworks that imply the non-triviality of the phase transition and show that large classes of random tessellations fit into one of these frameworks. Our focus is on a very general approach that goes well beyond the typical Poisson driven models. The most interesting examples might be Voronoi tessellations induced by determinantal processes or certain classes of Gibbs processes introduced in schreiber2013 . In a second paper we will investigate first passage percolation on random tessellations. We study the directed polymer model in dimension @math when the environment is heavy-tailed, with a decay exponent @math . We give all possible scaling limits of the model in the weak-coupling regime, i.e., when the inverse temperature temperature @math vanishes as the size of the system n goes to infinity. When @math , we show that all possible transversal fluctuations @math can be achieved by tuning properly @math , allowing to interpolate between all super-diffusive scales. Moreover, we determine the scaling limit of the model, answering a conjecture by Dey and Zygouras [cf:DZ] - we actually identify five different regimes. On the other hand, when @math , we show that there are only two regimes: the transversal fluctuations are either @math or @math . As a key ingredient, we use the Entropy-controlled Last Passage Percolation (E-LPP), introduced in a companion paper [cf:BT_ELPP]. We consider long-range percolation in dimension @math , where distinct sites @math and @math are connected with probability @math . Assuming that @math is translation invariant and that @math with @math , we show that the graph distance is at least linear with the Euclidean distance. We consider level-set percolation for the Gaussian free field on ( Z ^ d ), d ≥ 3, and prove that, as h varies, there is a non-trivial percolation phase transition of the excursion set above level h for all dimensions d ≥ 3. So far, it was known that the corresponding critical level h*(d) satisfies h*(d) ≥ 0 for all d ≥ 3 and that h*(3) is finite, see (J Stat Phys 48(5 6):1249–1268, 1987). We prove here that h*(d) is finite for all d ≥ 3. In fact, we introduce a second critical parameter h** ≥ h*, show that h**(d) is finite for all d ≥ 3, and that the connectivity function of the excursion set above level h has stretched exponential decay for all h > h**. Finally, we prove that h* is strictly positive in high dimension. It remains open whether h* and h** actually coincide and whether h* > 0 for all d ≥ 3.