×

Network analysis. Methodological foundations. (English) Zbl 1069.68001

Lecture Notes in Computer Science 3418. Berlin: Springer (ISBN 3-540-24979-6/pbk). xii, 471 p. (2005).

Show indexed articles as search result.

The articles of this volume will be reviewed individually.
Publisher’s description: “Network” is a heavily overloaded term, so that “network analysis” means different things to different people. Specific forms of network analysis are used in the study of diverse structures such as the Internet, interlocking directorates, transportation systems, epidemic spreading, metabolic pathways, the Web graph, electrical circuits, project plans, and so on. There is, however, a broad methodological foundation which is quickly becoming a prerequisite for researchers and practitioners working with network models.
From a computer science perspective, network analysis is applied graph theory. Unlike standard graph theory books, the content of this book is organized according to methods for specific levels of analysis (element, group, network) rather than abstract concepts like paths, matchings, or spanning subgraphs. Its topics therefore range from vertex centrality to graph clustering and the evolution of scale-free networks.
In 15 coherent chapters, this monograph-like tutorial book introduces and surveys the concepts and methods that drive network analysis, and is thus the first book to do so from a methodological perspective independent of specific application areas.
Indexed articles:
Brandes, Ulrik; Erlebach, Thomas, Chapter 1. Introduction, 1-6 [Zbl 1118.68313]
Brandes, Ulrik; Erlebach, Thomas, Chapter 2. Fundamentals, 7-15 [Zbl 1118.68314]
Koschützki, Dirk; Lehmann, Katharina Anna; Peeters, Leon; Richter, Stefan; Tenfelde-Podehl, Dagmar; Zlotowski, Oliver, Chapter 3. Centrality indices, 16-61 [Zbl 1118.68330]
Jacob, Riko; Koschützki, Dirk; Lehmann, Katharina Anna; Peeters, Leon; Tenfelde-Podehl, Dagmar, Chapter 4. Algorithms for centrality indices, 62-82 [Zbl 1118.68326]
Koschützki, Dirk; Lehmann, Katharina Anna; Tenfelde-Podehl, Dagmar; Zlotowski, Oliver, Chapter 5. Advanced centrality concepts, 83-111 [Zbl 1118.68331]
Kosub, Sven, Chapter 6. Local density, 112-142 [Zbl 1118.68332]
Kammer, Frank; Täubig, Hanjo, Chapter 7. Connectivity, 143-177 [Zbl 1118.68327]
Gaertler, Marco, Chapter 8. Clustering, 178-215 [Zbl 1118.68324]
Lerner, Jürgen, Chapter 9. Role assignments, 216-252 [Zbl 1118.68336]
Nunkesser, Marc; Sawitzki, Daniel, Chapter 10. Blockmodels, 253-292 [Zbl 1118.68343]
Brinkmeier, Michael; Schank, Thomas, Chapter 11. Network statistics, 293-317 [Zbl 1118.68315]
Baur, Michael; Benkert, Marc, Chapter 12. Network comparison, 318-340 [Zbl 1118.68311]
Baumann, Nadine; Stiller, Sebastian, Chapter 13. Network models, 341-372 [Zbl 1118.68310]
Baltz, Andreas; Kliemann, Lasse, Chapter 14. Spectral analysis, 373-416 [Zbl 1118.68309]
Klau, Gunnar W.; Weiskircher, René, Chapter 15. Robustness and resilience, 417-437 [Zbl 1118.68329]

MSC:

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68M10 Network design and communication in computer systems
68R10 Graph theory (including graph drawing) in computer science
00B25 Proceedings of conferences of miscellaneous specific interest
68-02 Research exposition (monographs, survey articles) pertaining to computer science
Full Text: DOI