arXiv research

We study the Thurston-Bennequin number of complete and complete bipartite Legendrian graphs. We define a new invariant called the total Thurston-Bennequin number of the graph. We show that this invariant is determined by the Thurston-Bennequin numbers of 3-cycles for complete graphs and by the Thurston-Bennequin number…

This study examines how removing edges from complete graphs affects Ollivier Ricci curvature.

We say that a graph is intrinsically knotted or completely 3-linked if every embedding of the graph into the 3-sphere contains a nontrivial knot or a 3-component link any of whose 2-component sublink is nonsplittable. We show that a graph obtained from the complete graph on seven vertices by a finite sequence of $\tria…

We consider the $Q_k$ flow on complete non-compact graphs. We prove that a complete graph evolves by the $Q_k$ curvature up to some time $T$ depending on the radius of a sphere enclosed by the initial graph.

We study the evolution of convex complete non-compact graphs by positive powers of Gauss curvature. We show that if the initial complete graph has a local uniform convexity, then the graph evolves by any positive power of Gauss curvature for all time. In particular, the initial graph is not necessarily differentiable.

The paper generalizes linking number properties for complete graphs.

The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular abstract graphs. This question has been answered for complete graphs; it is natu…

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…

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

We investigate the minimal number of links and knots in complete partite graphs. We provide exact values or bounds on the minimal number of links for all complete partite graphs with all but 4 vertices in one partition, or with 9 vertices in total. In particular, we find that the minimal number of links for $K_{4,4,1}$…

We characterize which automorphisms of an arbitrary complete bipartite graph $K_{n,m}$ can be induced by a homeomorphism of some embedding of the graph in $S^3$.

Complete classification of links and spatial graphs with finite N-quandles.

Simplified proof for a theorem about graphs.

We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families, we verify a conjecture presented in Adams' "The Knot Book": If a vertex is remo…

We describe two locally finite graphs naturally associated to each knot type K, called Reidemeister graphs. We determine several local and global properties of these graphs and prove that in one case the graph-isomorphism type is a complete knot invariant up to mirroring. Lastly, we introduce another object, relating t…

Complex equivalence classes found in graph homotopy.

We study a modified notion of Ollivier's coarse Ricci curvature on graphs introduced by Lin, Lu, and Yau in [11]. We establish a rigidity theorem for complete graphs that shows a connected finite simple graph is complete if and only if the Ricci curvature is strictly greater than one. We then derive explicit Ricci curv…

There has been much recent interest into those properties of a 3-manifold determined by the profinite completion of its fundamental group. In this paper we give readily computable criteria specifying precisely when two orientable graph manifold groups have isomorphic profinite completions. Our results also distinguish …

The paper explores the $L^1$-Liouville property on graphs and its connections to stochastic completeness.

The aim of this work is studying translating graphs by mean curvature flow in $\Real^3$. We prove non-existence of complete translating graphs over bounded domains in $\Real^2$. Furthermore, we show that there are only three types of complete translating graphs in $\Real^3$; entire graphs, graphs between two vertical p…

The paper reveals a property of chromatic homology for complete graphs.

In this article, we prove gradient estimates under Bakry-Emery curvature bounds for unbounded graph Laplacians which satisfy an ellipticity assumption. As applications, we study completeness and finiteness of stochastically complete graphs under Bakry-Emery curvature bounds.

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respe…

Lin-Lu-Yau introduced an interesting notion of Ricci curvature for graphs and obtained a complete characterization for all Ricci-flat graphs with girth at least five [1]. In this paper, we propose a concrete approach to construct an infinite family of distinct Ricci-flat graphs of girth four with edge-disjoint 4-cycles…

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

Algorithm refines matrix ratings using hierarchical graph clustering.

New graphs with maximum degree 4 found to be Ricci-flat.

Conway-Gordon proved that for every spatial complete graph on 6 vertices, the sum of the linking numbers over all of the constituent 2-component links is congruent to 1 modulo 2, and for every spatial complete graph on 7 vertices, the sum of the Arf invariants over all of the Hamiltonian knots is also congruent to 1 mo…

Enhances knowledge graph completion with mixed geometry tensor factorization.

New guarantees for matrix completion from any deterministic sampling patterns.

In 1983, Conway and Gordon proved that for every spatial complete graph on six vertices, the sum of the linking numbers over all of the constituent two-component links is odd, and that for every spatial complete graph on seven vertices, the sum of the Arf invariants over all of the Hamiltonian knots is odd. In 2009, th…

In this note we discuss graphs over a domain $Ω\subset N^2$ in the product manifold $N^2\times \mathbb{R}$. Here $N^2$ is a complete Riemannian surface and $Ω$ has peice-wise smooth boundary. Let $γ\subset\partialΩ$ be a smooth connected arc and $Σ$ be a complete graph in $N^2\times \mathbb{R}$ over $Ω$. We show that i…

We study the Seifert surfaces of a link by relating the embeddings of graphs by using induced graphs. As applications, we prove that every link $L$ is the boundary of an oriented surface which is obtained from a graph embedding of a complete bipartite graph $K_{2,n}$, where all voltage assignments on the edges of $K_{2…

In this thesis, we analyze the stochastic completeness of a heat kernel on graphs which is a function of three variables: a pair of vertices and a continuous time, for infinite, locally finite, connected graphs. For general graphs, a sufficient condition for stochastic completeness is given in terms of the maximum vale…

Knowledge graph completion aims to predict missing relations between entities in a knowledge graph. In this work, we propose a relational message passing method for knowledge graph completion. Different from existing embedding-based methods, relational message passing only considers edge features (i.e., relation types)…

The paper explores linked cycles in graphs and their properties.

New method estimates neuronal connectivity from partially observed data.

We determine for which $m$, the complete graph $K_m$ has an embedding in $S^3$ whose topological symmetry group is isomorphic to one of the polyhedral groups: $A_4$, $A_5$, or $S_4$.

New algorithm identifies causal relationships from graphs, even with selection bias.

Low-rank tensor decomposition and completion have attracted significant interest from academia given the ubiquity of tensor data. However, the low-rank structure is a global property, which will not be fulfilled when the data presents complex and weak dependencies given specific graph structures. One particular applica…

In his 1930 paper, Kuratowksi categorized planar graphs, proving that a finite graph $Γ$ is planar if and only if it does not contain a subgraph that is homeomorphic to $K_5$, the complete graph on 5 vertices, or $K_{3,3}$, the complete bipartite graph on six vertices. In their 2001 paper, Davis and Okun point out that…

We classify which complete multipartite graphs are intrinsically chiral.

We consider matrix completion for recommender systems from the point of view of link prediction on graphs. Interaction data such as movie ratings can be represented by a bipartite user-item graph with labeled edges denoting observed ratings. Building on recent progress in deep learning on graph-structured data, we prop…

The paper explores linearly free graphs and their embeddings into 3D space.

We determine for which $n$, the complete bipartite graph $K_{n,n}$ has an embedding in $S^3$ whose topological symmetry group is isomorphic to one of the polyhedral groups: $A_4$, $A_5$, or $S_4$.

Matrix completion models are among the most common formulations of recommender systems. Recent works have showed a boost of performance of these techniques when introducing the pairwise relationships between users/items in the form of graphs, and imposing smoothness priors on these graphs. However, such techniques do n…

Characterizes graphs with leveled embeddings and introduces new graph invariants.

Framework for completing computational graphs using Gaussian Processes.