Spin systems on spatial random graphs
-
Date:
23 Oct 2025
-
Speaker:
Yogeshwaran D (Indian Statistical Institute, Bangalore)
-
Time:
11:15 h, room 2.58 (Mathebau)
-
Abstract : We will discuss central limit theorem for spin systems on spatial random graphs. The spin systems satisfy averaged weak mixing, a weak form of asymptotic decorrelation adapted to random graphs. The random graphs are constructed on weakly mixing point processes such as Poisson or Ginibre processes. As illustrative examples, we shall consider the hard-core model and Widom-Rowlinson model on k-nearest neighbour graphs or the Gilbert graph. Weak mixing in these spin systems hold for low-activity parameters and using this, we establish `Lipschitz-localization' of spins on the point process. We deduce a central limit theorem from such a localization criteria. This is joint work with Bartek Blaszczyszyn and Joseph Yukich.