中文
相关论文

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

200 篇论文

Nearest neighbor (k-NN) graphs are widely used in machine learning and data mining applications, and our aim is to better understand what they reveal about the cluster structure of the unknown underlying distribution of points. Moreover, is…

机器学习 · 统计学 2011-05-06 Samory Kpotufe , Ulrike von Luxburg

Graphs are commonly used to characterise interactions between objects of interest. Because they are based on a straightforward formalism, they are used in many scientific fields from computer science to historical sciences. In this paper,…

机器学习 · 统计学 2015-06-24 Pierre Latouche , Fabrice Rossi

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…

组合数学 · 数学 2019-03-19 Jeffrey Beyerl , Cameron Sharpe

We provide multiple combinatorial expansion formulas - in terms of snake graphs, labelled posets, matrices, and $T$-walks - for elements in generalized cluster algebras associated to arcs on punctured orbifolds and illustrate their…

Relationship between agents can be conveniently represented by graphs. When these relationships have different modalities, they are better modelled by multilayer graphs where each layer is associated with one modality. Such graphs arise…

机器学习 · 统计学 2021-03-05 Guillaume Braun , Hemant Tyagi , Christophe Biernacki

Plabic graphs are intimately connected to the positroid stratification of the positive Grassmannian. The duals to these graphs are quivers, and it is possible to associate to them cluster algebras. For the top-cell graph of $Gr_{+}(k,n)$,…

高能物理 - 理论 · 物理学 2015-06-22 Miguel F. Paulos , Burkhard U. W. Schwab

We give a combinatorial intepretation of cluster variables of a specific cluster algebra under a mutation sequence of period 6, in terms of perfect matchings of subgraphs of the brane tiling dual to the quiver associated with the cluster…

组合数学 · 数学 2015-11-20 Sicong Zhang

We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…

量子代数 · 数学 2014-10-01 Adam S. Sikora , Bruce W. Westbury

We define smooth notions of concordance and sliceness for spatial graphs. We prove that sliceness of a spatial graph is equivalent to a condition on a set of linking numbers together with sliceness of a link associated to the graph. This…

几何拓扑 · 数学 2023-07-24 Egor Lappo

This is a survey on stated skein algebras and their representations.

几何拓扑 · 数学 2021-05-21 Julien Korinman

This paper presents a multiscale graph construction method using both graph and signal features. Multiscale graph is a hierarchical representation of the graph, where a node at each level indicates a cluster in a finer resolution. To obtain…

计算机视觉与模式识别 · 计算机科学 2024-11-14 Reina Kaneko , Hayate Kojima , Kenta Yanagiya , Junya Hara , Hiroshi Higashi , Yuichi Tanaka

We study Newton polytopes of cluster variables in type A_n cluster algebras, whose cluster and coefficient variables are indexed by the diagonals and boundary segments of a polygon. Our main results include an explicit description of the…

组合数学 · 数学 2013-10-03 Adam Kalman

With any non necessarily orientable unpunctured marked surface (S,M) we associate a commutative algebra, called quasi-cluster algebra, equipped with a distinguished set of generators, called quasi-cluster variables, in bijection with the…

环与代数 · 数学 2015-02-17 Grégoire Dupont , Frédéric Palesi

In this paper, we systematically study generalized Markov numbers arising from semigroups of reduced integer matrices. This construction allows us to find these numbers by counting perfect matchings of a new family of bipartite graphs,…

组合数学 · 数学 2026-04-21 Oleg Karpenkov , Yefei Ma

Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical clustering. This metric reflects the ability to reconstruct…

社会与信息网络 · 计算机科学 2018-07-16 Thomas Bonald , Bertrand Charpentier

The factor graph of an instance of a symmetric constraint satisfaction problem on n Boolean variables and m constraints (CSPs such as k-SAT, k-AND, k-LIN) is a bipartite graph describing which variables appear in which constraints. The…

计算复杂性 · 计算机科学 2012-05-01 Uriel Feige , Shlomo Jozeph

We give some properties of skew spectrum of a graph, especially, we answer negatively a problem concerning the skew characteristic polynomial and matching polynomial in [M. Cavers et al., Skew-adjacency matrices of graphs, Linear Algebra…

组合数学 · 数学 2013-10-29 Yanna Wang , Bo Zhou

In this work, we introduce a new class of algebras called skew-Brauer graph algebras, which generalize the well-known Brauer graph algebras. We establish that skew-Brauer graph algebras are symmetric and can be defined using a Brauer graph…

表示论 · 数学 2025-11-24 Ana García Elsener , Victoria Guazzelli , Yadira Valdivieso

We introduce and study elementary properties of graph homology of algebras. This new homology theory shares many features of cyclic and Hochschild homology. We also define a graph K-theory together with an analog of Chern character.

K理论与同调 · 数学 2007-05-23 M. V. Movshev

In this paper, we introduce a notion of unistructural cluster algebras, for which the set of cluster variables uniquely determines the clusters. We prove that cluster algebras of Dynkin type and cluster algebras of rank 2 are unistructural,…

表示论 · 数学 2013-07-19 Ibrahim Assem , Ralf Schiffler , Vasilisa Shramchenko