Related papers: A specious unlinking strategy
Consider a network game with linear best responses and spillovers between players, and let agents endogenously choose their links. A planner considers interventions to subsidize actions and/or links between players, aiming to maximize a…
Interlayer link prediction aims at matching the same entities across different layers of the multiplex network. Existing studies attempt to predict more accurately, efficiently, or generically from the aspects of network structure,…
Link prediction in complex networks has attracted increasing attention from both physical and computer science communities. The algorithms can be used to extract missing information, identify spurious interactions, evaluate network evolving…
Our main results concern changing an arbitrary plat presentation of a split or composite link to one which is obviously recognizable as being split or composite. Pocket moves, first described in \cite{unlinkviaplats}, are utilized -- a…
It is a natural question to ask whether two links are equivalent by the following moves -- parallel parts of a link are changed to k-times half-twisted parts and if they are, how many moves are needed to go from one link to the other. In…
We propose an extension of Strategy Logic (SL), in which one can both reason about strategizing under imperfect information and about players' knowledge. One original aspect of our approach is that we do not force strategies to be uniform,…
This paper considers the problem of network coding for multiple unicast connections in networks represented by directed acyclic graphs. The concept of interference alignment, traditionally used in interference networks, is extended to…
In this paper we present a systematic method to generate prime knot and prime link minimal triple-point projections, and then classify all classical prime knots and prime links with triple-crossing number at most four. We also extend the…
Network slicing has emerged as an integral concept in 5G, aiming to partition the physical network infrastructure into isolated slices, customized for specific applications. We theoretically formulate the key performance metrics of an…
Deep learning models that perform well often have high computational costs. In this paper, we combine two approaches that try to reduce the computational cost while keeping the model performance high: pruning and early exit networks. We…
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.
Link prediction is an open problem in the complex network, which attracts much research interest currently. However, little attention has been paid to the relation between network structure and the performance of prediction methods. In…
Early exits enable the network's forward pass to terminate early by attaching trainable internal classifiers to the backbone network. Existing early-exit methods typically adopt either a joint training approach, where the backbone and exit…
In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the…
We prove some necessary conditions for a link to be either concordant to a quasi-positive link, quasi-positive, positive, or the closure of a positive braid. The main applications of our results are a characterisation of positive links with…
Among the several topological properties of complex networks, the shortest path represents a particularly important characteristic because of its potential impact not only on other topological properties, but mainly for its influence on…
The slicing number of a knot, $u_s(K)$, is the minimum number of crossing changes required to convert $K$ to a slice knot. This invariant is bounded above by the unknotting number and below by the slice genus $g_s(K)$. We show that for many…
A realization of a virtual link diagram is obtained by choosing over/under markings for each virtual crossing. Any realization can also be obtained from some representation of the virtual link. (A representation of a virtual link is a link…
We show that if a split link is obtained from a split link $L$ in $S^3$ by $1/n$-Dehn surgery along a trivial knot $C$, then the link $L\cup C$ is splittable. That is to say, it is impossible to obtain a split link from a split link via a…
In designing a network to link n cities in a square of area n, one might be guided by the following two desiderata. First, the total network length should not be much greater than the length of the shortest network connecting all cities.…