A spectral method for bipartizing a network and detecting a large anti-community

DOI10.1016/j.cam.2019.06.022zbMath1434.90037arXiv1812.08408OpenAlexW2949965324WikidataQ127657672 ScholiaQ127657672MaRDI QIDQ1989180

Giuseppe Rodriguez, Silvia Noschese, Lothar Reichel, Anna Concas

Publication date: 24 April 2020

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.08408

zbMATH Keywords

network analysisbipartizationnetwork approximationanti-community

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Network bipartitioning in the anti-communicability Euclidean space, A doubly relaxed minimal-norm Gauss-Newton method for underdetermined nonlinear least-squares problems, specbip

Uses Software

• Pajek
• Pajek datasets
• MatlabBGL
• PQSER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \texttt{PQser:} a Matlab package for spectral seriation
• On a conjecture concerning spanning tree invariants and loop systems
• Anti-modularity and anti-community detecting in complex networks
• On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph
• A modularity based spectral method for simultaneous community and anti-community detection
• Network bipartivity and the transportation efficiency of European passenger airlines
• Discovering bipartite substructure in directed networks
• Edge-Deletion Problems
• Core-Periphery Structure in Networks (Revisited)
• Networks