相关论文: Snake graph calculus and cluster algebras from sur…

A cluster graph is a graph whose every connected component is a complete graph. Given a simple undirected graph $G$, a subset of vertices inducing a cluster graph is called an independent union of cliques (IUC), and the IUC polytope…

We describe proper correspondences from graph C*-algebras to arbitrary C*-algebras by K-theoretic data. If the target C*-algebra is a graph C*-algebra as well, we may lift an isomorphism on a certain invariant to correspondences back and…

This article presents a survey of some recent results in the theory of spatial graphs. In particular, we highlight results related to intrinsic knotting and linking and results about symmetries of spatial graphs. In both cases we consider…

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…

Let X be a smooth projective curve over a finite field. We describe H, the full Hall algebra of vector bundles X as a Feigin-Odesskii shuffle algebra. This shuffle algebra corresponds to the scheme S of all cusp eigenforms and to the…

We study clustering on graphs with multiple edge types. Our main motivation is that similarities between objects can be measured in many different metrics. For instance similarity between two papers can be based on common authors, where…

We give combinatorial formulas for the Laurent expansion of any cluster variable in any cluster algebra coming from a triangulated surface (with or without punctures), with respect to an arbitrary seed. Moreover, we work in the generality…

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…

We define a new way to evaluate MOY graphs. We prove that this new evaluation coincides with the classical evaluation by checking some skein relations. As a consequence, we prove a formula which relates the $\mathfrak{sl}_N$ and…

Subspace clustering is the problem of clustering data points into a union of low-dimensional linear/affine subspaces. It is the mathematical abstraction of many important problems in computer vision, image processing and machine learning. A…

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…

We develop unbiased strategies to probabilistic T-wave snowball sampling from graphs, where the interest of estimation may concern finite-order subgraphs such as triangles, cycles or stars. Our approaches encompass also the…

In this article we explain how the coordinate ring of each (open) Schubert variety in the Grassmannian can be identified with a cluster algebra, whose combinatorial structure is encoded using (target labelings of) Postnikov's plabic graphs.…

A characterization is given for directed graphs that yield graph $C^*$-algebras with continuous trace. This is established for row-finite graphs with no sources first using a groupoid approach, and extended to the general case via the…

Skein algebras of surfaces quantize character varieties of topological surfaces, and in low genus, these quantizations are often related to algebras arising in representation theory. For example, Terwilliger defined a universal $SL_2$…

An operation on species corresponding to the inner plethysm of their associated cycle index series is constructed. This operation, the inner plethysm of species, is generalized to n-sorted species. Polynomial maps on species are studied and…

Let $G=(V,E)$ be a graph of order $n$ and let $1\leq k< n$ be an integer. The $k$-token graph of $G$ is the graph whose vertices are all the $k$-subsets of $V$, two of which are adjacent whenever their symmetric difference is a pair of…

Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…

We consider the problem of estimating the number of clusters (k) in a dataset. We propose a non-parametric approach to the problem that utilizes similarity graphs to construct a robust statistic that effectively captures similarity…

Solutions to the Markov equation appear in many mathematical contexts. We aim to build on the understanding of them by proving a recent conjecture about Markov polynomials; solutions to a generalised version of the Markov equation. The…