Problem In Network Science Research Articles

Unsupervised learning for community detection in attributed networks based on graph convolutional network

Community detection has emerged during the last decade as one of the most challenging problems in network science, which has been revisited with network representation learning recently and has attracted considerable attention. Many approaches have been proposed in recent years, including the latest methods based on graph convolutional network (GCN). Here, we propose a new network representation learning method based on GCN for community detection in attributed networks without prior label information. Inspired by the message pass mechanism of GCN and the local self-organizing property of community structure, we integrate a label sampling model and GCN into an unsupervised learning framework to uncover underlying community structures by fusing topology and attribute information. The label sampling model constructs a balanced training set by structural center location and neighbor node expansion to train the GCN. The experiments on various real-world networks give a comparison view to evaluate the proposed method. The experimental results demonstrate the proposed method performs more efficiently with a comparative performance over current state-of-the-art community detection algorithms.

Measuring topological descriptors of complex networks under uncertainty.

Revealing the structural features of a complex system from the observed collective dynamics is a fundamental problem in network science. To compute the various topological descriptors commonly used to characterize the structure of a complex system (e.g., the degree, the clustering coefficient, etc.), it is usually necessary to completely reconstruct the network of relations between the subsystems. Several methods are available to detect the existence of interactions between the nodes of a network. By observing some physical quantities through time, the structural relationships are inferred using various discriminating statistics (e.g., correlations, mutual information, etc.). In this setting, the uncertainty about the existence of the edges is reflected in the uncertainty about the topological descriptors. In this study, we propose a methodological framework to evaluate this uncertainty, replacing the topological descriptors, even at the level of a single node, with appropriate probability distributions, eluding the reconstruction phase. Our theoretical framework agrees with the numerical experiments performed on a large set of synthetic and real-world networks. Our results provide a grounded framework for the analysis and the interpretation of widely used topological descriptors, such as degree centrality, clustering, and clusters, in scenarios in which the existence of network connectivity is statistically inferred or when the probabilities of existence π_{ij} of the edges are known. To this purpose, we also provide a simple and mathematically grounded process to transform the discriminating statistics into the probabilities π_{ij}.

Bounds of the sum of edge lengths in linear arrangements of trees

A fundamental problem in network science is the normalization of the topological or physical distance between vertices, which requires understanding the range of variation of the unnormalized distances. Here we investigate the limits of the variation of the physical distance in linear arrangements of the vertices of trees. In particular, we investigate various problems of the sum of edge lengths in trees of a fixed size: the minimum and the maximum value of the sum for specific trees, the minimum and the maximum in classes of trees (bistar trees and caterpillar trees) and finally the minimum and the maximum for any tree. We establish some foundations for research on optimality scores for spatial networks in one dimension.

Optimal networks for dynamical spreading.

The inverse problem of finding the optimal network structure for a specific type of dynamical process stands out as one of the most challenging problems in network science. Focusing on the susceptible-infected-susceptible type of dynamics on annealed networks whose structures are fully characterized by the degree distribution, we develop an analytic framework to solve the inverse problem. We find that, for relatively low or high infection rates, the optimal degree distribution is unique, which consists of no more than two distinct nodal degrees. For intermediate infection rates, the optimal degree distribution is multitudinous and can have a broader support. We also find that, in general, the heterogeneity of the optimal networks decreases with the infection rate. A surprising phenomenon is the existence of a specific value of the infection rate for which any degree distribution would be optimal in generating maximum spreading prevalence. The analytic framework and the findings provide insights into the interplay between network structure and dynamical processes with practical implications.

Quantification of Network Structural Dissimilarities Based on Graph Embedding

Identifying and quantifying structural dissimilarities between complex networks is a fundamental and challenging problem in network science. Previous network comparison methods are based on the structural features, such as the length of shortest path, degree and graphlet, which may only contain part of the topological information. Therefore, we propose an efficient network comparison method based on network embedding, i.e., \textit{DeepWalk}, which considers the global structural information. In detail, we calculate the distance between nodes through the vector extracted by \textit{DeepWalk} and quantify the network dissimilarity by spectral entropy based Jensen-Shannon divergences of the distribution of the node distances. Experiments on both synthetic and empirical data show that our method outperforms the baseline methods and can distinguish networks perfectly by only using the global embedding based distance distribution. In addition, we show that our method can capture network properties, e.g., average shortest path length and link density. Moreover, the experiments of modularity further implies the functionality of our method.

