Related papers: Linked cluster expansion on trees
We give an efficient algorithm for Centroid-Linkage Hierarchical Agglomerative Clustering (HAC), which computes a $c$-approximate clustering in roughly $n^{1+O(1/c^2)}$ time. We obtain our result by combining a new Centroid-Linkage HAC…
For arbitrary space dimension $d$ we investigate the quantum phase transitions of two paradigmatic spin models defined on a hypercubic lattice, the coupled-dimer Heisenberg model and the transverse-field Ising model. To this end high-order…
We discuss the relation between entanglement and criticality in translationally invariant harmonic lattice systems with non-randon, finite-range interactions. We show that the criticality of the system as well as validity or break-down of…
We prove that the infinite components of the Free Uniform Spanning Forest of a Cayley graph are indistinguishable by any invariant property, given that the forest is different from its wired counterpart. Similar result is obtained for the…
Drees and Rootz\'en [2010] have proven central limit theorems (CLT) for empirical processes of extreme values cluster functionals built from $\beta$-mixing processes. The problem with this family of $\beta$-mixing processes is that it is…
A model-based approach is developed for clustering categorical data with no natural ordering. The proposed method exploits the Hamming distance to define a family of probability mass functions to model the data. The elements of this family…
The quantum simulation of topological phases in (2+1)D quantum electrodynamics with Wilson fermions provides a promising route toward realizing topological phenomena in near-term lattice experiments. We show that the commonly used…
We introduce low-stretch trees to the visualization community with LSQT, our novel technique that uses quasi-trees for both layout and edge bundling. Our method offers strong computational speed and complexity guarantees by leveraging the…
Strict inequalities in mixed-integer linear optimization can cause difficulties in guaranteeing convergence and exactness. Utilizing that optimal vertex solutions follow a lattice structure we propose a rounding rule for strict inequalities…
In this work, we present a construction of a cluster state lattice Hamiltonian that exhibits the symmetry of the Ising fusion algebra. This construction is formulated within the framework of weak Hopf symmetry topological field theory…
A review of the coupled cluster method (CCM) applied to lattice quantum spin systems is presented here. The CCM formalism is explained and an application to the spin-half {\it XXZ} model on the square lattice is presented. Low orders of…
Message passing equations yield a sharp percolation transition in finite graphs, as an artifact of the locally treelike approximation. For an arbitrary finite, connected, undirected graph we construct an infinite tree having the same local…
We construct an algorithm to simulate imaginary time evolution of translationally invariant spin systems with local interactions on an infinite, symmetric tree. We describe the state by symmetric iPEPS and use translation-invariant…
Flat band physics is a central theme in modern condensed matter physics. By constructing a tight--binding single particle system that has vanishing momentum dispersion in one or more bands, and subsequently including more particles and…
A cluster algorithm is constructed and applied to study the chiral limit of the strongly coupled lattice Schwinger model involving staggered fermions. The algorithm is based on a novel loop representation of the model. Finite size scaling…
We prove clustering estimates for the truncated correlations, i.e., cumulants of an unbounded spin system on the lattice. We provide a unified treatment, based on cluster expansion techniques, of four different regimes: large mass, small…
In this paper we investigate the problem of estimating the cluster tree for a density $f$ supported on or near a smooth $d$-dimensional manifold $M$ isometrically embedded in $\mathbb{R}^D$. We analyze a modified version of a $k$-nearest…
We study the dynamics of entanglement in the scaling limit of the Ising spin chain in the presence of both a longitudinal and a transverse field. We present analytical results for the quench of the longitudinal field in critical transverse…
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
It is shown how to adapt the non-perturbative coupled cluster method of many-body theory so that it may be successfully applied to Hamiltonian lattice $SU(N)$ gauge theories. The procedure involves first writing the wavefunctions for the…