Related papers: Cluster Alphabets from Generalized Worldsheets: A …
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
We show that the coordinate ring of the Vinberg monoid of a simply connected semisimple complex group is an upper cluster algebra. As an application, we construct cluster structures on a large class of flat reductive monoids. After…
Symbol alphabets of n-particle amplitudes in N=4 super-Yang-Mills theory are known to contain certain cluster variables of Gr(4,n) as well as certain algebraic functions of cluster variables. The first paper arXiv:2007.00646 in this series…
In this study, we consider the positive cluster complex, a full subcomplex of a cluster complex the vertices of which are all non-initial cluster variables. In particular, we provide a formula for the difference in face vectors of positive…
We present a novel approach for finding and evaluating structural models of small metallic nanoparticles. Rather than fitting a single model with many degrees of freedom, the approach algorithmically builds libraries of nanoparticle…
Grouping the nodes of a graph into clusters is a standard technique for studying networks. We study a problem where we are given a directed network and are asked to partition the graph into a sequence of coherent groups. We assume that…
Let $\mathcal{C}$ be a Hom-finite triangulated 2-Calabi-Yau category with a cluster tilting object. Under some constructibility assumptions on $\mathcal{C}$ which are satisfied for instance by cluster categories, by generalized cluster…
This if the final paper in the seriesContinuous Quivers of Type $A$. In this part, we generalize existing geometric models of type $A$ cluster structures to the new $\mathbf E$-clusters introduced in part (III). We also introduce an…
Clustering ensemble, or consensus clustering, has emerged as a powerful tool for improving both the robustness and the stability of results from individual clustering methods. Weighted clustering ensemble arises naturally from clustering…
We consider a generalized version of the correlation clustering problem, defined as follows. Given a complete graph $G$ whose edges are labeled with $+$ or $-$, we wish to partition the graph into clusters while trying to avoid errors: $+$…
We introduce new objects, called $(G,c)$-bands, associated with a simple simply-connected algebraic group $G$, and a Coxeter element $c$ in its Weyl group. We show that bands of a given type are the $K$-points of an infinite dimensional…
The Goulden-Jackson cluster method is a powerful tool for obtaining generating functions for counting words in a free monoid by occurrences of a set of subwords. We introduce a generalization of the cluster method for monoid networks, which…
This paper provides new algorithms for distributed clustering for two popular center-based objectives, k-median and k-means. These algorithms have provable guarantees and improve communication complexity over existing approaches. Following…
We introduce a family of cluster algebras of infinite rank associated with root systems of type $A$, $D$, $E$. We show that suitable completions of these cluster algebras are isomorphic to the Grothendieck rings of the categories…
We propose that the symbol alphabet for classes of planar, dual-conformal-invariant Feynman integrals can be obtained as truncated cluster algebras purely from their kinematics, which correspond to boundaries of (compactifications of)…
We construct geometric realization for non-exceptional mutation-finite cluster algebras by extending the theory of Fomin and Thurston to skew-symmetrizable case. Cluster variables for these algebras are renormalized lambda lengths on…
In \cite{CK2005} and \cite{SZ}, the authors constructed the bases of cluster algebras of finite types and of type $\widetilde{A}_{1,1}$, respectively. In this paper, we will deduce $\mathbb{Z}$-bases for cluster algebras of affine types.
In a standard cluster analysis, such as k-means, in addition to clusters locations and distances between them, it's important to know if they are connected or well separated from each other. The main focus of this paper is discovering the…
We introduce the notion of a lower bound cluster algebra generated by projective cluster variables as a polynomial ring over the initial cluster variables and the so-called projective cluster variables. We show that under an acyclicity…
Standard Monte Carlo cluster algorithms have proven to be very effective for many different spin models, however they fail for frustrated spin systems. Recently a generalized cluster algorithm was introduced that works extremely well for…