Network comparison and the within-ensemble graph distance

Quantifying the differences between networks is a challenging and ever-present problem in network science. In recent years, a multitude of diverse, ad hoc solutions to this problem have been introduced. Here, we propose that simple and well-understood ensembles of random networks—such as Erdős–Rényi graphs, random geometric graphs, Watts–Strogatz graphs, the configuration model and preferential attachment networks—are natural benchmarks for network comparison methods. Moreover, we show that the expected distance between two networks independently sampled from a generative model is a useful property that encapsulates many key features of that model. To illustrate our results, we calculate this within-ensemble graph distance and related quantities for classic network models (and several parameterizations thereof) using 20 distance measures commonly used to compare graphs. The within-ensemble graph distance provides a new framework for developers of graph distances to better understand their creations and for practitioners to better choose an appropriate tool for their particular task.

Link prediction with hyperbolic geometry

Link prediction is a paradigmatic problem in network science with a variety of applications. In latent space network models this problem boils down to ranking pairs of nodes in the order of increasing latent distances between them. The network model with hyperbolic latent spaces has a number of attractive properties suggesting it must be a powerful tool to predict links, but the past work in this direction reported mixed results. Here we perform systematic investigation of the utility of latent hyperbolic geometry for link prediction in networks. We first show that some measures of link prediction accuracy are extremely sensitive with respect to inaccuracies in the inference of latent hyperbolic coordinates of nodes, so that we develop a new coordinate inference method that maximizes the accuracy of such inference. Applying this method to synthetic and real networks, we then find that while there exists a multitude of competitive methods to predict obvious easy-to-predict links, among which hyperbolic link prediction is rarely the best but often competitive, it is the best, often by far, when the task is to predict less obvious missing links that are really hard to predict. These links include missing links in incomplete networks with large fractions of missing links, missing links between nodes that do not have any common neighbors, and missing links between dissimilar nodes at large latent distances. Overall these results suggest that the harder a specific link prediction task is, the more seriously one should consider using hyperbolic geometry.

Neighborhood and PageRank methods for pairwise link prediction

Link prediction is a common problem in network science that cuts across many disciplines. The goal is to forecast the appearance of new links or to find links missing in the network. Typical methods for link prediction use the topology of the network to predict the most likely future or missing connections between a pair of nodes. However, network evolution is often mediated by higher-order structures involving more than pairs of nodes; for example, cliques on three nodes (also called triangles) are key to the structure of social networks, but the standard link prediction framework does not directly predict these structures. To address this gap, in recent work, we propose a new link prediction task called “pairwise link prediction” that directly targets the prediction of new triangles, where one is tasked with finding which nodes are most likely to form a triangle with a given edge. We extend this work in this manuscript, and we evaluate a variety of natural extensions to link prediction methods including neighborhood and PageRank-based methods. A key difference from our previous work is the definition of the neighborhood of an edge, which has a surprisingly large impact on the empirical performance. Our experiments on a variety of networks show that diffusion-based methods are less sensitive to the type of graphs used and more consistent in their results. We also show how our pairwise link prediction framework can be used to get better predictions within the context of standard link prediction evaluation.

Precision as a measure of predictability of missing links in real networks.

Predicting missing links in real networks is an important open 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 different point of view on the problem and focus on predictability instead of prediction. By considering ensembles defined by well-known network models, we prove analytically that even the best possible link prediction method, given by the ensemble connection probabilities, yields a limited precision that depends quantitatively on the topological properties-such as degree heterogeneity, clustering, and community structure-of the ensemble. This suggests an absolute limitation to the predictability of missing links in real networks, due to the irreducible uncertainty arising from the random nature of link formation processes. We show that a predictability limit can be estimated in real networks, and we propose a method to approximate such a bound from real-world networks with missing links. The predictability limit gives a benchmark to gauge the quality of link prediction methods in real networks.

