RARITY OF EXTREMAL EDGES IN RANDOM SURFACES AND OTHER THEORETICAL APPLICATIONS OF CLUSTER ALGORITHMS

• 成果类型: Article
• 署名作者: Cohen-Alloro, Omri; Peled, Ron
• 署名单位: Tel Aviv University
• 刊物名称: ANNALS OF APPLIED PROBABILITY
• ISSN/ISSBN: 1050-5164
• DOI: 10.1214/20-AAP1562
• 发表日期: 2020
• 页码: 2439-2464
• 关键词: graphical representations; swendsen-wang; percolation; inequalities; DYNAMICS; MODEL

摘要

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.