Related papers: Integrability of Generalised Skew-Symmetric Replic…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
We develop the Lie theory of Lie-admissible algebras whose product is enriched with higher operations modeled on directed graphs with a view to apply it to the deformation theories controlled by this kind of Lie algebras. We produce…
We develop a general diagrammatic theory of welded graphs, and provide an extension of Satoh's Tube map from welded graphs to ribbon surface-links. As a topological application, we obtain a complete link-homotopy classification of so-called…
We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…
Feature extraction and dimension reduction for networks is critical in a wide variety of domains. Efficiently and accurately learning features for multiple graphs has important applications in statistical inference on graphs. We propose a…
We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…
Graph embedding algorithms are used to efficiently represent (encode) a graph in a low-dimensional continuous vector space that preserves the most important properties of the graph. One aspect that is often overlooked is whether the graph…
The Blow-up Lemma established by Koml\'os, S\'ark\"ozy, and Szemer\'edi in 1997 is an important tool for the embedding of spanning subgraphs of bounded maximum degree. Here we prove several generalisations of this result concerning the…
The Lie algebraic integrability test is applied to the problem of classification of integrable Klein-Gordon type equations on quad-graphs. The list of equations passing the test is presented containing several well-known integrable models.…
We consider three classes of geodesic embeddings of graphs on Euclidean flat tori: (1) A toroidal graph embedding $\Gamma$ is positive equilibrium if it is possible to place positive weights on the edges, such that the weighted edge vectors…
We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…
Embedding graphs in continous spaces is a key factor in designing and developing algorithms for automatic information extraction to be applied in diverse tasks (e.g., learning, inferring, predicting). The reliability of graph embeddings…
In recent work, we presented the construction of a family of difference equations associated with the Stieltjes continued fraction expansion of a certain function on a hyperelliptic curve of genus $g$. As well as proving that each such…
Graph autoencoders (AE) and variational autoencoders (VAE) recently emerged as powerful node embedding methods. In particular, graph AE and VAE were successfully leveraged to tackle the challenging link prediction problem, aiming at…
A directed graph $G$ is upward planar if it admits a planar embedding such that each edge is $y$-monotone. Unlike planarity testing, upward planarity testing is NP-hard except in restricted cases, such as when the graph has the…
We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \choose 2}-o(N^2)$ edges, which can be decomposed into…
All Darboux integrable difference equations on the quad-graph are described in the case of the equations that possess autonomous first-order integrals in one of the characteristics. A generalization of the discrete Liouville equation is…
Theoretical results from discrete geometry suggest that normed spaces can abstractly embed finite metric spaces with surprisingly low theoretical bounds on distortion in low dimensions. In this paper, inspired by this theoretical insight,…
The Kahan discretization of the Lotka-Volterra system, associated with any skew-symmetric graph $\Gamma$, leads to a family of rational maps, parametrized by the step size. When these maps are Poisson maps with respect to the quadratic…
We take an elementary and systematic approach to the problem of extending the Tutte polynomial to the setting of embedded graphs. Four notions of embedded graphs arise naturally when considering deletion and contraction operations on graphs…