Jump to ContentJump to Main Navigation
NetworksAn Introduction$
Users without a subscription are not able to see the full content.

Mark Newman

Print publication date: 2010

Print ISBN-13: 9780199206650

Published to Oxford Scholarship Online: September 2010

DOI: 10.1093/acprof:oso/9780199206650.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 13 April 2021

Mathematics of networks

Mathematics of networks

An introduction to the mathematical tools used in the study of networks, tools that will be important to many subsequent developments

(p.109) Chapter 6 Mathematics of networks

M. E. J. Newman

Oxford University Press

This chapter introduces the basic theoretical tools used to describe and analyze networks, most of which come from graph theory, the branch of mathematics that deals with networks. Topics covered include the adjacency matrix, weighted networks, directed networks, hypergraphs, bipartite networks, trees, planar networks, the graph Laplacian, and random walks. Exercises are provided at the end of the chapter.

Keywords:   graph theory, network analysis, matrix, graph Laplacian, random walks

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .