Variability analysis of complex networks measures based on stochastic distances

DOI10.1016/J.PHYSA.2014.07.079zbMATH Open1395.05150arXiv1407.7890OpenAlexW2107945554MaRDI QIDQ1783129FDOQ1783129

Authors: Raquel Cabral, Alejandro C. Frery, J. A. Ramirez 

Publication date: 20 September 2018

Published in: Physica A (Search for Journal in Brave)

Abstract: Complex networks can model the structure and dynamics of different types of systems. It has been shown that they are characterized by a set of measures. In this work, we evaluate the variability of complex networks measures face to perturbations and, for this purpose, we impose controlled perturbations and quantify their effect. We analyze theoretical models (random, small-world and scale-free) and real networks (a collaboration network and a metabolic networks) along with the shortest path length, vertex degree, local cluster coefficient and betweenness centrality measures. In such analysis, we propose the use of three stochastic quantifiers: the Kullback-Leibler divergence and the Jensen-Shannon and Hellinger distances. The sensitivity of these measures was analyzed with respect to the following perturbations: edge addition, edge removal, edge rewiring and node removal, all of them applied at different intensities. The results reveal that the evaluated measures are influenced by these perturbations. Additionally, hypotheses tests were performed to verify the behavior of the degree distribution to identify the intensity of the perturbations that leads to break this property.

Full work available at URL: https://arxiv.org/abs/1407.7890

Recommendations

• The resistance perturbation distance: a metric for the analysis of dynamic networks
• Communication in complex networks
• Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds
• On the relationships between topological measures in real-world networks
• Malleability of complex networks

zbMATH Keywords

measuresvariabilitycomplex networkstochastic distance

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Complex networks: structure and dynamics
• Emergence of Scaling in Random Networks
• Title not available (Why is that?)
• Collective dynamics of `small-world' networks
• Title not available (Why is that?)
• Analyzing complex networks evolution through Information Theory quantifiers
• The structure of scientific collaboration networks
• On measuring the distance between histograms,
• Vulnerability of complex networks
• Edge vulnerability in neural and metabolic networks
• Clustering in random line graphs

Cited In (6)

• The resistance perturbation distance: a metric for the analysis of dynamic networks
• Distance-sum heterogeneity in graphs and complex networks
• Malleability of complex networks
• Title not available (Why is that?)
• An evolving model for the lodging-service network in a tourism destination
• Exact probabilities for the indeterminacy of complex networks as perceived through press perturbations

Uses Software

• R

This page was built for publication: Variability analysis of complex networks measures based on stochastic distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1783129)