Related papers: Cluster Alphabets from Generalized Worldsheets: A …
We study clustering on graphs with multiple edge types. Our main motivation is that similarities between objects can be measured in many different metrics. For instance similarity between two papers can be based on common authors, where…
In the present paper we examine the relationship between several type $A$ cluster theories and structures. We define a 2D geometric model of a cluster theory, which generalizes cluster algebras from surfaces, and encode several existing…
For a Lie algebra L over an algebraically closed field of non-zero characteristic, every finite-dimensional L-module can be decomposed into a direct sum of submodules such that all composition factors of a summand have the same character.…
This paper presents a neural network-based end-to-end clustering framework. We design a novel strategy to utilize the contrastive criteria for pushing data-forming clusters directly from raw data, in addition to learning a feature embedding…
In this paper, we prove some combinatorial results on generalized cluster algebras. To be more precisely, we prove that (i) the seeds of a generalized cluster algebra $\mathcal A(\mathcal S)$ whose clusters contain particular cluster…
Using the fact that every worldsheet is ruled by two (light-cone) copies of worldlines, the recent classification of off-shell supermultiplets of N-extended worldline supersymmetry is extended to construct standard off-shell and also…
We study the problem of graph clustering under a broad class of objectives in which the quality of a cluster is defined based on the ratio between the number of edges in the cluster, and the total weight of vertices in the cluster. We show…
We construct a method by which we can calculate the precision with which an algorithm identifies the shape of a cluster. We present our results for several well known clustering algorithms and suggest ways to improve performance for newer…
We develop a version of cluster algebra extending the ring of Laurent polynomials by adding Grassmann variables. These algebras can be described in terms of `extended quivers' which are oriented hypergraphs. We describe mutations of such…
In this paper we introduce a new approach for organizing algebras of global dimension at most 2. We introduce the notion of cluster equivalence for these algebras, based on whether their generalized cluster categories are equivalent. We are…
This paper investigates the finite generation of cluster automorphism groups. By applying the pseudo $\mathbb{N}$-grading introduced in our previous work, we establish a sufficient condition for a cluster automorphism group to be finitely…
We give a simple, local process for nodes in an undirected graph to form non-adjacent clusters that (1) have at most a polylogarithmic diameter and (2) contain at least half of all vertices. Efficient deterministic distributed clustering…
Any cluster-tilted algebra is the relation extension of a tilted algebra. We present a method to, given the distribution of a cluster-tilting object in the Auslander-Reiten quiver of the cluster category, construct all tilted algebras whose…
The aim of this paper is to explain how, through the work of a number of people, some algebraic structures related to groupoids have yielded algebraic descriptions of homotopy n-types. Further, these descriptions are explicit, and in some…
Clustering is one of the fundamental tasks in data analytics and machine learning. In many situations, different clusterings of the same data set become relevant. For example, different algorithms for the same clustering task may return…
The Caldero-Chapoton formula relates for hereditary algebras of Dynkin type the cluster characters of the end terms of an Auslander-Reiten sequence with the cluster character of the middle term. We extend this result to generalized cluster…
The present paper is devoted to clustering geometric graphs. While the standard spectral clustering is often not effective for geometric graphs, we present an effective generalization, which we call higher-order spectral clustering. It…
In this paper, we discuss the generation of symbols (and alphabets) based on specific user requirements (medium, priorities, type of information that needs to be conveyed). A framework for the generation of alphabets is proposed, and its…
We introduce a multivariate generalization of normalized Chebyshev polynomials of the second kind. We prove that these polynomials arise in the context of cluster characters associated to Dynkin quivers of type $\mathbb A$ and…
Let $\CC$ be a Hom-finite triangulated 2-Calabi-Yau category with a cluster-tilting object $T$. Under a constructibility condition we prove the existence of a set $\mathcal G^T(\CC)$ of generic values of the cluster character associated to…