Related papers: Snake graph calculus and cluster algebras from sur…
We introduce a spatial graph and hypergraph model that smoothly interpolates between a graph with purely pairwise edges and a graph where all connections are in large hyperedges. The key component is a spatial clustering resolution…
To a compact oriented surface of genus at most one with boundary, we associate a quantized $K$-theoretic Coulomb branch in the sense of Braverman, Finkelberg, and Nakajima. In the case where the surface is a three- or four-holed sphere or a…
We study the cluster categories arising from marked surfaces (with punctures and non-empty boundaries). By constructing skewed-gentle algebras, we show that there is a bijection between tagged curves and string objects. Applications include…
The purpose of this paper is to analyze the degree index and clustering index in random graphs. The degree index in our setup is a certain measure of degree irregularity whose basic properties are well studied in the literature, and the…
A split graph is a graph whose vertices can be partitioned into a clique and a stable set. We investigate the combinatorial species of split graphs, providing species-theoretic generalizations of enumerative results due to B\'ina and…
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…
We show that the problem of identifying different signal components from a time-frequency representation can be equivalently phrased as a graph clustering problem: given a graph $G=(V,E)$ one aims to identify `clusters', subgraphs that are…
Spectral clustering is a powerful technique for clustering high-dimensional data, utilizing graph-based representations to detect complex, non-linear structures and non-convex clusters. The construction of a similarity graph is essential…
Graph theory provides a language for studying the structure of relations, and it is often used to study interactions over time too. However, it poorly captures the both temporal and structural nature of interactions, that calls for a…
How can we find a good graph clustering of a real-world network, that allows insight into its underlying structure and also potential functions? In this paper, we introduce a new graph clustering algorithm Dcut from a density point of view.…
- A hamiltonian graph $G$ verifying $e(G)>n(k-1)/2$ %with a vertex of degree greater or equal than $k$ contains any $k$-spider. - If $G$ is a graph with average degree $\bar{d} > k-1$, then every spider of size $k$ is contained in $G$ for…
Spectral clustering is one of the most popular clustering methods for finding clusters in a graph, which has found many applications in data mining. However, the input graph in those applications may have many missing edges due to error in…
Scene graph is a structured representation of a scene that can clearly express the objects, attributes, and relationships between objects in the scene. As computer vision technology continues to develop, people are no longer satisfied with…
A regularized optimization problem over a large unstructured graph is studied, where the regularization term is tied to the graph geometry. Typical regularization examples include the total variation and the Laplacian regularizations over…
An important problem in the theory of cluster algebras is to compute the fundamental group of the exchange graph. A non-trivial closed loop in the exchange graph, for example, generates a non-trivial identity for the classical and quantum…
We prove that each semi-invariant ring of the complete triple flag of length $n$ is an upper cluster algebra associated to an ice hive quiver. We find a rational polyhedral cone ${\sf G}_n$ such that the generic cluster character maps its…
We study the cluster algebra of the kinematic configuration space $Conf_n(\mathbb{P}^3)$ of a n-particle scattering amplitude restricted to the special 2D kinematics. We found that the n-points two loop MHV remainder function found in…
We describe an explicit finite presentation for a finite depth subfactor planar algebra. We also show that such planar algebras are singly generated with the generator subject to finitely many relations.
We describe and compare algorithms for computing supersingular isogeny graphs. Along the way, we obtain a formula for the trace of the adjacency matrix of a general supersingular isogeny graph, and we prove a conjecture recently posed by…
Let $\Delta$ be an oriented valued graph equipped with a group of admissible automorphisms satisfying a certain stability condition. We prove that the (coefficient-free) cluster algebra $\mathcal A(\Delta/G)$ associated to the valued…