Bookbot

Lecture Notes in Computer Science - 3418: Network Analysis

Methodological Foundations

Évaluation du livre

En savoir plus sur le livre

‘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.

Achat du livre

Lecture Notes in Computer Science - 3418: Network Analysis, Ulrik Brandes, Thomas Erlebach

Langue
Année de publication
2005
product-detail.submit-box.info.binding
(souple)
Nous vous informerons par e-mail dès que nous l’aurons retrouvé.

Modes de paiement

4,1
Très bien
8 Évaluations

Il manque plus que ton avis ici.

Titre
Lecture Notes in Computer Science - 3418: Network Analysis
Sous-titre
Methodological Foundations
Langue
Anglais
Éditeur
Springer
Publié
2005
Format
souple
Pages
471
ISBN10
3540249796
ISBN13
9783540249795
Séries
Évaluation
4,1 sur 5
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.