Matrix algorithms and graph partitioning
Matrix algorithms and graph partitioning
A discussion of network algorithms that use matrix and linear algebra methods, including algorithms for partitioning network nodes into groups
The preceding chapter discussed a variety of computer algorithms for calculating quantities of interest on networks, including degrees, centralities, shortest paths, and connectivity. This chapter continues the study of network algorithms with algorithms based on matrix calculations and methods of linear algebra applied to the adjacency matrix or other network matrices such as the graph Laplacian. It begins with a simple example — the calculation of eigenvector centrality — which involves finding the leading eigenvector of the adjacency matrix, and then moves on to some more advanced examples, including Fiedler's spectral partitioning method and algorithms for network community detection. Exercises are provided at the end of the chapter.
Keywords: network algorithms, network calculations, matrix calculations, linear algebra
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 .
