Related papers: Ordered Exchange Graphs
In this paper, we study the lattice properties of posets of torsion pairs in the module category of a family of representation-finite gentle algebras called tiling algebras, introduced by Coelho Simoes and Parsons. We present a…
We develop a general theory of cluster categories, applying to a 2-Calabi-Yau extriangulated category $\mathcal{C}$ and cluster-tilting subcategory $\mathcal{T}$ satisfying only mild finiteness conditions. We show that the structure theory…
In this paper we examine the percolation properties of higher-order networks that have non-trivial clustering and subgraph-based assortative mixing (the tendency of vertices to connect to other vertices based on subgraph joint degree). Our…
We investigate the cluster-tilted algebras of finite representation type over an algebraically closed field. We give an explicit description of the relations for the quivers for finite representation type. As a consequence we show that a…
We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense parts of a graph, we concentrate on the structure of edges…
Weakly separated collections arise in the cluster algebra derived from the Pl\"ucker coordinates on the nonnegative Grassmannian. Oh, Postnikov, and Speyer studied weakly separated collections over a general Grassmann necklace $\mathcal{I}$…
Modern graph or network datasets often contain rich structure that goes beyond simple pairwise connections between nodes. This calls for complex representations that can capture, for instance, edges of different types as well as so-called…
Skew-symmetric non-integer matrices with real entries can be viewed as quivers with non-integer weights of arrows. One can mutate such quivers according to usual rules of quiver mutation. Felikson and Tumarkin show that rank 3…
A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is…
Graphs are commonly used to represent and visualize causal relations. For a small number of variables, this approach provides a succinct and clear view of the scenario at hand. As the number of variables under study increases, the graphical…
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…
We study the oriented exchange graph $\textrm{EG}^\circ(\Gamma_{N}\,Q)$ of reachable hearts in the finite-dimensional derived category $\mathcal{D}(\Gamma_{N}\,Q)$ of the CY-$N$ Ginzburg algebra $\Gamma_{N}Q$ associated to an acyclic quiver…
A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. A split comparability graph is a split graph which is transitively orientable. In this work, we characterize split comparability graphs in…
Higher-order connectivity patterns such as small induced sub-graphs called graphlets (network motifs) are vital to understand the important components (modules/functional units) governing the configuration and behavior of complex networks.…
We introduce a class of non-commutative algebras that carry a non-commutative (geometric) cluster structure which are generated by identical copies of generalized Weyl algebras. Equivalent conditions for the finiteness of the set of the…
The purpose of this paper is to give an explicit formula for the number of non-isomorphic cluster-tilted algebras of type $A_n$, by counting the mutation class of any quiver with underlying graph $A_n$. It will also follow that if $T$ and…
Admissible chains of i-boxes are important combinatorial tools in the monoidal categorification of cluster algebras, as they provide seeds of the cluster algebra. In this paper, we explore the properties of maximal commuting families of…
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…
Directed graphs occur throughout statistical modeling of networks, and exchangeability is a natural assumption when the ordering of vertices does not matter. There is a deep structural theory for exchangeable undirected graphs, which…
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…