相关论文: A new computation of the critical point for the pl…

The critical surface for random-cluster model with cluster-weight $q\ge 4$ on isoradial graphs is identified using parafermionic observables. Correlations are also shown to decay exponentially fast in the subcritical regime. While this…

This paper studies the critical and near-critical regimes of the planar random-cluster model on $\mathbb Z^2$ with cluster-weight $q\in[1,4]$ using novel coupling techniques. More precisely, we derive the scaling relations between the…

In this paper, we prove sharpness of the phase transition for the random-cluster model in summable positive external fields, with cluster weight q=2,3,..., on the hypercubic lattice. That is, there exists some nontrivial critical parameter…

Using the Baxter-Kelland-Wu coupling and the convergence of the height function of the six-vertex model to the Gaussian Free Field, we extract critical exponents for the planar critical random-cluster model at $q=4$, and the planar…

The random-cluster model has been widely studied as a unifying framework for random graphs, spin systems and electrical networks, but its dynamics have so far largely resisted analysis. In this paper we analyze the Glauber dynamics of the…

We prove a long-standing conjecture on random-cluster models, namely that the critical point for such models with parameter $q\geq1$ on the square lattice is equal to the self-dual point $p_{sd}(q) = \sqrt q /(1+\sqrt q)$. This gives a…

The purpose of this modest note is to provide a short proof of the sharpness of the phase transition for the Random-cluster model with $q=2$ by extending the approach developed by Duminil-Copin and Tassion for $q=1$. This in particular…

This paper is studying the critical regime of the planar random-cluster model on $\mathbb Z^2$ with cluster-weight $q\in[1,4)$. More precisely, we prove crossing estimates in quads which are uniform in their boundary conditions and depend…

The so-called diluted-random-cluster model may be viewed as a random-cluster representation of the Blume--Capel model. It has three parameters, a vertex parameter $a$, an edge parameter $p$, and a cluster weighting factor $q$. Stochastic…

I introduce a generic method for inference about a scalar parameter in research designs with a finite number of heterogeneous clusters where only a single cluster received treatment. This situation is commonplace in…

Clustering of data points is a fundamental tool in data analysis. We consider points $X$ in a relaxed metric space, where the triangle inequality holds within a constant factor. The {\em cost} of clustering $X$ by $Q$ is $V(Q)=\sum_{x\in X}…

In a recent and celebrated article, Smirnov [Ann. of Math. (2) 172 (2010) 1435-1467] defines an observable for the self-dual random-cluster model with cluster weight q = 2 on the square lattice $\mathbb{Z}^2$, and uses it to obtain…

It is common practice in empirical work to employ cluster-robust standard errors when using the linear regression model to estimate some structural/causal effect of interest. Researchers also often include a large set of regressors in their…

We study a random even subgraph of a finite graph $G$ with a general edge-weight $p\in(0,1)$. We demonstrate how it may be obtained from a certain random-cluster measure on $G$, and we propose a sampling algorithm based on coupling from the…

Herein, we propose a site random cluster model by introducing an additional cluster weight in the partition function of the traditional site percolation. To simulate the model on a square lattice, we combine the color-assignation and the…

We develop an Ornstein--Zernike theory for the two-dimensional random-cluster model with $1 \leq q <4$ that also applies in its near-critical regime. In particular, we prove an asymptotic formula for the two-point function which holds…

We propose a new effective cluster algorithm of tuning the critical point automatically, which is an extended version of Swendsen-Wang algorithm. We change the probability of connecting spins of the same type, $p = 1 - e^{- J/ k_BT}$, in…

Finite mixtures of regressions with fixed covariates are a commonly used model-based clustering methodology to deal with regression data. However, they assume assignment independence, i.e. the allocation of data points to the clusters is…

We consider a new formulation of the stochastic coupled cluster method in terms of the similarity transformed Hamiltonian. We show that improvement in the granularity with which the wavefunction is represented results in a reduction in the…

In the Correlation Clustering problem, we are given a weighted graph $G$ with its edges labeled as "similar" or "dissimilar" by a binary classifier. The goal is to produce a clustering that minimizes the weight of "disagreements": the sum…