Improved mutual information measure for clustering, classification, and community detection.

The information theoretic measure known as mutual information is widely used as a way to quantify the similarity of two different labelings or divisions of the same set of objects, such as arises, for instance, in clustering and classification problems in machine learning or community detection problems in network science. Here we argue that the standard mutual information, as commonly defined, omits a crucial term which can become large under real-world conditions, producing results that can be substantially in error. We derive an expression for this missing term and hence write a corrected mutual information that gives accurate results even in cases where the standard measure fails. We discuss practical implementation of the new measure and give example applications.

Validity and Limitations of the Detection Matrix to Determine Hidden Units and Network Size from Perceptible Dynamics.

Determining the size of a network dynamical system from the time series of some accessible units is a critical problem in network science. Recent work by Haehne etal. [Phys. Rev. Lett. 122, 158301 (2019).PRLTAO0031-900710.1103/PhysRevLett.122.158301] has presented a model-free approach to address this problem, by studying the rank of a detection matrix that collates sampled time series of perceptible nodes from independent experiments. Here, we unveil a profound connection between the rank of the detection matrix and the control-theoretic notion of observability, upon which we conclude when and how it is feasible to exactly infer the size of a network dynamical system.

Revealing the predictability of intrinsic structure in complex networks

Structure prediction is an important and widely studied problem in network science and machine learning, finding its applications in various fields. Despite the significant progress in prediction algorithms, the fundamental predictability of structures remains unclear, as networks’ complex underlying formation dynamics are usually unobserved or difficult to describe. As such, there has been a lack of theoretical guidance on the practical development of algorithms for their absolute performances. Here, for the first time, we find that the normalized shortest compression length of a network structure can directly assess the structure predictability. Specifically, shorter binary string length from compression leads to higher structure predictability. We also analytically derive the origin of this linear relationship in artificial random networks. In addition, our finding leads to analytical results quantifying maximum prediction accuracy, and allows the estimation of the network dataset potential values through the size of the compressed network data file.

An Efficient Strategy to Improve Traffic Capacity of the Scale-free Network by Link-directed Method

How to improve traffic handing capacity of network is one of the important problems in network science due to its important implication for various modern communication networks. In this paper, we ...

Reconstructing Heterogeneous Networks via Compressive Sensing and Clustering

Reconstructing complex networks from observed data is a fundamental problem in network science. Compressive sensing, widely used for recovery of sparse signals, has also been used for network reconstruction under the assumption that networks are sparse. However, heterogeneous networks are not exactly sparse. Moreover, when using compressive sensing to recover signals, the projection matrix is usually a random matrix that satisfies the restricted isometry property (RIP) condition. This condition is much harder to satisfy during network reconstruction because the projection matrix depends on time-series data of network dynamics. To overcome these shortcomings, we devised a novel approach by adapting the alternating direction method of multipliers to find a candidate adjacency matrix. Then we used clustering to identify high-degree nodes. Finally, we replaced the elements of the candidate adjacency vectors of high-degree nodes, which are likely to be incorrect, with the corresponding elements of small-degree nodes, which are likely to be correct. The proposed method thus overcomes the shortcomings of compressive sensing and is suitable for reconstructing heterogeneous networks. Experiments with both artificial scale-free and empirical networks showed that the proposed method is accurate and robust.

Influence maximization by rumor spreading on correlated networks through community identification

The identification of the minimal set of nodes that maximizes the propagation of information is one of the most relevant problems in network science. In this paper, we introduce a new method to find the set of initial spreaders to maximize the information propagation in complex networks. We evaluate this method in assortative networks and verify that degree-degree correlation plays a fundamental role in the spreading dynamics. Simulation results show that our algorithm is statistically similar, regarding the average size of outbreaks, to the greedy approach in real-world networks. However, our method is much less time consuming than the greedy algorithm.

Network dependence testing via diffusion maps and distance-based correlations

