Related papers: The dimer model and dynamical incidence geometry
This paper completes the comprehensive study of the dimer model on infinite minimal graphs with Fock's weights [arXiv:1503.00289] initiated in [arXiv:2007.14699]: the latter article dealt with the elliptic case, i.e., models whose…
A dynamical system with discrete time is studied by means of algebraic geometry. The system admits a reduction that is interpreted as a classical field theory in 2+1-dimensional wholly discrete space-time. The integrals of motion of a…
We study the solutions of the T-system for type A, also known as the octahedron equation, viewed as a 2+1-dimensional discrete evolution equation. These may be expressed entirely in terms of the stepped surface over which the initial data…
This paper introduces the concept of domination in the context of colored graphs (where each color assigns a weight to the vertices of its class), termed up-color domination, where a vertex dominating another must be heavier than the other.…
Many real-world networks evolve dynamically over time and present different types of connections between nodes, often called layers. In this work, we propose a latent position model for these objects, called the dynamic multiplex random dot…
Modeling inter-dependencies between time-series is the key to achieve high performance in anomaly detection for multivariate time-series data. The de-facto solution to model the dependencies is to feed the data into a recurrent neural…
A major application of the mathematical concept of graph in quantum mechanics is to model networks of electrical wires or electromagnetic wave-guides. In this paper, we address the dynamics of a particle trapped on such a network in…
We prove that the fixed point iteration of arbitrary positive concave mappings with nonempty fixed point set converges geometrically for any starting point. We also show that positivity is crucial for this result to hold, and the concept of…
A dimer model is a bipartite graph described on the real two-torus, and it gives the quiver as the dual graph. It is known that for any three-dimensional Gorenstein toric singularity, there exists a dimer model such that a GIT quotient…
The monopole-dimer model introduced recently is an exactly-solvable signed generalisation of the dimer model. We show that the partition function of the monopole-dimer model on a graph invariant under a fixed-point free involution is a…
It is known that statistical model selection as well as identification of dynamical equations from available data are both very challenging tasks. Physical systems behave according to their underlying dynamical equations which, in turn, can…
We revisit the classic problem of determining optimal routes in a graph for transporting two given distributions defined on its nodes, originally studied by Wardrop and Beckmann in the 1950s. The global congestion profile at any given time…
Random intersection graphs containing an underlying community structure are a popular choice for modelling real-world networks. Given the group memberships, the classical random intersection graph is obtained by connecting individuals when…
We collect a number of striking recent results in a study of dimers on infinite regular bipartite lattices and also on regular bipartite graphs. We clearly separate rigorously proven results from conjectures. A primary goal is to show…
We investigate the construction of coherent states for quantum theories of connections based on graphs embedded in a spatial manifold, as in loop quantum gravity. We discuss the many subtleties of the construction, mainly related to the…
We study dynamic graph algorithms in the Massively Parallel Computation model, which was inspired by practical data processing systems. Our goal is to provide algorithms that can efficiently handle large batches of edge insertions and…
Graph matching consists of aligning the vertices of two unlabeled graphs in order to maximize the shared structure across networks; when the graphs are unipartite, this is commonly formulated as minimizing their edge disagreements. In this…
Recently, there has been much interest in spectral approaches to learning manifolds---so-called kernel eigenmap methods. These methods have had some successes, but their applicability is limited because they are not robust to noise. To…
This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching with independent edge weights to geometric models.…
In 2000, Cohn, Kenyon and Propp studied uniformly random perfect matchings of large induced subgraphs of $\mathbb Z^2$ (a.k.a. dimer configurations or domino tilings) and developed a large deviation theory for the associated height…