arXiv research

New examples show limits of physical link isotopies.

There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While every plane graph arises as a Tait graph of a unique link diagram, not every embedd…

This paper focuses on the graphs in the Petersen family, the set of minor minimal intrinsically linked graphs. We prove there is a relationship between algebraic linking of an embedding and knotting in an embedding. We also present a more explicit relationship for the graph $K_{3,3,1}$ between knotting and linking, whi…

Study the embedding space of a Hopf link in 3D and 3-manifolds.

Study on linking numbers in random book embeddings of complete graphs.

Study embedding calculus and link invariants using functor calculus.

Proposes a novel tensor-based approach for multi-level link prediction.

We find the minimal number of links in an embedding of any complete $k$-partite graph on 7 vertices (including $K_7$, which has at least 21 links). We give either exact values or upper and lower bounds for the minimal number of links for all complete $k$-partite graphs on 8 vertices. We also look at larger complete bip…

New proof shows no flat embedding for Petersen family graphs.

In order to model entanglements of polymers in a confined region, we consider the linking numbers and writhes of cycles in random linear embeddings of complete graphs in a cube. Our main results are that for a random linear embedding of $K_n$ in a cube, the mean sum of squared linking numbers and the mean sum of square…

Financial markets for Liquified Natural Gas (LNG) are an important and rapidly-growing segment of commodities markets. Like other commodities markets, there is an inherent spatial structure to LNG markets, with different price dynamics for different points of delivery hubs. Certain hubs support highly liquid markets, a…

This work benchmarks neural embeddings for link prediction in evolving knowledge graphs.

Minimal simplicial complexes in high dimensions always contain complex links.

The paper examines when 2-string tangles can be embedded into specific link types.

DEAL model predicts links for new nodes with only attribute info.

Study shows gMPNNs struggle with OOD link prediction in larger test graphs.

Knowledge graphs contain knowledge about the world and provide a structured representation of this knowledge. Current knowledge graphs contain only a small subset of what is true in the world. Link prediction approaches aim at predicting new links for a knowledge graph given the existing links among the entities. Tenso…

The paper extends a link criterion for Lipschitz normal embeddings to definable sets in o-minimal structures.

We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of the graph contains a non-splittable 2-component link. We also show that there exis…

Develops a new causal model for path-dependent link prediction.

We focus our attention on the link prediction problem for knowledge graphs, which is treated herein as a binary classification task on neural embeddings of the entities. By comparing, combining and extending different methodologies for link prediction on graph-based data coming from different domains, we formalize a un…

We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H contains a nonsplit n component link, where at least m of the components are nont…

The paper studies how knots and links behave under connected sum operations.

Trivial links are unique up to number of link components, but they can be hard to recognize from arbitrary diagrams. We define a new measure of the complexity of a link embedding, the crumple, and show how this may be used to measure progress toward a trivial embedding. In conjunction with a modified form of arc presen…

Study the space of embeddings of split links in 3D and 4D.

New infinite family of 2-complexes intrinsically linked in 4D.

Study the spaces of Legendrian knots and links with maximal Thurston-Bennequin invariant.

Characterizes weakly linked pairs of complete graphs in 3D space.

It is shown that given any link-manifold, there is an algorithm to decide if the manifold contains an embedded, essential planar surface; if it does, the algorithm will construct one. If a slope on the boundary of the link-manifold is given, there is an algorithm to determine if the slope bounds an embedded punctured-d…

Many real-world problems can be formalized as predicting links in a partially observed network. Examples include Facebook friendship suggestions, consumer-product recommendations, and the identification of hidden interactions between actors in a crime network. Several link prediction algorithms, notably those recently …

We use the theory of oriented matroids to show that any linear embedding of $K_9$, the complete graph on nine vertices, contains a non-split link with three components.

We reconfigure the Milnor invariant of links in terms of central group extensions and unipotent Magnus embeddings. We also develop a diagrammatic computation of the invariant and compute the first non-vanishing invariants of the Milnor link and of several other links. Moreover, we refine the original Milnor invariants …

We compute the group of link homotopy classes of link maps of two 2-spheres into 4-space. It turns out to be free abelian, generated by geometric constructions applied to the Fenn-Rolfsen link map and detected by two self-intersection invariants introduced by Paul Kirk in this setting. As a corollary, we show that any …

We reprove and extend a result of David Krebes (J. Knot Theory Ramif. 8 (1999), 321-352) giving an obstruction to embedding a tangle T into a link L. Closing the tangle up in the two obvious ways gives rise to two links, the numerator and denominator links n(T) and d(T). Applying a homological argument to the 2-fold br…

We study intrinsically linked graphs where we require that every embedding of the graph contains not just a non-split link, but a link that satisfies some additional property. Examples of properties we address in this paper are: a two component link with lk(A,L) = k2^r, k not 0, a non-split n-component link where all l…

We propose a simple discrete time semi-supervised graph embedding approach to link prediction in dynamic networks. The learned embedding reflects information from both the temporal and cross-sectional network structures, which is performed by defining the loss function as a weighted sum of the supervised loss from past…

We show there exists a linear embedding of $K_{3,3,1}$ with n nontrivial 2-component links if and only if n = 1, 2, 3, 4, or 5.

ConEx learns complex embeddings for knowledge graphs, improving link prediction.

We prove that every embedding of $K_{2n+1,2n+1}$ into $\R^3$ contains a non-split link of $n$-components. Further, given an embedding of $K_{2n+1,2n+1}$ in $\R^3$, every edge of $K_{2n+1,2n+1}$ is contained in a non-split $n$-component link in $K_{2n+1,2n+1}$.

We introduce the notion of a ribbon-clasp surface-link, which is a generalization of a ribbon surface-link. We generalize the notion of a normal form on embedded surface-links to the case of immersed surface-links and prove that any (immersed) surface-link can be described in a normal form. It is known that an embedded…

A novel geometric algebra-based KG embedding framework improves link prediction.

The paper examines node2vec embeddings for community detection in networks.

Identifies a mod-$p$ triple cup product for rational homology 3-spheres with specific first homology.

Alternative proof for ribbon surfaces in 3D space.

In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here we make use of complex valued embeddings. The composition of complex embeddings …

Construct non-split 2-component links in $S^4$ to produce exotic pairs of 4-manifolds

DyHATR learns dynamic heterogeneous networks for better link prediction.

Flapan--Naimi--Pommersheim showed that every spatial embedding of $K_{10}$, the complete graph on ten vertices, contains a non-split three-component link; that is, $K_{10}$ is intrinsically triple-linked in $\mathbb{R}^3$. The work of Bowlin--Foisy and Flapan--Foisy--Naimi--Pommersheim extended the list of known intrin…