Related papers: On webs, polylogarithms and cluster algebras
We study clustering properties of networks of single integrator nodes over a directed graph, in which the nodes converge to steady-state values. These values define clustering groups of nodes, which depend on interaction topology, edge…
This is a survey on the state-of-the-art of the classification of finite-dimensional complex Hopf algebras. This general question is addressed through the consideration of different classes of such Hopf algebras. Pointed Hopf algebras…
Graph clustering is the problem of identifying sparsely connected dense subgraphs (clusters) in a given graph. Proposed clustering algorithms usually optimize various fitness functions that measure the quality of a cluster within the graph.…
The relative algebraic monodromy of abelian logarithms (defined as the kernel of a map between algebraic monodromy groups attached to an abelian scheme with and without a section) was computed in \cite{A1}: under natural assumptions, this…
In many high-dimensional problems, like sparse-PCA, planted clique, or clustering, the best known algorithms with polynomial time complexity fail to reach the statistical performance provably achievable by algorithms free of computational…
We identify cluster algebras for planar kinematics of conformal Feynman integrals in four dimensions, as sub-algebras of that for top-dimensional $G(4,n)$ corresponding to $n$-point massless kinematics. We provide evidence that they encode…
We construct a cluster algebra structure within the quantum cohomology ring of a quiver variety associated with an $A$-type quiver. Specifically, let $Fl:=Fl(N_1,\ldots,N_{n+1})$ denote a partial flag variety of length $n$, and…
The latest generation of Web search tools is beginning to exploit hypertext link information to improve ranking\cite{Brin98,Kleinberg98} and crawling\cite{Menczer00,Ben-Shaul99etal,Chakrabarti99} algorithms. The hidden assumption behind…
Recent articles have shown the connection between representation theory of quivers and the theory of cluster algebras. In this article, we prove that some cluster algebras of type ADE can be recovered from the data of the corresponding…
We give a complete classification of torsion pairs in the cluster category of Dynkin type A_n. Along the way we give a new combinatorial description of Ptolemy diagrams, an infinite version of which was introduced by Ng. This allows us to…
A fundamental property of complex networks is the tendency for edges to cluster. The extent of the clustering is typically quantified by the clustering coefficient, which is the probability that a length-2 path is closed, i.e., induces a…
As an improvement of the combinatorial realization of totally positive matrices via the essential positive weightings of certain planar network by S.Fomin and A.Zelevisky \cite{[4]}, in this paper, we give the test method of positive…
We consider triangulated orbit categories, with the motivating example of cluster categories, in their usual context of algebraic triangulated categories, then present them from another perspective in the framework of topological…
For a finite-dimensional simple Lie algebra $\mathfrak{g}$ admitting a non-trivial minuscule representation and a connected marked surface $\Sigma$ with at least two marked points and no punctures, we prove that the cluster algebra…
Given a symmetrizable generalized Cartan matrix $A$, for any index $k$, one can define an automorphism associated with $A,$ of the field $\mathbf{Q}(u_1, >..., u_n)$ of rational functions of $n$ independent indeterminates $u_1,..., u_n.$ It…
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,…
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…
For a broad class of models widely used in practice for choice and ranking data based on Luce's choice axiom, including the Bradley--Terry--Luce and Plackett--Luce models, we show that the associated maximum likelihood estimation problems…
In this article we establish some results that allow to deduce the continuity of homomorphisms of (topological) abelian groups from commutative diagrams. In particular, we present a new topological version of the classical Five-Lemma. These…
In this paper, we use subword complexes to provide a uniform approach to finite type cluster complexes and multi-associahedra. We introduce, for any finite Coxeter group and any nonnegative integer k, a spherical subword complex called…