This chapter analyses the concept of network bipartivity and how to measure the degree of bipartivity of a non-bipartite network. It starts by considering a computational method based on counting the number of frustrated links in a network and then introduces the concept of spectral measure of bipartivity. The chapter moves on to analyse methods for identifying the best bipartition of nodes in a network; methods based on the communicability between two nodes in terms of the physical analogy of absolute negative temperature; and methods to solve the more challenging problem of finding bipartitions in directed networks. In all cases, examples from real-world scenarios are used to illustrate the methods.
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.
If you think you should have access to this title, please contact your librarian.