Premium
Network topology measures
Author(s) -
Kincaid Rex K.,
Phillips David J.
Publication year - 2011
Publication title -
wiley interdisciplinary reviews: computational statistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.693
H-Index - 38
eISSN - 1939-0068
pISSN - 1939-5108
DOI - 10.1002/wics.180
Subject(s) - network topology , computer science , network science , topology (electrical circuits) , network analysis , integer programming , identification (biology) , graph , set (abstract data type) , complex network , theoretical computer science , data mining , computer network , mathematics , algorithm , engineering , botany , combinatorics , biology , world wide web , electrical engineering , programming language
Networks have emerged as a unifying modeling tool across a diverse set of problem domains. Evolving methods for the analysis and design of networks must be able to address network performance in the face of increasing demands, contain and control local network disturbances, and efficiently determine network topologies that accurately represent the underlying process. Central to this effort is the identification of network‐invariant functions that measure relevant topological features such as connectivity and sparsity. Results concerning network topology measures and their relationship to global and local network structures are surveyed. WIREs Comp Stat 2011 3 557–565 DOI: 10.1002/wics.180 This article is categorized under: Data: Types and Structure > Graph and Network Data Algorithms and Computational Methods > Integer Programming