相关论文: Snake graph calculus and cluster algebras from sur…
Graph-based clustering has shown promising performance in many tasks. A key step of graph-based approach is the similarity graph construction. In general, learning graph in kernel space can enhance clustering accuracy due to the…
Graph clustering aims at discovering a natural grouping of the nodes such that similar nodes are assigned to a common cluster. Many different algorithms have been proposed in the literature: for simple graphs, for graphs with attributes…
The ${\rm SL}_n$-skein algebra of a punctured surface $\mathfrak{S}$, studied by Sikora, is an algebra generated by isotopy classes of $n$-webs living in the thickened surface $\mathfrak{S} \times (-1,1)$, where an $n$-web is a union of…
A hierarchical structure describing the inter-relationships of species has long been a fundamental concept in systematic biology, from Linnean classification through to the more recent quest for a 'Tree of Life.' In this paper we use an…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
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 analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…
The intersection graph of a family of sets $\{S_{1},S_{2},\ldots,S_{n}\}$ is a graph whose vertex set is $\{S_{1},S_{2},\ldots,S_{n}\}$ and two distinct vertices are adjacent if the intersection of the corresponding sets is non-empty.…
Spectral clustering has become one of the most widely used clustering techniques when the structure of the individual clusters is non-convex or highly anisotropic. Yet, despite its immense popularity, there exists fairly little theory about…
We generalize finite-sample bounds for convex clustering to the setting where affinity weights appearing in the objective correspond to a general connected graph. These bounds and their analysis lead to a better understanding of clustering…
We explore a generalization of the Markov numbers that is motivated by a specific generalized cluster algebra arising from an orbifold, in the sense of Chekhov and Shapiro. We give an explicit algorithm for computing these generalized…
A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspects of closed graphs, including the number of closed labelings…
For every positive integer $n$, we find a complete classification for planar graphs according to the collection of numbers of common neighbours for every $n$-tuple of distinct vertices. Our results expand the literature on planar graphical…
A connected graph can be associated with two distinct evolution algebras. In the first case, the structural matrix is the adjacency matrix of the graph itself. In the second case, the structural matrix is the transition probabilities matrix…
We review how the (quantum) cluster algebra naturally emerges in the study of four-dimensional $\mathcal{N}=2$ supersymmetric gauge theories.
Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding…
Given the widespread popularity of spectral clustering (SC) for partitioning graph data, we study a version of constrained SC in which we try to incorporate the fairness notion proposed by Chierichetti et al. (2017). According to this…
Spectral clustering is a popular algorithm that clusters points using the eigenvalues and eigenvectors of Laplacian matrices derived from the data. For years, spectral clustering has been working mysteriously. This paper explains spectral…
We construct scattering diagrams for Chekhov-Shapiro's generalized cluster algebras where exchange polynomials are factorized into binomials, generalizing the cluster scattering diagrams of Gross, Hacking, Keel and Kontsevich. They turn out…
Given a 3-manifold $M$, and a branched cover arising from the projection of a Lagrangian 3-manifold $L$ in the cotangent bundle of $M$ to the zero-section, we define a map from the skein of $M$ to the skein of $L$, via the skein-valued…