首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Information percolation and cutoff for the random‐cluster model
Authors:Shirshendu Ganguly  Insuk Seo
Abstract:We consider the random‐cluster model (RCM) on urn:x-wiley:rsa:media:rsa20931:rsa20931-math-0001 with parameters p∈(0,1) and q ≥ 1. This is a generalization of the standard bond percolation (with edges open independently with probability p) which is biased by a factor q raised to the number of connected components. We study the well‐known Fortuin‐Kasteleyn (FK)‐dynamics on this model where the update at an edge depends on the global geometry of the system unlike the Glauber heat‐bath dynamics for spin systems, and prove that for all small enough p (depending on the dimension) and any q>1, the FK‐dynamics exhibits the cutoff phenomenon at urn:x-wiley:rsa:media:rsa20931:rsa20931-math-0002 with a window size urn:x-wiley:rsa:media:rsa20931:rsa20931-math-0003, where λ is the large n limit of the spectral gap of the process. Our proof extends the information percolation framework of Lubetzky and Sly to the RCM and also relies on the arguments of Blanca and Sinclair who proved a sharp urn:x-wiley:rsa:media:rsa20931:rsa20931-math-0004 mixing time bound for the planar version. A key aspect of our proof is the analysis of the effect of a sequence of dependent (across time) Bernoulli percolations extracted from the graphical construction of the dynamics, on how information propagates.
Keywords:60J10 Markov chains  60K35 Interacting random processes  statistical mechanics type models  percolation theory  82B20 Lattice systems (Ising  dimer  Potts  etc  ) and systems on graphs arising in equilibrium statistical mechanics  82C20 Dynamic lattice systems (kinetic Ising  etc  ) and systems on graphs in time‐dependent statistical mechanics
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号