相关论文: Unlinked Embedded Graphs
A polynomial invariant of virtual links, arising from an invariant of links in thickened surfaces introduced by Jaeger, Kauffman, and Saleur, is defined and its properties are investigated. Examples are given that the invariant can detect…
Due to their flexibility to represent almost any kind of relational data, graph-based models have enjoyed a tremendous success over the past decades. While graphs are inherently only combinatorial objects, however, many prominent analysis…
Machine learning, deep learning, and NLP methods on knowledge graphs are present in different fields and have important roles in various domains from self-driving cars to friend recommendations on social media platforms. However, to apply…
A polynomial is presented that models a topological knot in a unique manner. It distinguishes all types of knots including the orientation and has a group theory interpretation. The topologies may be labeled via a number, which upon a base…
A graph is intrinsically knotted if every embedding contains a knotted cycle. It is known that intrinsically knotted graphs have at least 21 edges and that the KS graphs, $K_7$ and the 13 graphs obtained from $K_7$ by $\nabla Y$ moves, are…
We prove the existence of a polynomial invariant that satisfies the HOMFLY skein relation for links in a lens space. In the process we also develop a skein theory of toroidal grid diagrams in a lens space.
We introduce a new numerical invariant of knots and links from the descending diagrams. It is considered to live between the unknotting number and the bridge number.
Any planar graph has a crossing-free straight-line drawing in the plane. A simultaneous geometric embedding of two n-vertex graphs is a straight-line drawing of both graphs on a common set of n points, such that the edges withing each…
This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field.…
The extreme degrees of the colored Jones polynomial of any link are bounded in terms of concrete data from any link diagram. It is known that these bounds are sharp for semi-adequate diagrams. One of the goals of this paper is to show the…
This is an expository article on diagrammatic representations of knots and links in various settings via braids.
Knots, links and entangled filaments appear in many physical systems of interest in biology and engineering. Classifying knots and measuring entanglement is of interest both for advancing knot theory, as well as for analyzing large data…
Let $\Delta$ be a trivial knot in the three-sphere. For every finite cyclic group $G$ of odd order, we construct a $G$-equivariant Khovanov homology with coefficients in the filed $\F_{2}$. This homology is an invariant of links up to…
In a recent paper Jones introduced a correspondence between elements of the Thompson group $F$ and certain graphs/links. It follows from his work that several polynomial invariants of links, such as the Kauffman bracket, can be…
This tutorial covers a few recent papers in the field of network embedding. Network embedding is a collective term for techniques for mapping graph nodes to vectors of real numbers in a multidimensional space. To be useful, a good embedding…
The embedded template is a geometric tool in dynamics being used to model knots and links as periodic orbits of $3$-dimensional flows. We prove that for an embedded template in $S^3$ with fixed homeomorphism type, its boundary as a…
Knowledge graph embedding involves learning representations of entities -- the vertices of the graph -- and relations -- the edges of the graph -- such that the resulting representations encode the known factual information represented by…
Embedding static graphs in low-dimensional vector spaces plays a key role in network analytics and inference, supporting applications like node classification, link prediction, and graph visualization. However, many real-world networks…
Maps from links in thickened surfaces to flat-virtual links help to construct invariants of links using invariants of flat-virtual links. This work is dedicated to investigation of equivalence and invariants of flat-virtual diagrams…
Many real-world complex networks are best modeled as bipartite (or 2-mode) graphs, where nodes are divided into two sets with links connecting one side to the other. However, there is currently a lack of methods to analyze properly such…