Page 1
Page 1
Network Analysis : Methodological Foundations
‘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.
Combinatorial and algorithmic aspects of networking ; Vol.3405 ; 1st Workshop on combinatorial and algorithmic aspects of networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers
The Internet is a massive global network of over 700 million users and it is addingusers at the rate of 300,000 per day. This large, distributed, and everchangingnetwork poses a challenge to researchers: How does one study, model, or under-stand such a decentralized, constantly evolving entity? The workshop Combi-natorial and Algorithmic Aspects of Networking and the Internet (CAAN 2004)provided a forum for the exchange of ideas on these topics. and among thepapers were some new and surprising results as well as some introductions tothe foundations of the field.The workshop program featured 12 peer-reviewed papers bracketed by Topics covered by the talks ranged from the Web graph to game theoryto string matching, all in the context of large-scale networks. This volume collectstogether the talks delivered at the workshop along with a number of survey articlesto round out the presentation and give a comprehensive introduction to the topic.
Combinatorial and Algorithmic Aspects of Networking (vol. # 4235) ; Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers
This book constitutes the thoroughly refereed post-proceedings of the Third Workshop on Combinatorial and Algorithmic Aspects of Networking, held in Chester, UK in July 2006, co-located with the 13th Colloquium on Structural Information and Communication Complexity, SIROCCO 2006.The 10 revised full papers and one invited lecture cover a range from the Web graph to game theory to string matching, all in the context of large-scale networks.
Algorithms and Models for the Web-Graph ; 4th International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers
his book constitutes the revised papers of the Fourth International Workshop on Algorithms and Models for the Web-Graph, WAW 2006, held in Banff, Canada, November 30 - December 1, 2006.
