Related papers: A search method for thin positions of links
A successive continuation method for locating connecting orbits in parametrized systems of autonomous ODEs was considered in [9]. In this paper we present an improved algorithm for locating and continuing connecting orbits, which includes a…
Link prediction, the problem of identifying missing links among a set of inter-related data entities, is a popular field of research due to its application to graph-like domains. Producing consistent evaluations of the performance of the…
We consider the problem of link prediction in networks whose edge structure may vary (sufficiently slowly) over time. This problem, with applications in many important areas including social networks, has two main variants: the first, known…
We study the query version of constrained minimum link paths between two points inside a simple polygon $P$ with $n$ vertices such that there is at least one point on the path, visible from a query point. The method is based on partitioning…
Link prediction methods use patterns in known network data to infer which connections may be missing. Previous work has shown that continuous-time quantum walks can be used to represent path-based link prediction, which we further study…
We consider the problem of searching for a node on a labelled random graph according to a greedy algorithm that selects a route to the desired node using metric information on the graph. Motivated by peer-to-peer networks two types of…
To evaluate the performance of prediction of missing links, the known data are randomly divided into two parts, the training set and the probe set. We argue that this straightforward and standard method may lead to terrible bias, since in…
In this paper we introduce the concept of dynamic link pages. A web site/page contains a number of links to other pages. All the links are not equally important. Few links are more frequently visited and few rarely visited. In this…
A method of statistical selection of short lived particles in high multiplicity nucleus-nucleus collisions is discussed.
Link prediction is an elemental challenge in network science, which has already found applications in guiding laboratorial experiments, digging out drug targets, recommending friends in social networks, probing mechanisms in network…
This is a chapter that is to appear in the "Handbook of Knot Theory", edited by William W. Menasco and Morwen B. Thistlethwaite.
We state the graph-theoretic computational problem of finding tight paths in a directed, edge-weighted graph, as well as its simplification of finding tight pairs. These problems are motivated by the need of algorithms that find so-called…
This work analyzes coverage in the downlink of a thinned LiFi attocell network of deterministically arranged LEDs. The network is thinned by a Bernoulli probability p over all the LEDs to decide whether each one of them acts as a LiFi…
A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a…
Predicting missing links in real networks is an important problem in network science to which considerable efforts have been devoted, giving as a result a vast plethora of link prediction methods in the literature. In this work, we take a…
Link prediction in complex networks has attracted considerable attention from interdisciplinary research communities, due to its ubiquitous applications in biological networks, social networks, transportation networks, telecommunication…
In a wide range of complex networks, the links between the nodes are temporal and may sporadically appear and disappear. This temporality is fundamental to analyze the formation of paths within such networks. Moreover, the presence of the…
I briefly discuss a method of obtaining distinct classes of topologically equivalent knots by developing appropriate computer programs.
A linear time algorithm to find a set of nearest elements in a mesh.
We investigate a practical variant of the well-known polygonal visibility path (watchman) problem. For a polygon $P$, a minimum link visibility path is a polygonal visibility path in $P$ that has the minimum number of links. The problem of…