Rarity of extremal edges in random surfaces and other theoretical applications of cluster algorithms

Omri Cohen-Alloro, Ron Peled

Research output: Contribution to journalArticlepeer-review

Abstract

Motivated by questions on the delocalization of random surfaces, we prove that random surfaces satisfying a Lipschitz constraint rarely develop extremal gradients. Previous proofs of this fact relied on reflection positivity and were thus limited to random surfaces defined on highly symmetric graphs, whereas our argument applies to general graphs. Our proof makes use of a cluster algorithm and reflection transformation for random surfaces of the type introduced by Swendsen-Wang, Wolff and Evertz et al. We discuss the general framework for such cluster algorithms, reviewing several particular cases with emphasis on their use in obtaining theoretical results. Two additional applications are presented: A reflection principle for random surfaces and a proof that pair correlations in the spin O(n) model have monotone densities, strengthening Griffiths' first inequality for such correlations.

Original languageEnglish
Pages (from-to)2439-2464
Number of pages26
JournalAnnals of Applied Probability
Volume30
Issue number5
DOIs
StatePublished - Oct 2020

Keywords

  • Cluster algorithms
  • Extremal gradients
  • Random surfaces
  • Swendsen-Wang algorithm
  • Wolff algorithm

Fingerprint

Dive into the research topics of 'Rarity of extremal edges in random surfaces and other theoretical applications of cluster algorithms'. Together they form a unique fingerprint.

Cite this