Related papers: Dimers, networks, and cluster integrable systems
There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…
We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one,…
We consider a type of distance-regular graph $\Gamma=(X, \mathcal R)$ called a bilinear forms graph. We assume that the diameter $D$ of $\Gamma$ is at least $3$. Fix adjacent vertices $x,y \in X$. In our first main result, we introduce an…
Following [42], positroid cells ${\mathcal S}_{\mathcal M}^{\mbox{TNN}}$ in totally non-negative Grassmannians ${Gr^{\mbox{TNN}} (k,n)}$ admit parametrizations by positive weights on planar bicolored directed perfect networks in the disk.…
Network models with latent geometry have been used successfully in many applications in network science and other disciplines, yet it is usually impossible to tell if a given real network is geometric, meaning if it is a typical element in…
The homology of Kontsevich's commutative graph complex parameterizes finite type invariants of odd dimensional manifolds. This {\it graph homology} is also the twisted homology of Outer Space modulo its boundary, so gives a nice point of…
The dimer model on a graph embedded in the torus can be interpreted as a collection of random self-avoiding loops. In this paper, we consider the uniform toroidal honeycomb dimer model. We prove that when the mesh of the graph tends to zero…
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…
We propose two related unsupervised clustering algorithms which, for input, take data assumed to be sampled from a uniform distribution supported on a metric space $X$, and output a clustering of the data based on the selection of a…
We prove that the partition function for tripartite double-dimer configurations of a planar bipartite graph satisfies a recurrence related to the Desnanot-Jacobi identity from linear algebra. A similar identity for the dimer partition…
In his seminal paper published in 2000 Kenyon developed a method to study the height function of the planar dimer model via discrete complex analysis tools. The core of this method is a set of identities representing height correlations…
The standard parametrization of totally non-negative Grassmannians was obtained by A. Postnikov [45] introducing the boundary measurement map in terms of discrete path integration on planar bicolored (plabic) graphs in the disk. An…
Grouping the nodes of a graph into clusters is a standard technique for studying networks. We study a problem where we are given a directed network and are asked to partition the graph into a sequence of coherent groups. We assume that…
We first give an exposition of how the Polyakov path integral for the bosonic string produces a natural mapping class group invariant measure, $d(Poly)$, on the Teichm\"uller space of Riemann surfaces of each fixed genus. The description of…
Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…
We describe the upper seminormal crystal structure for the $\mu$-supported $\delta$-vectors for any quiver with potential with reachable frozen vertices, or equivalently for the tropical points of the corresponding cluster $\mc{X}$-variety.…
The double-dimer model consists in superimposing two independent, identically distributed perfect matchings on a planar graph, which produces an ensemble of non-intersecting loops. Kenyon established conformal invariance in the small mesh…
We describe the Poisson ideals and attached symplectic geometry of a cluster algebra with compatible Poisson structure. We apply these results to determine the spectrum of a quantum cluster algebra. As an application, we describe the…
We prove some finiteness results for discrete isometry groups $\Gamma$ of uniformly packed CAT$(0)$-spaces $X$ with uniformly bounded codiameter (up to group isomorphism), and for CAT$(0)$-orbispaces $M = \Gamma \backslash X$ (up to…
In this paper, we establish a method for model order reduction of a certain class of physical network systems. The proposed method is based on clustering of the vertices of the underlying graph, and yields a reduced order model within the…