Related papers: The dimer model and dynamical incidence geometry

An edge of a graph dominates itself along with any edge that shares an endpoint with it. An efficient edge dominating set (also called a dominating induced matching, DIM) is a subset of edges such that each edge of the graph is dominated by…

We consider two different versions of the double dimer model on a planar domain, where we either fold a single dimer cover on a symmetric domain onto itself across the line of symmetry, or we superimpose two independent dimer covers on two,…

An emerging way of tackling the dimensionality issues arising in the modeling of a multivariate process is to assume that the inherent data structure can be captured by a graph. Nevertheless, though state-of-the-art graph-based methods have…

We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with…

We study close-packed dimers on the quasiperiodic Ammann-Beenker (AB) graph, that was recently shown to have the unusual feature that hard-core dimer constraints are exactly reproduced at successive discrete length scales. This observation…

In this work, we construct different classes of coherent states related to a quantum system, recently studied in [1], of an electron moving in a plane in uniform external magnetic and electric fields which possesses both discrete and…

In this pedagogical paper we review the discrete symmetries of the Dirac equation using elementary tools, but in a comparative order: the usual 3 + 1 dimensional case and the 2 + 1 dimensional case. Motivated by new applications of the 2d…

We consider a discrete-time dynamical system in a car-following context. The system was recently introduced to parsimoniously model human driving behavior based on utility maximization. The parameters of the model were calibrated using…

We study the eight-vertex model at its free-fermion point. We express a new "switching" symmetry of the model in several forms: partition functions, order-disorder variables, couplings, Kasteleyn matrices. This symmetry can be used to…

In a previous paper, we showed how certain orientations of the edges of a graph G embedded in a closed oriented surface S can be understood as discrete spin structures on S. We then used this correspondence to give a geometric proof of the…

Biological and cellular systems are often modeled as graphs in which vertices represent objects of interest (genes, proteins, drugs) and edges represent relational ties among these objects (binds-to, interacts-with, regulates). This…

Discrete-time regulatory networks are dynamical systems on directed graphs, with a structure inspired on natural systems of interacting units. There is a natural notion of determination amongst vertices, which we use to classify the nodes…

We study a general class of easy-axis spin models on a lattice of corner sharing even-sided polygons with all-to-all interactions within a plaquette. The low energy description corresponds to a quantum dimer model on a dual lattice of even…

Starting from the geometric description of quantum systems, we propose a novel approach to time-independet dissipative quantum processes according to which the energy is dissipated but the coherence of the states is preserved. Our proposal…

We consider reaction-diffusion equations on the planar square lattice that admit spectrally stable planar travelling wave solutions. We show that these solutions can be continued into a branch of travelling corners. As an example, we…

In the present work, using the recently introduced framework of local geometric deformations, special types of vector fields - so-called hidden Killing vector fields - are constructed, which solve the Killing equation not globally, but only…

Quantum graphs and their experimental counterparts, microwave networks, are ideally suited to study the spectral statistics of chaotic systems. The graph spectrum is obtained from the zeros of a secular determinant derived from energy and…

The ability to control a complex network towards a desired behavior relies on our understanding of the complex nature of these social and technological networks. The existence of numerous control schemes in a network promotes us to wonder:…

A hydrodynamical description of coherent instabilities that take place in the longitudinal dynamics of a charged-particle coasting beam in a high-energy accelerating machine is presented. This is done in the framework of the Madelung fluid…

In recent decades, it has been emphasized that the evolving structure of networks may be shaped by interaction principles that yield sparse graphs with a vertex degree distribution exhibiting an algebraic tail, and other structural traits…