Related papers: Linked cluster expansion on trees
In this paper we extend our previous results on the connectivity functions and pressure of the Random Cluster Model in the highly subcritical phase and in the highly supercritical phase, originally proved only on the cubic lattice $\Z^d$,…
The lace expansion is a powerful perturbative technique to analyze the critical behavior of random spatial processes such as the self-avoiding walk, percolation and lattice trees and animals. The non-backtracking lace expansion (NoBLE) is a…
Correlation Clustering (CC) is a fundamental unsupervised learning primitive whose strongest LP-based approximation guarantees require $\Theta(n^3)$ triangle inequality constraints and are prohibitive at scale. We initiate the study of…
We introduce a general framework to show the indistinguishability of infinite clusters (ergodicity of the cluster subrelation) in group-invariant percolation processes with a weaker version of the finite energy property: the possibility of…
This paper proposes FREEtree, a tree-based method for high dimensional longitudinal data with correlated features. Popular machine learning approaches, like Random Forests, commonly used for variable selection do not perform well when there…
A central problem in many-body quantum physics is the determination of the ground state of a thermodynamically large physical system. We construct a cluster expansion for ground states of local Hamiltonians, which naturally incorporates…
We present two results related to an edge-isoperimetric question for Cayley graphs on the integer lattice asked by Ben Barber and Joshua Erde [Isoperimetry of Integer Lattices, Discrete Analysis 7 (2018)]. For any (undirected) graph $G$,…
Long-standing challenges in cluster expansion (CE) construction include choosing how to truncate the expansion and which crystal structures to use for training. Compressive sensing (CS), which is emerging as a powerful tool for model…
For every physical model defined on a generic graph or factor graph, the Bethe $M$-layer construction allows building a different model for which the Bethe approximation is exact in the large $M$ limit and it coincides with the original…
The density of zeros of the partition function of the Ising model on a class of treelike lattices is studied. An exact closed-form expression for the pertinent critical exponents is derived by using a couple of recursion relations which…
The numerical integration of stochastic growth equations on non-Euclidean networks presents unique challenges due to the nonlinearities that occur in many relevant models and of the structural constraints of the networks. In this work, we…
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…
Motivated by modern applications in which one constructs graphical models based on a very large number of features, this paper introduces a new class of cluster-based graphical models, in which variable clustering is applied as an initial…
For a density $f$ on ${\mathbb R}^d$, a {\it high-density cluster} is any connected component of $\{x: f(x) \geq \lambda\}$, for some $\lambda > 0$. The set of all high-density clusters forms a hierarchy called the {\it cluster tree} of…
In this paper we study CAT(0) groups and their splittings as graphs of groups. For one-ended CAT(0) groups with isolated flats we prove a theorem characterizing exactly when the visual boundary is locally connected. This characterization…
Many real-world networks exhibit scale-free feature, have a small diameter and a high clustering tendency. We have studied the properties of a growing network, which has all these features, in which an incoming node is connected to its…
Strong Disorder Renormalization for the Random Transverse Field Ising model leads to a complicated topology of surviving clusters as soon as $d>1$. Even if one starts from a Cayley tree, the network of surviving renormalized clusters will…
We implement numerical linked cluster expansions (NLCEs) to study dynamics of lattice systems following quantum quenches, and focus on a hard-core boson model in one-dimensional lattices. We find that, in the nonintegrable regime and within…
The coupled cluster or exp S form of the eigenvalue problem for lattice Hamiltonian QCD (without quarks) is investigated. A new construction prescription is given for the calculation of the relevant coupled cluster matrix elements with…
The node-averaged complexity of a problem captures the number of rounds nodes of a graph have to spend on average to solve the problem in the LOCAL model. A challenging line of research with regards to this new complexity measure is to…