Related papers: Rooted Clusters for Graph LP Algebras
We define a new algebra associated to a Legendrian submanifold $\Lambda$ of a contact manifold of the form $\mathbb{R}_{t} \times W$, called the planar diagram algebra and denoted $PDA(\Lambda, \mathcal{P})$. It is a non-commutative,…
We construct common triangular bases for almost all the known (quantum) cluster algebras from Lie theory. These bases provide analogs of the dual canonical bases, long anticipated in cluster theory. In cases where the generalized Cartan…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
We construct a representation of the braid groups in a cluster C*-algebra coming from a triangulation of the Riemann surface S with one or two cusps. It is shown that the Laurent polynomials attached to the K-theory of such an algebra are…
This paper demonstrates that the homogeneous coordinate ring of the Grassmannian $\Bbb{G}(k,n)$ is a {\it cluster algebra of geometric type} - as defined by S. Fomin and A. Zelevinsky. Grassmannians having {\it finite cluster type} are…
We introduce a family of maps parametrised by certain ribbon graphs. It is based on a connection in non-commutative geometry and contains the double divergence as a special case. Applying the construction to the case of the group algebra of…
An LR-structure is a tetravalent vertex-transitive graph together with a special type of a decomposition of its edge-set into cycles. LR-structures were introduced in a paper by P. Poto\v{c}nik and S. Wilson, titled `Linking rings…
A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a…
This contribution proposes a new approach towards developing a class of probabilistic methods for classifying attributed graphs. The key concept is random attributed graph, which is defined as an attributed graph whose nodes and edges are…
For any cluster algebra whose underlying combinatorial data can be encoded by a bordered surface with marked points, we construct a geometric realization in terms of suitable decorated Teichmueller space of the surface. On the geometric…
Based on Hopf algebra of rooted trees introduced by Connes and Kreimer, we construct a class of linear maps on noncommutative polynomial algebra in two indeterminates, namely rooted tree maps. We also prove that their maps induce a class of…
Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of…
In math.QA/0506507 I. Gelfand and the authors introduced and studied a new class of algebras associated to directed graphs. In this paper we show that these algebras are Koszul for a large class of layered (i.e. ranked) graphs.
Graph-theoretical approach is used to study cluster formation in mesocsopic systems. Appearance of these clusters are due to discrete resonances which are presented in the form of a multigraph with labeled edges. This presentation allows to…
In this note, we study Laplacians on graphs for which connectivity within certain subgraphs tends to infinity. Our main focus are graphs sharing a common node set on which edge weights within certain clusters grow to infinity. As…
We consider the clustering problem of attributed graphs. Our challenge is how we can design an effective and efficient clustering method that precisely captures the hidden relationship between the topology and the attributes in real-world…
This paper investigates graph clustering in the planted cluster model in the presence of {\em small clusters}. Traditional results dictate that for an algorithm to provably correctly recover the clusters, {\em all} clusters must be…
Every directed graph defines a Hilbert space and a family of weighted shifts that act on the space. We identify a natural notion of periodicity for such shifts and study their C*-algebras. We prove the algebras generated by all shifts of a…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
Plabic graphs are interesting combinatorial objects used to study the totally nonnegative Grassmannian. Faces of plabic graphs are labeled by $k$-element sets of positive integers, and a collection of such $k$-element sets are the face…