Related papers: The dimer model and dynamical incidence geometry
We study the number of tilings of skew Young diagrams by ribbon tiles shaped like Dyck paths, in which the tiles are "vertically decreasing". We use these quantities to compute pairing probabilities in the double-dimer model: Given a planar…
We present a graph model for a background independent, relational approach to spacetime emergence. The general idea and the graph main features, detailed in [1], are discussed. This is a combinatorial (dynamical) metric graph, colored on…
We introduce the notion of P-polynomial coherent configurations and show that they can have at most two fibres. We then introduce a class of two-fibre coherent configurations which have two distinguished bases for the coherent algebra,…
The subject of the work are pairs of linearly coupled PT-symmetric dimers. Two different settings are introduced, namely, straight-coupled dimers, where each gain site is linearly coupled to one gain and one loss site, and cross-coupled…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
In this paper, motivated by a question posed in \cite{AH}, we introduce strongly biconvex graphs as a subclass of weakly chordal and bipartite graphs. We give a linear time algorithm to find an induced matching for such graphs and we prove…
Consider a graph whose vertices are colored in one of two colors, say black or white. A white vertex is called integrated if it has at least as many black neighbors as white neighbors, and similarly for a black vertex. The coloring as a…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
We study planar "vertex" models, which are probability measures on edge subsets of a planar graph, satisfying certain constraints at each vertex, examples including dimer model, and 1-2 model, which we will define. We express the local…
For networks of coupled dynamical systems we characterize admissible functions, that is, functions whose gradient is an admissible vector field. The schematic representation of a gradient network dynamical system is of an undirected cell…
We demonstrate how large classes of discrete and continuous statistical distributions can be incorporated into coherent states, using the concept of a reproducing kernel Hilbert space. Each family of coherent states is shown to contain, in…
Graph deep learning models, such as graph convolutional networks (GCN) achieve remarkable performance for tasks on graph data. Similar to other types of deep models, graph deep learning models often suffer from adversarial attacks. However,…
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This model gets to…
This paper considers synchronous discrete-time dynamical systems on graphs based on the threshold model. It is well known that after a finite number of rounds these systems either reach a fixed point or enter a 2-cycle. The problem of…
We show that the dimer model on a bipartite graph on a torus gives rise to a quantum integrable system of special type - a cluster integrable system. The phase space of the classical system contains, as an open dense subset, the moduli…
A configuration of the triple $(\mathcal{P}, \mathcal{L}, \mathcal{I})$ on the incidence relation which holds the properties of "Any two points are incident with at most one line" and "Any two lines are incident with at most one point". In…
A variational model for describing the morphology of two-phase continua by allowing for the interplay between coherent and incoherent interfaces is introduced. Coherent interfaces are characterized by the microscopical arrangement of atoms…
We revisit the classical hard-core model, also known as independent set and dual to vertex cover problem, where one puts particles with a first-neighbor hard-core repulsion on the vertices of a random graph. Although the case of random…
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…
Geometric data analysis and learning has emerged as a distinct and rapidly developing research area, increasingly recognized for its effectiveness across diverse applications. At the heart of this field lies curvature, a powerful and…