Amazon cover image
Image from Amazon.com

Network Analysis [electronic resource] : Methodological Foundations /

Contributor(s): Material type: TextTextSeries: Theoretical Computer Science and General Issues ; 3418Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005Edition: 1st ed. 2005Description: XII, 472 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540319559
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 004.0151 23
LOC classification:
  • QA76.9.M35
  • QA297.4
Online resources:
Contents:
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.
In: Springer Nature eBookSummary: ‘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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

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.

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

There are no comments on this title.

to post a comment.
© 2024 IIIT-Delhi, library@iiitd.ac.in