Related papers: Double-dimer pairings and skew Young diagrams
Rectangular standard Young tableaux with 2 or 3 rows are in bijection with $U_q(\mathfrak{sl}_2)$-webs and $U_q(\mathfrak{sl}_3)$-webs respectively. When $W$ is a web with a reflection symmetry, the corresponding tableau $T_W$ has a…
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 the computational study of political redistricting, feasibility necessitates the use of a discretization of regions such as states, counties, and towns. In nearly all cases, researchers use a dual graph, whose vertices represent small…
Given a graphical degree sequence ${\bf d}=(d_1,\ldots, d_n)$, let $G(n, {\bf d})$ denote a uniformly random graph on vertex set $[n]$ where vertex $ i$ has degree $d_i$ for every $1\le i\le n$. We give upper and lower bounds on the joint…
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…
Contact terms in two point functions of global symmetry currents have recently been proposed as a check of Seiberg-like duality in three dimensional supersymmetric field theories. In this paper we compute the contact terms for various N=2…
We study a two-dimensional $\mathcal{N}=(0,2)$ supersymmetric duality and construct novel Bailey pairs for the associated elliptic genera. This framework provides a systematic method to establish the equivalence of the elliptic genera of…
The problem of measuring similarity of graphs and their nodes is important in a range of practical problems. There is a number of proposed measures, some of them being based on iterative calculation of similarity between two graphs and the…
We study pairs of 4d N=1 supersymmetric gauge theories that share the same vacuum moduli space and the same chiral field content, encoded by a common quiver, but differ in their superpotentials. These theories arise as worldvolume theories…
Bipartite graphs model the relationship between two disjoint sets of objects. They have a wide range of applications and are often visualized as a 2-layered drawing, where each set of objects is visualized as a set of vertices (points) on…
Brane tilings provide the most general framework in string and M-theory for matching toric Calabi-Yau singularities probed by branes with superconformal fixed points of quiver gauge theories. The brane tiling data consists of a bipartite…
In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density. Our results imply several new bounds for classical problems in graph Ramsey theory and improve…
High triangle density -- the graph property stating that a constant fraction of two-hop paths belong to a triangle -- is a common signature of social networks. This paper studies triangle-dense graphs from a structural perspective. We prove…
Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erd\H{o}s-R\'{e}nyi graphs $G(n,\frac{d}{n})$.…
Recent works leveraging Graph Neural Networks to approach graph matching tasks have shown promising results. Recent progress in learning discrete distributions poses new opportunities for learning graph matching models. In this work, we…
A tanglegram consists of two binary rooted trees with the same number of leaves and a perfect matching between the leaves of the trees. We show that the two halves of a random tanglegram essentially look like two independently chosen random…
In this paper, we apply the Turan sieve and the simple sieve developed by R. Murty and the first author to study problems in random graph theory. In particular, we obtain upper and lower bounds on the probability of a graph on n vertices…
A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…
Material's geometrical structure is a fundamental part of their properties. The honeycomb geometry of graphene is responsible for the arising of its Dirac cone, while the kagome and Lieb lattice hosts flat bands and pseudospin-1 Dirac…
The dimer model is a classical statistical mechanics model which is exactly solvable in two dimensions, but about which little is known in higher dimensions. In analogy with large $N$ limits in lattice gauge theory, we study a large $N$…