Related papers: Cluster structures and subfans in scattering diagr…
In the framework of graph property testing, we study the problem of determining if a graph admits a cluster structure. We say that a graph is $(k, \phi)$-clusterable if it can be partitioned into at most $k$ parts such that each part has…
This paper studies clustering algorithms for dynamically evolving graphs $\{G_t\}$, in which new edges (and potential new vertices) are added into a graph, and the underlying cluster structure of the graph can gradually change. The paper…
The theory of cluster algebras of S. Fomin and A. Zelevinsky has assigned a fan to each Dynkin diagram. Then A. Buan, R. Marsh, M. Reineke, I. Reiten and G. Todorov have generalized this construction using arbitrary quivers on Dynkin…
We initiate the study of decorated character stacks and their quantizations using the framework of stratified factorization homology. We thereby extend the construction by Fock and Goncharov of (quantum) decorated character varieties to…
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…
We extend the investigation of the recently introduced class ${\cal S}_k$ of 4d $\mathcal{N}=1$ SCFTs, by considering a large family of quiver gauge theories within it, which we denote $\mathcal{S}^1_k$. These theories admit a realization…
A decorated surface S is an oriented surface with punctures and a finite set of marked points on the boundary, such that each boundary component has a marked point. We introduce ideal bipartite graphs on S. Each of them is related to a…
We use quilted Floer theory to construct functor-valued invariants of tangles arising from moduli spaces of flat bundles on punctured surfaces. As an application, we show the non-triviality of certain elements in the symplectic mapping…
The skein algebra of a marked surface, possibly with punctures, admits the basis of (tagged) bracelet elements constructed by Fock-Goncharov and Musiker-Schiffler-Williams. As a cluster algebra, it also admits the theta basis of…
Our problem of interest is to cluster vertices of a graph by identifying underlying community structure. Among various vertex clustering approaches, spectral clustering is one of the most popular methods because it is easy to implement…
Combinatorial methods are developed to find the cluster coordinates for moduli space of flat connections which is describing the Coulomb branch of higher rank N=2 theories derived by compactifying six dimensional (2,0) theory on a punctured…
We provide a complete classification of the singularities of cluster algebras of finite type with trivial coefficients. Alongside, we develop a constructive desingularization of these singularities via blowups in regular centers over fields…
This is a self-contained exposition of several fundamental properties of cluster scattering diagrams introduced and studied by Gross, Hacking, Keel, and Kontsevich. In particular, detailed proofs are presented for the construction, the…
We define a canonical map from a certain space of laminations on a punctured surface into the quantized algebra of functions on a cluster variety. We show that this map satisfies a number of special properties conjectured by Fock and…
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…
We investigate cluster tilting objects (and subcategories) in triangulated 2-Calabi-Yau categories and related categories. In particular we construct a new class of such categories related to preprojective algebras of non Dynkin quivers…
Gaussian mixture block models are distributions over graphs that strive to model modern networks: to generate a graph from such a model, we associate each vertex $i$ with a latent feature vector $u_i \in \mathbb{R}^d$ sampled from a mixture…
The unsupervised learning of community structure, in particular the partitioning vertices into clusters or communities, is a canonical and well-studied problem in exploratory graph analysis. However, like most graph analyses the…
We use deformations and mutations of scattering diagrams to show that the coefficients of a scattering diagram with initial functions $f1 = (1+tx)^{\mu}$ and $f2 = (1+ty)^{\nu}$ are polynomial in ${\mu}$, ${\nu}$ and non-trivial in a…
We introduce the notion of "binary" positive and complex geometries, giving a completely rigid geometric realization of the combinatorics of generalized associahedra attached to any Dynkin diagram. We also define open and closed "cluster…