Spectral measures of bipartivity in complex networks

Ernesto Estrada and Juan A. Rodríguez-Velázquez
Phys. Rev. E 72, 046105 – Published 7 October 2005

Abstract

We introduce a quantitative measure of network bipartivity as a proportion of even to total number of closed walks in the network. Spectral graph theory is used to quantify how close to bipartite a network is and the extent to which individual nodes and edges contribute to the global network bipartivity. It is shown that the bipartivity characterizes the network structure and can be related to the efficiency of semantic or communication networks, trophic interactions in food webs, construction principles in metabolic networks, or communities in social networks.

  • Figure
  • Figure
  • Received 27 June 2005

DOI:https://doi.org/10.1103/PhysRevE.72.046105

©2005 American Physical Society

Authors & Affiliations

Ernesto Estrada1,* and Juan A. Rodríguez-Velázquez2

  • 1Complex Systems Research Group, X-rays Unit, RIAIDT, Edificio CACTUS, University of Santiago de Compostela, 15706 Santiago de Compostela, Spain
  • 2Department of Mathematics, University Carlos III de Madrid, 28911 Leganés (Madrid), Spain

  • *Author to whom correspondence should be addressed. Email address: estraad66@yahoo.com

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 72, Iss. 4 — October 2005

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×