Related papers: Rooted Clusters for Graph LP Algebras
A major direction in the theory of cluster algebras is to construct (quantum) cluster algebra structures on the (quantized) coordinate rings of various families of varieties arising in Lie theory. We prove that all algebras in a very large…
We introduce a new class of combinatorial objects, named tight gradings, which are certain nonnegative integer-valued functions on maximal Dyck paths. Using tight gradings, we derive a manifestly positive formula for any wall-function in a…
Clustering graphs based on a comparison of the number of links within clusters and the expected value of this quantity in a random graph has gained a lot of attention and popularity in the last decade. Recently, Aldecoa and Marin proposed a…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…
We investigate random partitions of complete graphs defined by Poissonian emsembles of Markov loops
Motivated by applications in social and biological network analysis, we introduce a new form of agnostic clustering termed~\emph{motif correlation clustering}, which aims to minimize the cost of clustering errors associated with both edges…
In this work we develop a theory of hierarchical clustering for graphs. Our modeling assumption is that graphs are sampled from a graphon, which is a powerful and general model for generating graphs and analyzing large networks. Graphons…
We introduce a variant of stable logarithmic maps, which we call punctured logarithmic maps. They allow an extension of logarithmic Gromov-Witten theory in which marked points have a negative order of tangency with boundary divisors. As a…
Clustering is a fundamental property of complex networks and it is the mathematical expression of a ubiquitous phenomenon that arises in various types of self-organized networks such as biological networks, computer networks or social…
A Leavitt labelled path algebra over a commutative unital ring is associated with a labelled space, generalizing Leavitt path algebras associated with graphs and ultragraphs as well as torsion-free commutative algebras generated by…
Generalizing the notion of a multiplicative inequality among minors of a totally positive matrix, we describe, over full rank cluster algebras of finite type, the cone of Laurent monomials in cluster variables that are bounded as a…
The cluster-tilted algebras have been introduced by Buan, Marsh and Reiten, they are the endomorphism rings of cluster-tilting objects $T$ in cluster categories; we call such an algebra cluster-concealed in case $T$ is obtained from a…
Graph clustering is a fundamental problem that has been extensively studied both in theory and practice. The problem has been defined in several ways in literature and most of them have been proven to be NP-Hard. Due to their high practical…
We show that having any planar (cyclic or acyclic) directed network on a disc with the only condition that all $n_1+m$ sources are separated from all $n_2+m$ sinks, we can construct a cluster-algebra realization of elements of an affine…
The second author showed how Katsura's construction of the C*-algebra of a topological graph E may be twisted by a Hermitian line bundle L over the edge space E. The correspondence defining the algebra is obtained as the completion of the…
Local graph clustering methods aim to find small clusters in very large graphs. These methods take as input a graph and a seed node, and they return as output a good cluster in a running time that depends on the size of the output cluster…
Originally, tangles were invented as an abstract tool in mathematical graph theory to prove the famous graph minor theorem. In this paper, we showcase the practical potential of tangles in machine learning applications. Given a collection…
In this paper, we study the Newton polytopes of $F$-polynomials in a TSSS cluster algebra $\mathcal A$ and generalize them to a larger set consisting of polytopes $N_{h}$ associated to vectors $h\in\Z^{n}$ as well as $\widehat{\mathcal{P}}$…
This paper studies cluster algebras locally, by identifying a special class of localizations which are themselves cluster algebras. A `locally acyclic cluster algebra' is a cluster algebra which admits a finite cover (in a geometric sense)…
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…