Related papers: Cluster simulations of loop models on two-dimensio…

The two-dimensional Potts Model with 2 to 10 states is studied using a cluster algorithm to calculate fluctuations in cluster size as well as commonly used quantities like equilibrium averages and the histograms for energy and the order…

The two-dimensional Potts Model with 2 to 10 states is studied using a cluster algorithm to calculate fluctuations in cluster size as well as commonly used quantities like equilibrium averages and the histograms for energy and the order…

For Majorana-Wilson lattice fermions in two dimensions we derive a dimer representation. This is equivalent to Gattringer's loop representation, but is made exact here on the torus. A subsequent dual mapping leads to yet another…

The simulation of spin models close to critical points of continuous phase transitions is heavily impeded by the occurrence of critical slowing down. A number of cluster algorithms, usually based on the Fortuin-Kasteleyn representation of…

We consider a general model for a network of oscillators with time delayed, circulant coupling. We use the theory of weakly coupled oscillators to reduce the system of delay differential equations to a phase model where the time delay…

Let ${\mathcal C}$ be a proper minor-closed family of graphs. We present a randomized algorithm that given a graph $G \in {\mathcal C}$ with $n$ vertices, finds a simple cycle of size $k$ in $G$ (if exists) in $2^{O(k)}n$ time. The…

Hierarchical clustering based on pairwise similarities is a common tool used in a broad range of scientific applications. However, in many problems it may be expensive to obtain or compute similarities between the items to be clustered.…

Clustering is a fundamental primitive in unsupervised learning which gives rise to a rich class of computationally-challenging inference tasks. In this work, we focus on the canonical task of clustering d-dimensional Gaussian mixtures with…

The large spacing phase of the infinite random matrix chain, which represents the strongly coupled two-dimensional O(2) model on a random planar lattice, is explored. A class of solutions valid for large lattice spacings is constructed. It…

We connect explicitly the classical $O(2)$ model in 1+1 dimensions, a model sharing important features with $U(1)$ lattice gauge theory, to physical models potentially implementable on optical lattices and evolving at physical time. Using…

Change-point problems have appeared in a great many applications for example cancer genetics, econometrics and climate change. Modern multiscale type segmentation methods are considered to be a statistically efficient approach for multiple…

The critical properties of the spin-1 two-dimensional Blume-Capel model on directed and undi- rected random lattices with quenched connectivity disorder is studied through Monte Carlo simulations. The critical temperature, as well as the…

In this paper we propose a graph-based data clustering algorithm which is based on exact clustering of a minimum spanning tree in terms of a minimum isoperimetry criteria. We show that our basic clustering algorithm runs in $O(n \log n)$…

We study the widely used hierarchical agglomerative clustering (HAC) algorithm on edge-weighted graphs. We define an algorithmic framework for hierarchical agglomerative graph clustering that provides the first efficient $\tilde{O}(m)$ time…

Cluster expansions for the exponential of local operators are constructed using tensor networks. In contrast to other approaches, the cluster expansion does not break any spatial or internal symmetries and exhibits a very favourable…

We consider the O(n) loop model on tetravalent maps and show how to rephrase it into a model of bipartite maps without loops. This follows from a combinatorial decomposition that consists in cutting the O(n) model configurations along their…

Given the ubiquity of lattice models in physics, it is imperative for researchers to possess robust methods for quantifying clusters on the lattice --- whether they be Ising spins or clumps of molecules. Inspired by biophysical studies, we…

We multiply two $n \times n$ matrices $S,T$ over semirings in the Congested Clique model, where $n$ fully connected nodes communicate synchronously using $O(\log n)$-bit messages, within $O(nz(S)^{1/3} nz(T)^{1/3}/n + 1)$ rounds of…

The invaded cluster algorithm, a new method for simulating phase transitions, is described in detail. Theoretical, albeit nonrigorous, justification of the method is presented and the algorithm is applied to Potts models in two and three…

We present conjectured exact expressions for two types of correlations in the dense O$(n=1)$ loop model on $L\times \infty$ square lattices with periodic boundary conditions. These are the probability that a point is surrounded by $m$ loops…