We establish rapid mixing of the random-cluster Glauber dynamics on random
Let us call a simple graph on
- PAR ID:
- 10395693
- Publisher / Repository:
- Springer Science + Business Media
- Date Published:
- Journal Name:
- Mathematische Annalen
- Volume:
- 388
- Issue:
- 2
- ISSN:
- 0025-5831
- Format(s):
- Medium: X Size: p. 2195-2215
- Size(s):
- p. 2195-2215
- Sponsoring Org:
- National Science Foundation
More Like this
-
Abstract -regular graphs for all$$\varDelta $$ and$$q\ge 1$$ , where the threshold$$p corresponds to a uniqueness/non-uniqueness phase transition for the random-cluster model on the (infinite)$$p_u(q,\varDelta )$$ -regular tree. It is expected that this threshold is sharp, and for$$\varDelta $$ the Glauber dynamics on random$$q>2$$ -regular graphs undergoes an exponential slowdown at$$\varDelta $$ . More precisely, we show that for every$$p_u(q,\varDelta )$$ ,$$q\ge 1$$ , and$$\varDelta \ge 3$$ , with probability$$p over the choice of a random$$1-o(1)$$ -regular graph on$$\varDelta $$ n vertices, the Glauber dynamics for the random-cluster model has mixing time. As a corollary, we deduce fast mixing of the Swendsen–Wang dynamics for the Potts model on random$$\varTheta (n \log n)$$ -regular graphs for every$$\varDelta $$ , in the tree uniqueness region. Our proof relies on a sharp bound on the “shattering time”, i.e., the number of steps required to break up any configuration into$$q\ge 2$$ sized clusters. This is established by analyzing a delicate and novel iterative scheme to simultaneously reveal the underlying random graph with clusters of the Glauber dynamics configuration on it, at a given time.$$O(\log n)$$ -
Abstract A well-known open problem of Meir and Moser asks if the squares of sidelength 1/
n for can be packed perfectly into a rectangle of area$$n\ge 2$$ . In this paper we show that for any$$\sum _{n=2}^\infty n^{-2}=\pi ^2/6-1$$ , and any$$1/2 that is sufficiently large depending on$$n_0$$ t , the squares of sidelength for$$n^{-t}$$ can be packed perfectly into a square of area$$n\ge n_0$$ . This was previously known (if one packs a rectangle instead of a square) for$$\sum _{n=n_0}^\infty n^{-2t}$$ (in which case one can take$$1/2 ).$$n_0=1$$ -
Abstract Let
X be ann -element point set in thek -dimensional unit cube where$$[0,1]^k$$ . According to an old result of Bollobás and Meir (Oper Res Lett 11:19–21, 1992) , there exists a cycle (tour)$$k \ge 2$$ through the$$x_1, x_2, \ldots , x_n$$ n points, such that , where$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} \le c_k$$ is the Euclidean distance between$$|x-y|$$ x andy , and is an absolute constant that depends only on$$c_k$$ k , where . From the other direction, for every$$x_{n+1} \equiv x_1$$ and$$k \ge 2$$ , there exist$$n \ge 2$$ n points in , such that their shortest tour satisfies$$[0,1]^k$$ . For the plane, the best constant is$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} = 2^{1/k} \cdot \sqrt{k}$$ and this is the only exact value known. Bollobás and Meir showed that one can take$$c_2=2$$ for every$$c_k = 9 \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ and conjectured that the best constant is$$k \ge 3$$ , for every$$c_k = 2^{1/k} \cdot \sqrt{k}$$ . Here we significantly improve the upper bound and show that one can take$$k \ge 2$$ or$$c_k = 3 \sqrt{5} \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ . Our bounds are constructive. We also show that$$c_k = 2.91 \sqrt{k} \ (1+o_k(1))$$ , which disproves the conjecture for$$c_3 \ge 2^{7/6}$$ . Connections to matching problems, power assignment problems, related problems, including algorithms, are discussed in this context. A slightly revised version of the Bollobás–Meir conjecture is proposed.$$k=3$$ -
Abstract Let
be a positive map from the$$\phi $$ matrices$$n\times n$$ to the$$\mathcal {M}_n$$ matrices$$m\times m$$ . It is known that$$\mathcal {M}_m$$ is 2-positive if and only if for all$$\phi $$ and all strictly positive$$K\in \mathcal {M}_n$$ ,$$X\in \mathcal {M}_n$$ . This inequality is not generally true if$$\phi (K^*X^{-1}K) \geqslant \phi (K)^*\phi (X)^{-1}\phi (K)$$ is merely a Schwarz map. We show that the corresponding tracial inequality$$\phi $$ holds for a wider class of positive maps that is specified here. We also comment on the connections of this inequality with various monotonicity statements that have found wide use in mathematical physics, and apply it, and a close relative, to obtain some new, definitive results.$${{\,\textrm{Tr}\,}}[\phi (K^*X^{-1}K)] \geqslant {{\,\textrm{Tr}\,}}[\phi (K)^*\phi (X)^{-1}\phi (K)]$$ -
Abstract Let
be an elliptically fibered$$X\rightarrow {{\mathbb {P}}}^1$$ K 3 surface, admitting a sequence of Ricci-flat metrics collapsing the fibers. Let$$\omega _{i}$$ V be a holomorphicSU (n ) bundle overX , stable with respect to . Given the corresponding sequence$$\omega _i$$ of Hermitian–Yang–Mills connections on$$\Xi _i$$ V , we prove that, ifE is a generic fiber, the restricted sequence converges to a flat connection$$\Xi _i|_{E}$$ . Furthermore, if the restriction$$A_0$$ is of the form$$V|_E$$ for$$\oplus _{j=1}^n{\mathcal {O}}_E(q_j-0)$$ n distinct points , then these points uniquely determine$$q_j\in E$$ .$$A_0$$