Related papers: Linked cluster expansion on trees
We present exact results for a lattice model of cluster growth in 1D. The growth mechanism involves interface hopping and pairwise annihilation supplemented by spontaneous creation of the stable-phase, +1, regions by overturning the…
We develop strong-coupling series expansion methods to study two-particle spectra of quantum lattice models. At the heart of the method lies the calculation of an effective Hamiltonian in the two-particle subspace. We explicitly consider an…
We prove central limit theorems (CLTs) for topological functionals of Bernoulli bond percolation on infinite graphs beyond the Euclidean lattice $\mathbb{Z}^{d}$. For quasi-transitive graphs of subexponential growth, we show that the number…
The linked-cluster expansion technique for the high-temperature expansion of spin model is reviewed. A new algorithm for the computation of three-point and higher Green's functions is presented. Series are computed for all components of…
Given a complete graph $G = (V, E)$ where each edge is labeled $+$ or $-$, the Correlation Clustering problem asks to partition $V$ into clusters to minimize the number of $+$edges between different clusters plus the number of $-$edges…
Correlation clustering is a widely studied framework for clustering based on pairwise similarity and dissimilarity scores, but its best approximation algorithms rely on impractical linear programming relaxations. We present faster…
Spectral clustering views the similarity matrix as a weighted graph, and partitions the data by minimizing a graph-cut loss. Since it minimizes the across-cluster similarity, there is no need to model the distribution within each cluster.…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
Phylogenetic inference can potentially result in a more accurate tree using data from multiple loci. However, if the loci are incongruent--due to events such as incomplete lineage sorting or horizontal gene transfer--it can be misleading to…
Replicated weighted networks often exhibit many structural zeros alongside heterogeneous non-zero edge strengths. In structural connectomics, this zero-inflation coincides with subjects expressing overlapping, rather than discrete,…
We study effects of delay in diffusively coupled logistic maps on the Cayley tree networks. We find that smaller coupling values exhibits sensitiveness for value of delay, and leads to different cluster patterns of self-organized and driven…
In this work, we study the numerical optimization of nearest-neighbor concurrence of bipartite one and two dimensional lattices, as well as non bipartite two dimensional lattices. These systems are described in the framework of a…
The cluster variation method (CVM) is an approximation technique which generalizes the mean field approximation and has been widely applied in the last decades, mainly for finding accurate phase diagrams of Ising-like lattice models. Here…
Connected clustering denotes a family of constrained clustering problems in which we are given a distance metric and an undirected connectivity graph $G$ that can be completely unrelated to the metric. The aim is to partition the $n$…
We review critically the concepts and the applications of Cayley Trees and Bethe Lattices in statistical mechanics in a tentative effort to remove widespread misuse of these simple, but yet important - and different - ideal graphs. We…
We show the existence of cluster $\mathcal{A}$-structures and cluster Poisson structures on any braid variety, for any simple Lie group. The construction is achieved via weave calculus and a tropicalization of Lusztig's coordinates. Several…
This paper presents a unified computational framework for the estimation of distances, geodesics and barycenters of merge trees. We extend recent work on the edit distance [106] and introduce a new metric, called the Wasserstein distance…
Clustering is an underspecified task: there are no universal criteria for what makes a good clustering. This is especially true for relational data, where similarity can be based on the features of individuals, the relationships between…
I derive a formulation of the 2-dimensional critical Ising model on non-uniform simplicial lattices. Surprisingly, the derivation leads to a set of geometric constraints that a lattice must satisfy in order for the model to have a…
We investigate analytically and numerically eigenfunction statistics in a disordered system on a finite Bethe lattice (Cayley tree). We show that the wave function amplitude at the root of a tree is distributed fractally in a large part of…