Graph clustering based on modularity variation estimations

DOI10.26516/1997-7670.2018.25.63MaRDI QIDQ1717412zbMATH OpenOpenAlexFDO

Authors Nikita Nikolaevich Martynov, Ol'ga Vladimirovna Khandarova, Fëdor Vladimirovich Khandarov

Publication date 5 February 2019

Published in The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL http://mathizv.isu.ru/assets/articles/0c03f1f6-4a4b-47e2-b6cb-4f8e4ad86359.pdf

zbMATH Keywords

community detectiongraph clusteringmodularitysocial network analysis

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30)

Recommendations

• A partitioning-based divisive clustering technique for maximizing the modularity
• On Finding Graph Clusterings with Maximum Modularity
• Significance-Driven Graph Clustering
• A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection
• scientific article; zbMATH DE number 6180551

Cites work

• Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
• Computing Communities in Large Networks Using Random Walks
• Fast unfolding of communities in large networks

Cited in

(1)

• Dynamic graph clustering combining modularity and smoothness

Describes a project that uses

Uses Software

• igraph

This page was built for publication: Graph clustering based on modularity variation estimations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1717412)