Jump to ContentJump to Main Navigation
The Structure of Complex NetworksTheory and Applications$
Users without a subscription are not able to see the full content.

Ernesto Estrada

Print publication date: 2011

Print ISBN-13: 9780199591756

Published to Oxford Scholarship Online: December 2013

DOI: 10.1093/acprof:oso/9780199591756.001.0001

Show Summary Details
Page of

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

Network bipartivity

Network bipartivity

(p.214) (p.215) 11 Network bipartivity
The Structure of Complex Networks

Ernesto Estrada

Oxford University Press

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.

Keywords:   network bipartivity, link frustration, spectral bipartivity, exponential adjacency matrix, negative absolute temperature, bipartition clustering, directed bipartitions

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 .