Related papers: Rigid and shaky hard link diagrams
We show that every knot type admits a pair of diagrams that cannot be made identical without using Reidemeister Omega_2-moves. We also show that our proof is compatible with known results for the other move types, in the sense that every…
This is an introductory article on high dimensional knots for the beginners. High dimensional knot theory is an exciting field. It is a field of knot theory, which is one of topology and is connected with many ones. In this article we use…
Measuring robustness is a fundamental task for analyzing the structure of complex networks. Indeed, several approaches to capture the robustness properties of a network have been proposed. In this paper we focus on spectral graph theory…
Random key graphs form a class of random intersection graphs and are naturally induced by the random key predistribution scheme of Eschenauer and Gligor for securing wireless sensor network (WSN) communications. Random key graphs have…
In reliable decision-making systems based on machine learning, models have to be robust to distributional shifts or provide the uncertainty of their predictions. In node-level problems of graph learning, distributional shifts can be…
Graph theory is a branch of mathematics in which pair-wise relations between objects are studied. My PhD thesis, supervised by David R. Wood, introduces and investigates a new family of graphs, called link graphs, that generalises the…
We consider the global rigidity problem for bar-joint frameworks where each vertex is constrained to lie on a particular line in $\mathbb R^d$. In our setting we allow multiple vertices to be constrained to the same line. Under a mild…
We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…
A shadow diagram is a knot diagram with under-over information omitted; a shadow movie is a sequence of shadow diagrams related by shadow Reidemeister moves. We show that not every shadow movie arises as the shadow of a Reidemeister movie,…
Every link in R^3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams.
We introduce new skein invariants of links based on a procedure where we first apply the skein relation only to crossings of distinct components, so as to produce collections of unlinked knots. We then evaluate the resulting knots using a…
This paper extends the study of arc crossing change, a local operation on knot diagrams recently introduced by Cericola, from knot diagrams to link diagrams. We consider two types of arc crossing change on link diagrams and discuss when…
In this paper we study the rank of planar rigidity matrix of 4-valent graphs, both in case of generic realizations and configurations in general position, under various connectivity assumptions on the graphs. For each case considered, we…
The correspondence between weighted undirected graphs and reversible Markov chains via vertex random walks is simple and well known. Leveraging this correspondence and ideas from the theory of dynamical systems, we study the structural…
A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. The existence of greedy drawings has been…
Designing well-connected graphs is a fundamental problem that frequently arises in various contexts across science and engineering. The weighted number of spanning trees, as a connectivity measure, emerges in numerous problems and plays a…
By adding or removing appropriate structures to Gauss diagram, one can create useful objects related to virtual links. In this paper few objects of this kind are studied: twisted virtual links generalizing virtual links; signed chord…
A ring is rigid if there is no nonzero locally nilpotent derivation on it. In terms of algebraic geometry, a rigid coordinate ring corresponds to an algebraic affine variety which does not allow any nontrivial algebraic additive group…
A knotted ribbon is one of physical aspect of a knot. A folded ribbon knot is a depiction of a knot obtained by folding a long and thin rectangular strip to become flat. The ribbonlength of a knot type can be defined as the minimum length…
To each link $L$ in $S^3$ we associate a collection of certain labelled directed trees, called width trees. We interpret some classical and new topological link invariants in terms of these width trees and show how the geometric structure…