Related papers: Self and mixed delta-moves on algebraically split …
In this paper, we introduce a bisected vertex leveling of a plane graph. Using this planar embedding, we present elementary proofs of the well-known upper bounds in terms of the minimal crossing number on braid index $b(L)$ and arc index…
The calculation of Euclidean distance between points is generalized to one-dimensional objects such as strings or polymers. Necessary and sufficient conditions for the minimal transformation between two polymer configurations are derived.…
A model of random walk on knot diagrams is used to study the Alexander polynomial and the colored Jones polynomial of knots. In this context, the inverse of the Alexander polynomial of a knot plays the role of an Ihara-Selberg zeta function…
We say that a set of pairs of disjoint cycles $\Lambda(G)$ of a graph $G$ is linked if for any spatial embedding $f$ of $G$ there exists an element $\lambda$ of $\Lambda(G)$ such that the $2$-component link $f(\lambda)$ is nonsplittable,…
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.
Let $Z(\cal L)$ be the center of a Lie algebra $\cal L$ with Lie bracket $[\cdot, \cdot]$. %We then define The commuting graph of $\cal L$ is then defined by the simple undirected graph $\Gamma({\cal L})=(V_{\cal L},E_{\cal L})$ in which…
We introduce an easily computable topological measure which locates the effective crossover between segregation and integration in a modular network. Segregation corresponds to the degree of network modularity, while integration is…
As a generalization of the linking number, we construct a set of invariant numbers for two-component handlebody-links. These numbers are elementary divisors associated with the natural homomorphism from the first homology group of a…
We prove that any arc-presentation of the unknot admits a monotonic simplification by elementary moves; this yields a simple algorithm for recognizing the unknot. We obtain similar results for split links and composite links.
In this paper, we are interested in the mixing behaviour of simple random walks on inhomogeneous directed graphs. We focus our study on the Chung-Lu digraph, which is an inhomogeneous network that generalizes the Erd\H{o}s-R\'enyi digraph.…
Clustering is one of the fundamental tasks in data analytics and machine learning. In many situations, different clusterings of the same data set become relevant. For example, different algorithms for the same clustering task may return…
We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…
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…
In this paper, we define invariants of links in terms of colorings of link diagrams and prove that these invariants coincide with various notions of widths of links with respect to the standard Morse function. Our formulations are…
Rotation distances measure the differences in structure between rooted ordered binary trees. The one-dimensional skeleta of associahedra are rotation graphs, where two vertices representing trees are connected by an edge if they differ by a…
A straight-line drawing $\delta$ of a planar graph $G$ need not be plane, but can be made so by moving some of the vertices. Let shift$(G,\delta)$ denote the minimum number of vertices that need to be moved to turn $\delta$ into a plane…
Transport and mixing processes in fluid flows can be studied directly from Lagrangian trajectory data, such as obtained from particle tracking experiments. Recent work in this context highlights the application of graph-based approaches,…
A digraph is {\bf \( k \)-linked} if for arbitary two disjoint vertex sets \(\{s_1, \ldots, s_k\}\) and \(\{t_1, \ldots, t_k\}\), there exist vertex-disjoint directed paths \(P_1, \ldots, P_k\) {such that \(P_i\) is a directed path from…
Walking and cycling, commonly referred to as active travel, have become integral components of modern transport planning. Recently, there has been growing recognition of the substantial role that active travel can play in making cities more…
We present a simplification of the recursive algorithm for the evaluation of intersection numbers for differential $n$-forms, by combining the advantages emerging from the choice of delta-forms as generators of relative twisted cohomology…