离散环面中独立集的抽样
Sampling independent sets in the discrete torus
摘要:
偶数离散环面是顶点集{0,...,L-1}^d(L偶),如果两个顶点在一个坐标上相差1(mod L),则两个顶点相邻。在T_{L,d}上具有活动x的核心度量是T_{L,d}的独立集(不跨越边的顶点集)上的分布pi_x,其中集合I以与x^ |I|成比例的概率被选择。这种分布出现在统计物理和通信网络的问题中。研究了平稳分布为pi_x的T_{L,d}的独立集集合上的单点更新马尔可夫链Glauber动力学。我们证明了对于x > cd^{-1/4}log^{3/4}d(且d很大),在L^{d-1}中收敛到平稳性是指数缓慢的。这改进了Borgs等人的结果,其显示了对于x > c^d的缓慢混合。我们的证明,扩展到r-局部链(在每一步中最多改变一部分r顶点的状态的链),对于合适的r,遵循Borgs等人的电导论证,添加了一些组合枚举方法,这些方法是Galvin和Kahn所使用的方法的修改,以表明整数晶格Z^d上具有参数x的硬核模型在x > cd^{-1/4}log^{3/4}d时表现出相共存。图T_{L,d}是二部图,划分类为E(坐标和为偶数的顶点)和O。我们的结果可以组合地表示为这样的陈述:对于每个足够大的x,存在r(x)>0,使得如果I是根据pi_x选择的独立集,则||I \cap E|-|我\cap O||至多r(x)L^d在L^{d-1}中是指数小的。特别地,对于所有eps>0,从T_{L,d}均匀选择的独立集满足以下条件的概率||I \cap E|-|我\cap O|| \leq(0.25- eps)L^d在L^{d-1}中呈指数小。
英文摘要:
The even discrete torus is the graph T_{L,d} on vertex set {0,...,L-1}^d (L even) with two vertices adjacent if they differ by 1 (mod L) on one coordinate. The hard-core measure with activity x on T_{L,d} is the distribution pi_x on the independent sets (sets of vertices spanning no edges) of T_{L,d} in which a set I is chosen with probability proportional to x^|I|. This distribution occurs in problems from statistical physics and communication networks. We study Glauber dynamics, a single-site update Markov chain on the set of independent sets of T_{L,d} whose stationary distribution is pi_x. We show that for x > cd^{-1/4}log^{3/4}d (and d large) the convergence to stationarity is exponentially slow in L^{d-1}. This improves a result of Borgs et al., who had shown slow mixing for x > c^d. Our proof, which extends to r-local chains (chains which alter the state of at most a proportion r of the vertices in each step) for suitable r, follows the conductance argument of Borgs et al., adding to it some combinatorial enumeration methods that are modifications of those used by Galvin and Kahn to show that the hard-core model with parameter x on the integer lattice Z^d exhibits phase coexistence for x > cd^{-1/4}log^{3/4}d. The graph T_{L,d} is bipartite, with partition classes E (the vertices the sum of whose coordinates is even) and O. Our result can be expressed combinatorially as the statement that for each sufficiently large x, there is an r(x)>0 such that if I is an independent set chosen according to pi_x, then the probability that ||I \cap E|-|I \cap O|| is at most r(x)L^d is exponentially small in L^{d-1}. In particular, for all eps>0 the probability that a uniformly chosen independent set from T_{L,d} satisfies ||I \cap E|-|I \cap O|| \leq (.25 - eps)L^d is exponentially small in L^{d-1}.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。