English
Related papers

Related papers: Combinatorial cluster expansion formulas from tria…

200 papers

We study the deformation theory of the Stanley-Reisner rings associated to cluster complexes for skew-symmetrizable cluster algebras of geometric and finite cluster type. In particular, we show that in the skew-symmetric case, these cluster…

Algebraic Geometry · Mathematics 2025-03-03 Nathan Ilten , Alfredo Nájera Chávez , Hipolito Treffinger

We give new rounding schemes for the standard linear programming relaxation of the correlation clustering problem, achieving approximation factors almost matching the integrality gaps: - For complete graphs our appoximation is $2.06 -…

Data Structures and Algorithms · Computer Science 2015-06-25 Shuchi Chawla , Konstantin Makarychev , Tselil Schramm , Grigory Yaroslavtsev

We develop a cluster expansion for the probability of full connectivity of high density random networks in confined geometries. In contrast to percolation phenomena at lower densities, boundary effects, which have previously been largely…

Disordered Systems and Neural Networks · Physics 2015-06-03 Justin Coon , Carl P. Dettmann , Orestis Georgiou

We generalize the technique of linked cluster expansions on hypercubic lattices to actions that couple fields at lattice sites which are not nearest neighbours. We show that in this case the graphical expansion can be arranged in such a way…

High Energy Physics - Lattice · Physics 2009-10-28 A. Pordt , T. Reisz

We propose a skein model for the quantum cluster algebras of surface type with coefficients. We introduce a skein algebra $\mathscr{S}_{\Sigma,\mathbb{W}}^{A}$ of a walled surface $(\Sigma,\mathbb{W})$, and prove that it has a quantum…

Geometric Topology · Mathematics 2024-08-23 Tsukasa Ishibashi , Shunsuke Kano , Wataru Yuasa

We develop a systematic cluster expansion for dilute systems in the highly dilute phase. We first apply it to the calculation of the entropy of the K-satisfiability problem in the satisfiable phase. We derive a series expansion in the…

Statistical Mechanics · Physics 2009-11-07 Guilhem Semerjian , Leticia F. Cugliandolo

Two theorems on the theory of cluster expansions for an abstract polymer system are reported.

Statistical Mechanics · Physics 2012-06-20 Salvador Miracle-Sole

The cluster expansion formalism used in materials science is reconstructed on an axiomatic basis with the aims of clarifying underlying concepts and improving computational procedures, and without using conventional cluster functions.…

Materials Science · Physics 2022-10-21 Paul E. Lammert , Vincent H. Crespi

It is proved that the K_0-group of a cluster C*-algebra is isomorphic to the corresponding cluster algebra. As a corollary, one gets a shorter proof of the positivity conjecture for cluster algebras. As an example, we consider a cluster…

Operator Algebras · Mathematics 2020-09-07 Igor Nikolaev

We prove a generalization of the Expander Mixing Lemma for arbitrary (finite) simplicial complexes. The original lemma states that concentration of the Laplace spectrum of a graph implies combinatorial expansion (which is also referred to…

Combinatorics · Mathematics 2018-04-11 Ori Parzanchevski

For an unpunctured marked surface $\Sigma$, we consider a skein algebra $\mathscr{S}_{\mathfrak{sl}_{3},\Sigma}^{q}$ consisting of $\mathfrak{sl}_3$-webs on $\Sigma$ with the boundary skein relations at marked points. We construct a quantum…

Geometric Topology · Mathematics 2024-08-23 Tsukasa Ishibashi , Wataru Yuasa

Bipartite Correlation clustering is the problem of generating a set of disjoint bi-cliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. The number or size of the output clusters is not constrained…

Data Structures and Algorithms · Computer Science 2010-12-15 Nir Ailon , Noa Avigdor-Elgrabli , Edo Liberty

We present a new and very concrete connection between cluster algebras and knot theory. This connection is being made via continued fractions and snake graphs. It is known that the class of 2-bridge knots and links is parametrized by…

Geometric Topology · Mathematics 2017-11-17 Kyungyong Lee , Ralf Schiffler

In this paper we show that expansion of a Buchsbaum simplicial complex is $CM_t$, for an optimal integer $t\geq 1$. Also, by imposing extra assumptions on a $CM_t$ simplicial complex, we prove that it can be obtained from a Buchsbaum…

Commutative Algebra · Mathematics 2017-01-19 Rahim Rahmati-Asghar

Clustering large, mixed data is a central problem in data mining. Many approaches adopt the idea of k-means, and hence are sensitive to initialisation, detect only spherical clusters, and require a priori the unknown number of clusters. We…

Machine Learning · Statistics 2020-11-13 Joshua Tobin , Mimi Zhang

We study the clustering problem for mixtures of bounded covariance distributions, under a fine-grained separation assumption. Specifically, given samples from a $k$-component mixture distribution $D = \sum_{i =1}^k w_i P_i$, where each $w_i…

Machine Learning · Computer Science 2023-12-20 Ilias Diakonikolas , Daniel M. Kane , Jasper C. H. Lee , Thanasis Pittas

We attempt to relate two recent developments: cluster algebras associated to triangulations of surfaces by Fomin-Shapiro-Thurston, and quivers with potentials and their mutations introduced by Derksen-Weyman-Zelevinsky. To each ideal…

Representation Theory · Mathematics 2014-02-26 Daniel Labardini-Fragoso

We show that for $2\le d\le 4$, every finite geometric simplicial complex $\Delta$ in $\mathbb{R}^d$ with vertices on the moment curve can be extended to a triangulation $T$ of the cyclic polytope $C$ where $\Delta, T$ and $C$ all have the…

Combinatorics · Mathematics 2025-11-21 Seunghun Lee , Eran Nevo

We give a quiver representation theoretic interpretation of generalized cluster complexes defined by Fomin and Reading. By using $d-$cluster categories which are defined by Keller as triangulated orbit categories of (bounded) derived…

Representation Theory · Mathematics 2007-06-13 Bin Zhu

Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to cluster, compute the first k eigenvectors of its Laplacian matrix…

Data Structures and Algorithms · Computer Science 2016-05-24 Nicolas Tremblay , Gilles Puy , Remi Gribonval , Pierre Vandergheynst
‹ Prev 1 4 5 6 7 8 10 Next ›