Cantitate/Preț
Produs

Network Analysis: Methodological Foundations: Lecture Notes in Computer Science, cartea 3418

Editat de Ulrik Brandes, Thomas Erlebach
en Limba Engleză Paperback – 9 feb 2005
‘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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 50542 lei

Preț vechi: 63177 lei
-20% Nou

Puncte Express: 758

Preț estimativ în valută:
9673 10047$ 8035£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540249795
ISBN-10: 3540249796
Pagini: 488
Ilustrații: XII, 472 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.72 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Fundamentals.- I Elements.- Centrality Indices.- Algorithms for Centrality Indices.- Advanced Centrality Concepts.- II Groups.- Local Density.- Connectivity.- Clustering.- Role Assignments.- Blockmodels.- Network Statistics.- Network Comparison.- Network Models.- Spectral Analysis.- Robustness and Resilience.

Caracteristici

Includes supplementary material: sn.pub/extras