Network topology measures

被引：3

作者：

Kincaid, Rex K. ^{[1
]}

Phillips, David J. ^{[1
]}

机构：

[1] Coll William & Mary, Dept Math, Williamsburg, VA 23185 USA

来源：

WILEY INTERDISCIPLINARY REVIEWS-COMPUTATIONAL STATISTICS | 2011年 / 3卷 / 06期

关键词：

network topology; spectral graph theory; combinatorial optimization; mathematical programming;

D O I：

10.1002/wics.180

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

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. (C) 2011 John Wiley & Sons, Inc.

引用

页码：557 / 565

页数：9