{"title":"Spectral techniques for measuring bipartivity and producing partitions","authors":"Azhar Aleidan, P. Knight","doi":"10.1093/comnet/cnad026","DOIUrl":null,"url":null,"abstract":"\n Complex networks can often exhibit a high degree of bipartivity. There are many well-known ways for testing this, and in this article, we give a systematic analysis of characterizations based on the spectra of the adjacency matrix and various graph Laplacians. We show that measures based on these characterizations can be drastically different results and leads us to distinguish between local and global loss of bipartivity. We test several methods for finding approximate bipartitions based on analysing eigenvectors and show that several alternatives seem to work well (and can work better than more complex methods) when augmented with local improvement.","PeriodicalId":15442,"journal":{"name":"Journal of complex networks","volume":"16 1","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2023-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of complex networks","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1093/comnet/cnad026","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Complex networks can often exhibit a high degree of bipartivity. There are many well-known ways for testing this, and in this article, we give a systematic analysis of characterizations based on the spectra of the adjacency matrix and various graph Laplacians. We show that measures based on these characterizations can be drastically different results and leads us to distinguish between local and global loss of bipartivity. We test several methods for finding approximate bipartitions based on analysing eigenvectors and show that several alternatives seem to work well (and can work better than more complex methods) when augmented with local improvement.
期刊介绍:
Journal of Complex Networks publishes original articles and reviews with a significant contribution to the analysis and understanding of complex networks and its applications in diverse fields. Complex networks are loosely defined as networks with nontrivial topology and dynamics, which appear as the skeletons of complex systems in the real-world. The journal covers everything from the basic mathematical, physical and computational principles needed for studying complex networks to their applications leading to predictive models in molecular, biological, ecological, informational, engineering, social, technological and other systems. It includes, but is not limited to, the following topics: - Mathematical and numerical analysis of networks - Network theory and computer sciences - Structural analysis of networks - Dynamics on networks - Physical models on networks - Networks and epidemiology - Social, socio-economic and political networks - Ecological networks - Technological and infrastructural networks - Brain and tissue networks - Biological and molecular networks - Spatial networks - Techno-social networks i.e. online social networks, social networking sites, social media - Other applications of networks - Evolving networks - Multilayer networks - Game theory on networks - Biomedicine related networks - Animal social networks - Climate networks - Cognitive, language and informational network