Direction-Aware User Recommendation Based on Asymmetric Network Embedding

User recommendation aims at recommending users with potential interests in the social network. Previous works have mainly focused on the undirected social networks with symmetric relationship such as friendship, whereas recent advances have been made on the asymmetric relationship such as the following and followed by relationship. Among the few existing direction-aware user recommendation methods, the random walk strategy has been widely adopted to extract the asymmetric proximity between users. However, according to our analysis on real-world directed social networks, we argue that the asymmetric proximity captured by existing random walk based methods are insufficient due to the inbalance in-degree and out-degree of nodes. To tackle this challenge, we propose InfoWalk, a novel informative walk strategy to efficiently capture the asymmetric proximity solely based on random walks. By transferring the direction information into the weights of each step, InfoWalk is able to overcome the limitation of edges while simultaneously maintain both the direction and proximity. Based on the asymmetric proximity captured by InfoWalk, we further propose the qualitative (DNE-L) and quantitative (DNE-T) directed network embedding methods, capable of preserving the two properties in the embedding space. Extensive experiments conducted on six real-world benchmark datasets demonstrate the superiority of the proposed DNE model over several state-of-the-art approaches in various tasks.

Scenes From Tick Physiology: Proteins of Sialome Talk About Their Biological Processes

Ticks are blood-sucking parasites with different strategies of feeding depending on the tick family. The major families are Ixodidae or Argasidae, being slow or fast feeders, respectively. In the recent years, the advances in molecular sequencing techniques have enabled to gain knowledge about the proteome of the tick’s salivary glands. But an holistic view of the biological processes underlying the expression of the sialome has been neglected. In this study we propose the use of standard biological processes as a tool to draw the physiology of the tick’s salivary glands. We used published data on the sialome of Rhipicephalus sanguineus s.l. (Ixodidae) and Ornithodoros rostratus (Argasidae). A partial set of proteins obtained by these studies were used to define the biological process(es) in which proteins are involved. We used a directed network construction in which the nodes are proteins (source) and biological processes (target), separately for the low-level processes (“children”) and the top-level ones (“parents”). We applied the method to feeding R. sanguineus at different time slices, and to different organs of O. rostratus. The network connects the proteins and the processes with a strength directly proportional to the transcript per millions of each protein. We used PageRank as a measure of the importance of each biological process. As suggested in previous studies, the sialome of unfed R. sanguineus express about 30% less biological processes than feeding ticks. Another decrease (25%) is noticed at the middle of the feeding and before detachment. However, top-level processes are deeply affected only at the onset of feeding, demonstrating a redundancy in the feeding. When ixodid-argasid are compared, large differences were observed: they do not share 91% of proteins, but share 90% of the biological processes. However, caution must be observed when examining these results. The hypothesis of different proteins linked to similar biological process(es) in both ticks is an extreme not confirmed in this study. Considering the limitations of this study, carried out with a selected set of proteins, we propose the networks of proteins of sialome linked to their biological processes as a tool aimed to explain the biological processes behind families of proteins.

Signed zero forcing number and controllability for a networks system with a directed hypercube

The controllability for complex network system is to find the minimum number of leaders for the network system to achieve effective control of the global networks. In this paper, the problem of controllability of the directed network for a family of matrices carrying the structure under directed hypercube is considered. The relationship between the minimum number of leaders for the directed network system and the number of the signed zero forcing set is established. The minimum number of leaders of the directed networks system under a directed hypercube is obtained by computing the zero forcing number of a signed graph.

Lexicographically Maximum Flows under an Arc Interdiction

Network interdiction problem arises when an unwanted agent attacks the network system to deteriorate its transshipment efficiency. Literature is flourished with models and solution approaches for the problem. This paper considers a single commodity lexicographic maximum flow problem on a directed network with capacitated vertices to study two network flow problems under an arc interdiction. In the first, the objective is to find an arc on input network to be destroyed so that the residual lexicographically maximum flow is lexicographically minimum. The second problem aims to find a flow pattern resulting lexicographically maximum flow on the input network so that the total residual flow, if an arc is destroyed, is maximum. The paper proposes strongly polynomial time solution procedures for these problems.

Global Value Chains of COVID-19 Materials: A Weighted Directed Network Analysis

