arXiv · cond-mat/0504729
Spectral Measures of Bipartivity in Complex Networks
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ernesto Estrada, Juan A. Rodriguez-Velazquez. 2005-04-27. Spectral Measures of Bipartivity in Complex Networks. https://doi.org/10.1103/physreve.72.046105
Cite the original work for its findings. Save a collection to share your selection of sources.