Related papers: A Diagrammatic Equation for Oriented Planar Graphs
We study two variants of the well-known orthogonal drawing model: (i) the smooth orthogonal, and (ii) the octilinear. Both models form an extension of the orthogonal, by supporting one additional type of edge segments (circular arcs and…
We first prove a one-to-one correspondence between finding Hamiltonian cycles in a cubic planar graphs and finding trees with specific properties in dual graphs. Using this information, we construct an exact algorithm for finding…
We present a combinatorial problem which consists in finding irreducible Krajewski diagrams from finite geometries. This problem boils down to placing arrows into a quadratic array with some additional constrains. The Krajewski diagrams…
Graph matching aims at finding the vertex correspondence between two unlabeled graphs that maximizes the total edge weight correlation. This amounts to solving a computationally intractable quadratic assignment problem. In this paper we…
The fundamental role of on-shell diagrams in quantum field theory has been recently recognized. On-shell diagrams, or equivalently bipartite graphs, provide a natural bridge connecting gauge theory to powerful mathematical structures such…
We solve inverse problems from the D-N map for the quantum graph on a finite domain in a square lattice and that on a hexagonal lattice, as well as inverse scattering problems from the S-matrix for a locally perturbed square lattice and a…
Structure learning methods for covariance and concentration graphs are often validated on synthetic models, usually obtained by randomly generating: (i) an undirected graph, and (ii) a compatible symmetric positive definite (SPD) matrix. In…
We consider the ideal orientation problem in planar graphs. In this problem, we are given an undirected graph $G$ with positive edge lengths and $k$ pairs of distinct vertices $(s_1, t_1), \dots, (s_k, t_k)$ called terminals, and we want to…
We consider a system of differential equations and obtain its solutions with exponential asymptotics and analyticity with respect to the spectral parameter. Solutions of such type have importance in studying spectral properties of…
We give a parallel $O(\log(n))$-time algorithm on a CRCW PRAM to assign vertical and horizontal segments to the vertices of any planar bipartite graph $G$ in the following manner: i) Two segments cannot share an interior point ii) Two…
Suppose that $G=(V, E)$ is a finite graph with the vertex set $V$ and the edge set $E$. Let $\Delta$ be the usual graph Laplacian. Consider the following nonlinear Schr$\ddot{o}$dinger type equation of the form $$ \left \{…
Structure learning methods for covariance and concentration graphs are often validated on synthetic models, usually obtained by randomly generating: (i) an undirected graph, and (ii) a compatible symmetric positive definite (SPD) matrix. In…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
In the graphical calculus of planar string diagrams, equality is generated by exchange moves, which swap the heights of adjacent vertices. We show that left- and right-handed exchanges each give strongly normalizing rewrite strategies for…
Near a parity breaking front bifurcation, small perturbations may reverse the propagation direction of fronts. Often this results in nonsteady asymptotic motion such as breathing and domain breakup. Exploiting the time scale differences of…
We propose a perturbative method to estimate the normalization constant in exponential random graph models as the weighting parameters approach infinity. As an application, we give evidence of discontinuity in natural parametrization along…
A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
We derive a set of bilinear functional equations of Hirota type for the partition functions of the $sl(2)$ related integrable statistical models defined on a random lattice. These equations are obtained as deformations of the Hirota…
We employ a conformal mapping transformation to solve a generalized Grad-Shafranov equation with incompressible plasma flow of arbitrary direction and construct particular up-down asymmetric D-shaped and diverted tokamak equilibria. The…