Weighted network estimation by the use of topological graph metrics
arXiv:1705.00892 · doi:10.1109/TNSE.2018.2849342
Abstract
Topological metrics of graphs provide a natural way to describe the prominent features of various types of networks. Graph metrics describe the structure and interplay of graph edges and have found applications in many scientific fields. In this work, graph metrics are used in network estimation by developing optimisation methods that incorporate prior knowledge of a network's topology. The derivatives of graph metrics are used in gradient descent schemes for weighted undirected network denoising, network completion, and network decomposition. The successful performance of our methodology is shown in a number of toy examples and real-world datasets. Most notably, our work establishes a new link between graph theory, network science and optimisation.
arXiv commentAccepted for publication in IEEE Transactions on Network Science and Engineering
References in corpus (10)
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- The architecture of complex weighted networks
- Link Prediction in Complex Networks: A Survey
- Intensity and coherence of motifs in weighted complex networks
- Emergence of network features from multiplexity
- Characterization and Modeling of weighted networks
- Analytical maximum-likelihood method to detect patterns in real networks
- Enhanced reconstruction of weighted networks from strengths and degrees