The COVID-19 pandemic caused a boom in demand for personal protective equipment, or so-called “COVID-19 goods”, around the world. We investigate three key sectoral global value chain networks, namely, “chemicals”, “rubber and plastics”, and “textiles”, involved in the production of these goods. First, we identify the countries that export a higher value added share than import, resulting in a “value added surplus”. Then, we assess their value added flow diversification using entropy. Finally, we analyze their egonets in order to identify their key affiliates. The relevant networks were constructed from the World Input-Output Database. The empirical results reveal that the USA had the highest surplus in “chemicals”, Japan in “rubber and plastics”, and China in “textiles”. Concerning value added flows, the USA was highly diversified in “chemicals”, Germany in “rubber and plastics”, and Italy in “textiles”. From the analysis of egonets, we found that the USA was the key supplier in all sectoral networks under consideration. Our work provides meaningful conclusions about trade outperformance due to the fact of surplus, trade flow robustness due to the fact of diversification, and trade partnerships due to the egonets analysis.

A meritocratic network formation model for the rise of social media influencers

Many of today’s most used online social networks such as Instagram, YouTube, Twitter, or Twitch are based on User-Generated Content (UGC). Thanks to the integrated search engines, users of these platforms can discover and follow their peers based on the UGC and its quality. Here, we propose an untouched meritocratic approach for directed network formation, inspired by empirical evidence on Twitter data: actors continuously search for the best UGC provider. We theoretically and numerically analyze the network equilibria properties under different meeting probabilities: while featuring common real-world networks properties, e.g., scaling law or small-world effect, our model predicts that the expected in-degree follows a Zipf’s law with respect to the quality ranking. Notably, the results are robust against the effect of recommendation systems mimicked through preferential attachment based meeting approaches. Our theoretical results are empirically validated against large data sets collected from Twitch, a fast-growing platform for online gamers.

Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs

Graphs (networks) are an important tool to model data in different domains. Realworld graphs are usually directed, where the edges have a direction and they are not symmetric. Betweenness centrality is an important index widely used to analyze networks. In this paper, first given a directed network G and a vertex r ∈ V (G), we propose an exact algorithm to compute betweenness score of r. Our algorithm pre-computes a set ℛ𝒱(r), which is used to prune a huge amount of computations that do not contribute to the betweenness score of r. Time complexity of our algorithm depends on |ℛ𝒱(r)| and it is respectively Θ(|ℛ𝒱(r)| · |E(G)|) and Θ(|ℛ𝒱(r)| · |E(G)| + |ℛ𝒱(r)| · |V(G)| log |V(G)|) for unweighted graphs and weighted graphs with positive weights. |ℛ𝒱(r)| is bounded from above by |V(G)| – 1 and in most cases, it is a small constant. Then, for the cases where ℛ𝒱(r) is large, we present a simple randomized algorithm that samples from ℛ𝒱(r) and performs computations for only the sampled elements. We show that this algorithm provides an (ɛ, δ)-approximation to the betweenness score of r. Finally, we perform extensive experiments over several real-world datasets from different domains for several randomly chosen vertices as well as for the vertices with the highest betweenness scores. Our experiments reveal that for estimating betweenness score of a single vertex, our algorithm significantly outperforms the most efficient existing randomized algorithms, in terms of both running time and accuracy. Our experiments also reveal that our algorithm improves the existing algorithms when someone is interested in computing betweenness values of the vertices in a set whose cardinality is very small.

Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems

We consider the following general network design problem. The input is an asymmetric metric (V, c), root [Formula: see text], monotone submodular function [Formula: see text], and budget B. The goal is to find an r-rooted arborescence T of cost at most B that maximizes f(T). Our main result is a simple quasi-polynomial time [Formula: see text]-approximation algorithm for this problem, in which [Formula: see text] is the number of vertices in an optimal solution. As a consequence, we obtain an [Formula: see text]-approximation algorithm for directed (polymatroid) Steiner tree in quasi-polynomial time. We also extend our main result to a setting with additional length bounds at vertices, which leads to improved [Formula: see text]-approximation algorithms for the single-source buy-at-bulk and priority Steiner tree problems. For the usual directed Steiner tree problem, our result matches the best previous approximation ratio but improves significantly on the running time. For polymatroid Steiner tree and single-source buy-at-bulk, our result improves prior approximation ratios by a logarithmic factor. For directed priority Steiner tree, our result seems to be the first nontrivial approximation ratio. Under certain complexity assumptions, our approximation ratios are the best possible (up to constant factors).