Anti-modularity and anti-community detecting in complex networks

DOI10.1016/j.ins.2014.02.040zbMath1341.05234OpenAlexW2057306547MaRDI QIDQ726563

Qiang Yu, Ling Chen, Bo-Lun Chen

Publication date: 11 July 2016

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.02.040

zbMATH Keywords

bipartite graphcomplex networkanti-community structureanti-modularity

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items (13)

Imbalance problem in community detection ⋮ Network bipartitioning in the anti-communicability Euclidean space ⋮ The expected adjacency and modularity matrices in the degree corrected stochastic block model ⋮ Community detection with the label propagation algorithm: a survey ⋮ Discovering block structure in networks ⋮ An instance voting approach to feature selection ⋮ A spectral method for bipartizing a network and detecting a large anti-community ⋮ Density-based modularity for evaluating community structure in bipartite networks ⋮ Visualizing network communities with a semi-definite programming method ⋮ Controllability and modularity of complex networks ⋮ A framework of mapping undirected to directed graphs for community detection ⋮ A modularity based spectral method for simultaneous community and anti-community detection ⋮ Dominating communities for hierarchical control of complex networks

Cites Work

• Identification of overlapping and non-overlapping community structure by fuzzy clustering in complex networks
• Complex networks and economics
• Complex networks: structure and dynamics
• Maximizing modularity intensity for community partition and evolution
• Revealing network communities with a nonlinear programming method
• Enhancing community detection using a network weighting strategy
• Authoritative sources in a hyperlinked environment
• On Finding Graph Clusterings with Maximum Modularity
• Mixture models and exploratory analysis in networks
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• Bipartite Subgraphs and the Smallest Eigenvalue
• Max cut and the smallest eigenvalue

This page was built for publication: Anti-modularity and anti-community detecting in complex networks