A First Course in Network Theory

— —

Ernesto Estrada (Professor and Chair in Complexity Science, Professor and Chair in Complexity Science, University of Strathclyde, UK) Philip A. Knight (Lecturer in Mathematics, Lecturer in Mathematics, University of Strathclyde, UK)

A First Course in Network Theory

Ernesto Estrada (Professor and Chair in Complexity Science, Professor and Chair in Complexity Science, University of Strathclyde, UK), Philip A. Knight (Lecturer in Mathematics, Lecturer in Mathematics, University of Strathclyde, UK)

$213.95

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Oxford University Press
12 February 2015

Cybernetics & systems theory; Combinatorics & graph theory; Mathematical modelling; Statistical physics; Mathematical theory of computation

The study of network theory is a highly interdisciplinary field, which has emerged as a major topic of interest in various disciplines ranging from physics and mathematics, to biology and sociology. This book promotes the diverse nature of the study of complex networks by balancing the needs of students from very different backgrounds. It references the most commonly used concepts in network theory, provides examples of their applications in solving practical problems, and clear indications on how to analyse their results.

In the first part of the book, students and researchers will discover the quantitative and analytical tools necessary to work with complex networks, including the most basic concepts in network and graph theory, linear and matrix algebra, as well as the physical concepts most frequently used for studying networks. They will also find instruction on some key skills such as how to proof analytic results and how to manipulate empirical network data. The bulk of the text is focused on instructing readers on the most useful tools for modern practitioners of network theory. These include degree distributions, random networks, network fragments, centrality measures, clusters and communities, communicability, and local and global properties of networks. The combination of theory, example and method that are presented in this text, should ready the student to conduct their own analysis of networks with confidence and allow teachers to select appropriate examples and problems to teach this subject in the classroom.

By: Ernesto Estrada (Professor and Chair in Complexity Science Professor and Chair in Complexity Science University of Strathclyde UK), Philip A. Knight (Lecturer in Mathematics, Lecturer in Mathematics, University of Strathclyde, UK)
Imprint: Oxford University Press
Country of Publication: United Kingdom
Dimensions: Height: 248mm, Width: 195mm, Spine: 20mm
Weight: 1g
ISBN: 9780198726456
ISBN 10: 0198726457
Pages: 270
Publication Date: 12 February 2015
Audience: College/higher education , A / AS level
Format: Hardback
Publisher's Status: Active

1: Introduction 2: General Concepts in Network Theory 3: How To Prove It? 4: Data Analysis 5: Algebraic Concepts in Network Theory 6: Spectra of Adjacency Matrices 7: The Network Laplacian 8: Classical Physcis Analogies 9: Degree Distributions 10: Clustering Coefficients of Networks 11: Random Models of Networks 12: Matrix Functions 13: Fragment Based Measures 14: Classical Node Centrality 15: Spectral Node Centrality 16: Quantum Physcis Analogies 17: Global Properties of Networks I 18: Global properties of networks II 19: Communicability in Networks 20: Statistical Physics Analogies 21: Communities in Networks

Ernesto Estrada is a Professor in Mathematics at the University of Strathclyde, UK. He is the Chair in Complexity Science since 2008 and the 1964 Chair in Mathematics since 2014. He holds the Wolfson Research Merit Award from the Royal Society and has published more than 160 papers and 10 book chapters. He is the author of The Structure of Complex Networks: Theory and Applications, published by Oxford University Press (OUP) in 2011. Professor Estrada is also the Editor-in-Chief of the Journal of Complex Networks published by OUP. His research interests are in the mathematical analysis of networks, the use of physical analogies to study networks and applications of network theory to society, chemistry, biology, ecology and engineering. Philip Knight is a Lecturer in Mathematics at the University of Strathclyde, UK. He obtained his PhD in Mathematics from the University of Manchester in 1993 and has spent most of his career carrying out research into matrix algebra. His interest in applications drew him inexorably towards network theory and his research interests now centre on the algebraic structure of networks as well as on the use of networks to represent other mathematical structures. More recently, Dr Knight has been involved in teaching courses on network theory in different countries and is well regarded among students for his expository abilities.