Related papers: Integrability of Generalised Skew-Symmetric Replic…
We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure…
We study the problem of recovering a globally consistent Euclidean embedding of data, given only a local distance graph and propose a method that optimally represents these distances. The method operates solely on a neighborhood graph…
Integrable deformations of a class of Rikitake dynamical systems are constructed by deforming their underlying Lie-Poisson Hamiltonian structures, which are considered linearizations of Poisson--Lie structures on certain (dual) Lie groups.…
Directed graphs model asymmetric relationships between nodes and research on directed graph embedding is of great significance in downstream graph analysis and inference. Learning source and target embedding of nodes separately to preserve…
Folding of ADE-Dynkin diagrams according to graph automorphisms yields irreducible Dynkin diagrams of ABCDEFG-types. This folding procedure allows to trace back the properties of the corresponding simple Lie algebras or groups to those of…
We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…
We develop a generalized resistance geometry based on Kron reduction and effective resistance for directed graphs, paralleling classical undirected graph theory. For strongly connected directed graphs, we prove a Fiedler--Bapat identity…
We introduce a new optimization problem regarding embeddings of a graph into a Euclidean space and discuss its relation to the two, mutually dual, optimizations problems introduced by Goering-Helmberg-Wappler. We prove that the Laplace…
In this paper, we analyze embeddings of grid graphs on orientable surfaces. We determine the genus of a large class of k-dimensional grid graphs and effective two-sided bounds for the genus of any 3-dimensional grid graph, both in terms of…
Spectral techniques have proved amongst the most effective approaches to graph clustering. However, in general they require explicit computation of the main eigenvectors of a suitable matrix (usually the Laplacian matrix of the graph).…
Directed graphs have been widely used in Community Question Answering services (CQAs) to model asymmetric relationships among different types of nodes in CQA graphs, e.g., question, answer, user. Asymmetric transitivity is an essential…
We construct several families of embeddings of braid groups into mapping class groups of orientable and non-orientable surfaces and prove that they induce the trivial map in stable homology in the orientable case, but not so in the…
We present an approach to reduced-order modelling that builds off recent graph-theoretic work for representation, exploration, and analysis of computed states of physical systems (Banerjee et al., Comp. Meth. App. Mech. Eng., 351, 501-530,…
We consider general integrable systems on graphs as discrete flat connections with the values in loop groups. We argue that a certain class of graphs is of a special importance in this respect, namely quad-graphs, the cellular…
The local symplectic theory of integrable systems is fundamental to understand their global theory, as well as the behavior near singularities of fundamental models from classical and quantum mechanics which are known to be integrable, such…
We introduce a curvature atlas for left-invariant metrics on SU(2), based on the inertial curvature field derived from the Euler-Poincare equations. We prove that the classical integrable cases of the heavy top--spherical, Lagrange,…
A set $\mathcal{G}$ of planar graphs on the same number $n$ of vertices is called simultaneously embeddable if there exists a set $P$ of $n$ points in the plane such that every graph $G \in \mathcal{G}$ admits a (crossing-free)…
Godsil (1985) defined a graph to be invertible if it has a non-singular adjacency matrix whose inverse is diagonally similar to a nonnegative integral matrix; the graph defined by the last matrix is then the inverse of the original graph.…
Motivated by affine Schubert calculus, we construct a family of dual graded graphs $(\Gamma_s,\Gamma_w)$ for an arbitrary Kac-Moody algebra $\g(A)$. The graded graphs have the Weyl group $W$ of $\g(A)$ as vertex set and are labeled versions…
We describe an algorithm that recognizes some (perhaps all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used by…