Summary Deciphering the associations between network connectivity and nodal attributes is one of the core problems in network science. The dependency structure and high dimensionality of networks pose unique challenges to traditional dependency tests in terms of theoretical guarantees and empirical performance. We propose an approach to test network dependence via diffusion maps and distance-based correlations. We prove that the new method yields a consistent test statistic under mild distributional assumptions on the graph structure, and demonstrate that it is able to efficiently identify the most informative graph embedding with respect to the diffusion time. The methodology is illustrated on both simulated and real data.

Graph Convolutional Networks Meet Markov Random Fields: Semi-Supervised Community Detection in Attribute Networks

Community detection is a fundamental problem in network science with various applications. The problem has attracted much attention and many approaches have been proposed. Among the existing approaches are the latest methods based on Graph Convolutional Networks (GCN) and on statistical modeling of Markov Random Fields (MRF). Here, we propose to integrate the techniques of GCN and MRF to solve the problem of semi-supervised community detection in attributed networks with semantic information. Our new method takes advantage of salient features of GNN and MRF and exploits both network topology and node semantic information in a complete end-to-end deep network architecture. Our extensive experiments demonstrate the superior performance of the new method over state-of-the-art methods and its scalability on several large benchmark problems.

Recurrent neural networks for reconstructing complex directed brain connectivity.

While Granger Causality(GC)-based approaches have been widely employed in a vast number of problems in network science, the vast majority of GC applications are based on linear multivariate autoregressive (MVAR) models. However, it is well known that real-life system (and biological networks in particular) exhibit notable nonlinear behavior, hence undermining that validity of MVAR-based approaches to estimating GC (MVAR-GC). In this paper, we define a novel approach to estimating nonlinear, directed within-network interactions based on a specific class of recurrent neural networks (RNN) termed echo-state networks (ESN). We reformulate the classical GC framework in terms of ESN-based models for multivariate signals generated by arbitrarily complex networks, and characterize the ability of our ESN-based Granger Causality (ES-GC) to capture nonlinear causal relations by simulating multivariate coupling in a network of nonlinearly interacting, noisy Duffing oscillators operating in a chaotic regime. Synthetic validation shows a net advantage of ES-GC over all other estimators in detecting nonlinear, causal links. We then explore the structure of EC-GC networks in the human brain in functional MRI data from 1003 healthy subjects scanned at rest at 3T, discovering previously unknown between-network interactions. In summary, ES-GC performs significantly better than commonly used and recently developed GC detection tools, making it a superior tool for the analysis of e.g. multivariate biological networks.

Infectivity enhances prediction of viral cascades in Twitter.

Models of contagion dynamics, originally developed for infectious diseases, have proven relevant to the study of information, news, and political opinions in online social systems. Modelling diffusion processes and predicting viral information cascades are important problems in network science. Yet, many studies of information cascades neglect the variation in infectivity across different pieces of information. Here, we employ early-time observations of online cascades to estimate the infectivity of distinct pieces of information. Using simulations and data from real-world Twitter retweets, we demonstrate that these estimated infectivities can be used to improve predictions about the virality of an information cascade. Developing our simulations to mimic the real-world data, we consider the effect of the limited effective time for transmission of a cascade and demonstrate that a simple model of slow but non-negligible decay of the infectivity captures the essential properties of retweet distributions. These results demonstrate the interplay between the intrinsic infectivity of a tweet and the complex network environment within which it diffuses, strongly influencing the likelihood of becoming a viral cascade.

Mathematical analysis of nonlocal PDEs for network generation

In this paper, we study a certain class of nonlocal partial differential equations (PDEs). The equations arise from a key problem in network science, i.e., network generation from local interaction rules, which result in a change of the degree distribution as time progresses. The evolution of the generating function of this degree distribution can be described by a nonlocal PDE. To address this equation we will rigorously convert it into a local first order PDE. Then, we use theory of characteristics to prove solvability and regularity of the solution. Next, we investigate the existence of steady states of the PDE. We show that this problem reduces to an implicit ODE, which we subsequently analyze. Finally, we perform numerical simulations, which show stability of the steady states.