Quasi‐polynomial mixing of critical two‐dimensional random cluster models-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Quasi‐polynomial mixing of critical two‐dimensional random cluster models

Published:2019-06-13 Issue:2 Volume:56 Page:517-556
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct Alg

Author:

Gheissari Reza¹,Lubetzky Eyal¹

Affiliation:

1. Department of Mathematics Courant Institute, New York University New York New York

Funder

National Science Foundation

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/rsa.20868

Reference23 articles.

1. The self-dual point of the two-dimensional random-cluster model is critical for q ≥ 1

2. Random-cluster dynamics in $${{\mathrm{\mathbb {Z}}}}^2$$

3. Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics

4. Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition point

5. Graphical representations and cluster algorithms I. Discrete spin systems

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics;The Annals of Applied Probability;2023-12-01

2. Spatial mixing and the random‐cluster dynamics on lattices;Random Structures & Algorithms;2023-10-20

3. Efficient sampling and counting algorithms for the Potts model on ℤ ^d at all temperatures;Random Structures & Algorithms;2022-12-23

4. The critical mean-field Chayes–Machta dynamics;Combinatorics, Probability and Computing;2022-05-11

5. Random-Cluster Dynamics on Random Regular Graphs in Tree Uniqueness;Communications in Mathematical Physics;2021-04-17

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3