Network community detection using modularity density measures

DOI10.1088/1742-5468/aabfc8zbMath1459.05311arXiv1708.06810OpenAlexW2749914992MaRDI QIDQ4964606

Tianlong Chen, K. E. Bassler, Pramesh Singh

Publication date: 2 March 2021

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (4)

Edge intensity-based community measurement in complex networks ⋮ A study on modularity density maximization: column generation acceleration and computational complexity analysis ⋮ Detecting communities in complex networks using triangles and modularity density ⋮ Modified modularity density maximization and density ratio heuristic

Cites Work

• Fast and accurate determination of modularity and its effect size
• Constrained Markovian dynamics of random graphs
• Finding network communities using modularity density
• An Efficient Heuristic Procedure for Partitioning Graphs
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• Constructing and sampling directed graphs with given degree sequences
• Exact sampling of graphs with prescribed degree correlations
• Fast unfolding of communities in large networks

This page was built for publication: Network community detection using modularity density measures