No Arabic abstract
The lack of studying the complex organization of directed network usually limits to the understanding of underlying relationship between network structures and functions. Structural controllability and structural predictability, two seemingly unrelated subjects, are revealed in this paper to be both highly dependent on the critical links previously thought to only be able to influence the number of driver nodes in controllable directed networks. Here, we show that critical links can not only contribute to structural controllability, but they can also have a significant impact on the structural predictability of networks, suggesting the universal pattern of structural reciprocity in directed networks. In addition, it is shown that the fraction and location of critical links have a strong influence on the performance of prediction algorithms. Moreover, these empirical results are interpreted by introducing the link centrality based on corresponding line graphs. This work bridges the gap between the two independent research fields, and it provides indications of developing advanced control strategies and prediction algorithms from a microscopic perspective.
In this paper, we consider the problem of exploring structural regularities of networks by dividing the nodes of a network into groups such that the members of each group have similar patterns of connections to other groups. Specifically, we propose a general statistical model to describe network structure. In this model, group is viewed as hidden or unobserved quantity and it is learned by fitting the observed network data using the expectation-maximization algorithm. Compared with existing models, the most prominent strength of our model is the high flexibility. This strength enables it to possess the advantages of existing models and overcomes their shortcomings in a unified way. As a result, not only broad types of structure can be detected without prior knowledge of what type of intrinsic regularities exist in the network, but also the type of identified structure can be directly learned from data. Moreover, by differentiating outgoing edges from incoming edges, our model can detect several types of structural regularities beyond competing models. Tests on a number of real world and artificial networks demonstrate that our model outperforms the state-of-the-art model at shedding light on the structural features of networks, including the overlapping community structure, multipartite structure and several other types of structure which are beyond the capability of existing models.
Many natural, engineered, and social systems can be represented using the framework of a layered network, where each layer captures a different type of interaction between the same set of nodes. The study of such multiplex networks is a vibrant area of research. Yet, understanding how to quantify the correlations present between pairs of layers, and more so present in their co-evolution, is lacking. Such methods would enable us to address fundamental questions involving issues such as function, redundancy and potential disruptions. Here we show first how the edge-set of a multiplex network can be used to construct an estimator of a joint probability distribution describing edge existence over all layers. We then adapt an information-theoretic measure of general correlation called the conditional mutual information, which uses the estimated joint probability distribution, to quantify the pairwise correlations present between layers. The pairwise comparisons can also be temporal, allowing us to identify if knowledge of a certain layer can provide additional information about the evolution of another layer. We analyze datasets from three distinct domains---economic, political, and airline networks---to demonstrate how pairwise correlation in structure and dynamical evolution between layers can be identified and show that anomalies can serve as potential indicators of major events such as shocks.
Interconnected networks are mathematical representation of systems where two or more simple networks are coupled to each other. Depending on the coupling weight between the two components, the interconnected network can function in two regimes: one where the two networks are structurally distinguishable, and one where they are not. The coupling threshold--denoting this structural transition--is one of the most crucial concepts in interconnected networks. Yet, current information about the coupling threshold is limited. This letter presents an analytical expression for the exact value of the coupling threshold and outlines network interrelation implications.
Real-world multi-layer networks feature nontrivial dependencies among links of different layers. Here we argue that, if links are directed, dependencies are twofold. Besides the ordinary tendency of links of different layers to align as the result of `multiplexity, there is also a tendency to anti-align as the result of what we call `multireciprocity, i.e. the fact that links in one layer can be reciprocated by emph{opposite} links in a different layer. Multireciprocity generalizes the scalar definition of single-layer reciprocity to that of a square matrix involving all pairs of layers. We introduce multiplexity and multireciprocity matrices for both binary and weighted multiplexes and validate their statistical significance against maximum-entropy null models that filter out the effects of node heterogeneity. We then perform a detailed empirical analysis of the World Trade Multiplex (WTM), representing the import-export relationships between world countries in different commodities. We show that the WTM exhibits strong multiplexity and multireciprocity, an effect which is however largely encoded into the degree or strength sequences of individual layers. The residual effects are still significant and allow to classify pairs of commodities according to their tendency to be traded together in the same direction and/or in opposite ones. We also find that the multireciprocity of the WTM is significantly lower than the usual reciprocity measured on the aggregate network. Moreover, layers with low (high) internal reciprocity are embedded within sets of layers with comparably low (high) mutual multireciprocity. This suggests that, in the WTM, reciprocity is inherent to groups of related commodities rather than to individual commodities. We discuss the implications for international trade research focusing on product taxonomies, the product space, and fitness/complexity metrics.
We study a two states opinion formation model driven by PageRank node influence and report an extensive numerical study on how PageRank affects collective opinion formations in large-scale empirical directed networks. In our model the opinion of a node can be updated by the sum of its neighbor nodes opinions weighted by the node influence of the neighbor nodes at each step. We consider PageRank probability and its sublinear power as node influence measures and investigate evolution of opinion under various conditions. First, we observe that all networks reach steady state opinion after a certain relaxation time. This time scale is decreasing with the heterogeneity of node influence in the networks. Second, we find that our model shows consensus and non-consensus behavior in steady state depending on types of networks: Web graph, citation network of physics articles, and LiveJournal social network show non-consensus behavior while Wikipedia article network shows consensus behavior. Third, we find that a more heterogeneous influence distribution leads to a more uniform opinion state in the cases of Web graph, Wikipedia, and Livejournal. However, the opposite behavior is observed in the citation network. Finally we identify that a small number of influential nodes can impose their own opinion on significant fraction of other nodes in all considered networks. Our study shows that the effects of heterogeneity of node influence on opinion formation can be significant and suggests further investigations on the interplay between node influence and collective opinion in networks.