Hierarchical characterization of complex networks

DOI10.1007/S10955-006-9130-YzbMATH Open1107.82323arXivcond-mat/0412761OpenAlexW2028525255MaRDI QIDQ867697FDOQ867697

Authors: Luciano Da Fontoura Costa, Filipi Nascimento Silva 

Publication date: 16 February 2007

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Abstract: While the majority of approaches to the characterization of complex networks has relied on measurements considering only the immediate neighborhood of each network node, valuable information about the network topological properties can be obtained by considering further neighborhoods. The current work discusses on how the concepts of hierarchical node degree and hierarchical clustering coefficient (introduced in cond-mat/0408076), complemented by new hierarchical measurements, can be used in order to obtain a powerful set of topological features of complex networks. The interpretation of such measurements is discussed, including an analytical study of the hierarchical node degree for random networks, and the potential of the suggested measurements for the characterization of complex networks is illustrated with respect to simulations of random, scale-free and regular network models as well as real data (airports, proteins and word associations). The enhanced characterization of the connectivity provided by the set of hierarchical measurements also allows the use of agglomerative clustering methods in order to obtain taxonomies of relationships between nodes in a network, a possibility which is also illustrated in the current article.

Full work available at URL: https://arxiv.org/abs/cond-mat/0412761

Recommendations

• Hierarchical organization of modularity in complex networks
• On the relationships between topological measures in real-world networks
• scientific article
• Deterministic hierarchical networks
• Finding and evaluating the hierarchical structure in complex networks

zbMATH Keywords

complex networksdisordered systemshierarchical measurementsnetworks and graphs

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30)

Cites Work

• Statistical mechanics of complex networks
• Pattern classification.
• Introduction to algorithms.
• The Structure and Function of Complex Networks
• Collective dynamics of `small-world' networks
• Ward identities and anomalies in pure \(W_4\) gravity
• Shape Classification and Analysis

Cited In (20)

• HIERARCHICAL AND MIXING PROPERTIES OF STATIC COMPLEX NETWORKS EMERGING FROM FLUCTUATING CLASSICAL RANDOM GRAPHS
• A quantitative measure for path structures of complex networks
• Image edge detection based on local dimension: a complex networks approach
• A hierarchical network formation model
• Finding and evaluating the hierarchical structure in complex networks
• High-order degree and combined degree in complex networks
• Using deterministic self-avoiding walks as a small-world metric on Watts-Strogatz networks
• Hierarchical Network Models for Exchangeable Structured Interaction Processes
• Title not available (Why is that?)
• Modeling the evolution of complex networks through the path-star transformation and optimal multivariate methods
• Viral spreading of daily information in online social networks
• Complex network classification using partially self-avoiding deterministic walks
• Texture Discrimination Using Hierarchical Complex Networks
• The landscape of complex networks -- critical nodes and a hierarchical decomposition
• Hierarchical organization of modularity in complex networks
• Cascade phenomenon in multilayer networks with dependence groups and hierarchical structure
• On the relationships between topological measures in real-world networks
• Multilevel network characterization using regular topologies
• Complex network time series analysis of a macroeconomic model
• A new structural entropy measurement of networks based on the nonextensive statistical mechanics and hub repulsion

This page was built for publication: Hierarchical characterization of complex networks

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