We study scaling limits of a family of planar random growth processes in which clusters grow by the successive aggregation of small particles. In these models, clusters are encoded as a composition of conformal maps and the attachment point of each successive particle is distributed according to harmonic measure on the cluster boundary, raised to some power. We show that, when this power lies within a particular range, the macroscopic shape of the cluster converges to a disk, but that as the power approaches the edge of this range the fluctuations approach a critical point, which is a limit of stability.
In this paper, we approach the question of a phase transition in ALE( @math ) at @math from the opposite side to @cite_13 by focussing on the regime @math and showing the existence of a phase transition at the level of fluctuations. Our results apply in a more universal setting as we can consider a wide class of particle shapes, not just slits.
@cite_13
2052952091
Over the past decade, physicists have developed deep but non-rigorous techniques for studying phase transitions in discrete structures. Recently, their ideas have been harnessed to obtain improved rigorous results on the phase transitions in binary problems such as random @math -SAT or @math -NAESAT (e.g., Coja-Oghlan and Panagiotou: STOC 2013). However, these rigorous arguments, typically centered around the second moment method, do not extend easily to problems where there are more than two possible values per variable. The single most intensely studied example of such a problem is random graph @math -coloring. Here we develop a novel approach to the second moment method in this problem. This new method, inspired by physics conjectures on the geometry of the set of @math -colorings, allows us to establish a substantially improved lower bound on the @math -colorability threshold. The new lower bound is within an additive @math of a simple first-moment upper bound and within @math of the physics conjecture. By comparison, the best previous lower bound left a gap of about @math , unbounded in terms of the number of colors [Achlioptas, Naor: STOC 2004].