Networks: An IntroductionOUP Oxford, 2010 M03 25 - 784 páginas The scientific study of networks, including computer networks, social networks, and biological networks, has received an enormous amount of interest in the last few years. The rise of the Internet and the wide availability of inexpensive computers have made it possible to gather and analyze network data on a large scale, and the development of a variety of new theoretical tools has allowed us to extract new knowledge from many different kinds of networks. The study of networks is broadly interdisciplinary and important developments have occurred in many fields, including mathematics, physics, computer and information sciences, biology, and the social sciences. This book brings together for the first time the most important breakthroughs in each of these fields and presents them in a coherent fashion, highlighting the strong interconnections between work in different areas. Subjects covered include the measurement and structure of networks in many branches of science, methods for analyzing network data, including methods developed in physics, statistics, and sociology, the fundamentals of graph theory, computer algorithms, and spectral methods, mathematical models of networks, including random graph models and generative models, and theories of dynamical processes taking place on networks. |
Contenido
Preface | |
The empirical study of networks | |
Technological networks | |
Social networks | lxvii |
Percolation and network resilience | lxi |
Epidemics on networks | cxxxi |
Dynamical systems on networks | ciii |
Networks ofinformation 4 1 The World WideWeb | 4 |
Otras ediciones - Ver todas
Términos y frases comunes
adjacency list adjacency matrix algorithm andthe average behavior bipartite breadth-first search calculate chapter citation networks clustering coefficient cocitation community detection configuration model Consider corresponding degree distribution directed network discussed disease distance eigenvalue eigenvector centrality elements epidemic equation example expected number exponential Figure fixed point fraction function geodesic giant cluster giant component given groups hence in-component in-degree individuals infected instance interactions Internet inthe Laplacian mean measure metabolic modularity multiedges neighbors number of edges number of vertices numberof ofthe out-components out-degree pair of vertices percolation power-law degree distribution preferential attachment probability problem protein random graph represent result scale-free network Section self-edges shortcuts shortest path similar simple small components small-world model social networks solution strongly connected component structure thatthe thenetwork thenumber total number tothe tree undirected vector vertex weakly connected component wecan zero