Related papers: Higher-rank dimer models
Our work deals with symmetric rational functions and probabilistic models based on the fully inhomogeneous six vertex (ice type) model satisfying the free fermion condition. Two families of symmetric rational functions $F_\lambda,G_\lambda$…
A graph $G$ is $\{F_{1}, F_{2},\dots,F_{k}\}$-free if $G$ contains no induced subgraph isomorphic to any $F_{i}$ $(1\leq i \leq k)$. A connected graph $G$ is a split graph if its vertex set can be partitioned into a clique and an…
We prove that any link admitting a diagram with a single negative crossing is strongly quasipositive. This answers a question of Stoimenow's in the (strong) positive. As a second main result, we give simple and complete characterizations of…
In this work, we consider the problem of combining link, content and temporal analysis for community detection and prediction in evolving networks. Such temporal and content-rich networks occur in many real-life settings, such as…
A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…
Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in multiple fields…
We establish a correspondence between the dimer model on a bipartite graph and a circle pattern with the combinatorics of that graph, which holds for graphs that are either planar or embedded on the torus. The set of positive face weights…
We consider the $\Pi$-free Deletion problem parameterized by the size of a vertex cover, for a range of graph properties $\Pi$. Given an input graph $G$, this problem asks whether there is a subset of at most $k$ vertices whose removal…
The permanent-determinant method and its generalization, the Hafnian-Pfaffian method, are methods to enumerate perfect matchings of plane graphs that was discovered by P. W. Kasteleyn. We present several new techniques and arguments related…
A matching $M$ in a graph $G$ is {\em connected} if $G$ has an edge linking each pair of edges in $M$. The problem to find large connected matchings in graphs $G$ with $\alpha(G)=2$ is closely related to Hadwiger's conjecture for graphs…
In the past, the dichotomy between homophily and heterophily has inspired research contributions toward a better understanding of Deep Graph Networks' inductive bias. In particular, it was believed that homophily strongly correlates with…
This paper presents some parallel developments in Quiver/Dimer Models, Hypergeometric Systems and Dessins d'Enfants. The setting in which Gelfand, Kapranov and Zelevinsky have formulated the theory of hypergeometric systems, provides also a…
A digraph is strongly connected if it has a directed path from $x$ to $y$ for every ordered pair of distinct vertices $x, y$ and it is strongly $k$-connected if it has at least $k+1$ vertices and remains strongly connected when we delete…
Linde, Moore, and Nordahl introduced a generalisation of the honeycomb dimer model to higher dimensions. The purpose of this article is to describe a number of structural properties of this generalised model. First, it is shown that the…
We consider two types of matroids defined on the edge set of a graph $G$: count matroids ${\cal M}_{k,\ell}(G)$, in which independence is defined by a sparsity count involving the parameters $k$ and $\ell$, and the (three-dimensional…
We study bilinear embedding models for the task of multi-relational link prediction and knowledge graph completion. Bilinear models belong to the most basic models for this task, they are comparably efficient to train and use, and they can…
We initiate the algorithmic study of the following "structured augmentation" question: is it possible to increase the connectivity of a given graph G by superposing it with another given graph H? More precisely, graph F is the superposition…
The theory of dependency graphs is a powerful toolbox to prove asymptotic normality of sums of random variables. In this article, we introduce a more general notion of weighted dependency graphs and give normality criteria in this context.…
We present an intuitive diagrammatic representation of a new class of integrable $\s$-models. It is shown that to any given diagram corresponds an integrable theory that couples $N$ WZW models with a certain number of each of the following…
A conjecture of Luo, Tian and Wu (2022) says that for every positive integer $k$ and every finite tree $T$ with bipartition $X$ and $Y$ (denote $t = \max\{|X|,|Y |\})$, every $k$-connected bipartite graph $G$ with $\delta(G) \geq k + t$…