2005/04/27 by Ernesto Estrada, Juan A. Rodríguez‐Velázquez, Juan A. Rodriguez-Velazquez · 2 citations
Biochemistry, Genetics and Molecular Biology · Mathematics · Physics and Astronomy · #Bioinformatics and Genomic Networks #Biology #Bipartite graph #Combinatorics #Complex Network Analysis Techniques #Complex network #Computer network #Computer science #Data mining #Dynamic network analysis #Ecology #Gene Regulatory Network Analysis #Graph #Graph theory #Line graph #Mathematics #Measure (data warehouse) #Network analysis #Network science #Network structure #Network theory #Physics #Spectral graph theory #Spectral properties #Statistics #Theoretical computer science #Trophic level #Voltage graph #World Wide Web #cond-mat.stat-mech #physics.soc-ph
paper · pdf · doi:10.1103/physreve.72.046105
16 pages, 1 figure, 1 table
arxiv created 2005/04/27 · openalex publication_date 2005/10/07 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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.