Community detection in networks via a spectral heuristic based on the clustering coefficient

DOI10.1016/J.DAM.2013.09.017zbMath1298.05294OpenAlexW1997527463MaRDI QIDQ403568

Mariá C. V. Nascimento

Publication date: 29 August 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.09.017

zbMATH Keywords

clustering coefficientgraph clusteringcommunity detection in networksspectral heuristicunweighted graphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

A new measure of the resilience for networks of funds with applications to socially responsible investments ⋮ Independence versus indetermination: basis of two canonical clustering criteria ⋮ Estimating the clustering coefficient using sample complexity analysis ⋮ A spectral method to detect community structure based on distance modularity matrix ⋮ A divisive spectral method for network community detection ⋮ A novel method of generating tunable network topologies for social simulation ⋮ A framework of mapping undirected to directed graphs for community detection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral methods for graph clustering - a survey
• Modularity-maximizing graph communities via mathematical programming
• Spectral partitioning with multiple eigenvectors
• Complex networks: structure and dynamics
• Communities in Networks
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• 10.1162/153244303321897735
• Fast unfolding of communities in large networks
• Computing Communities in Large Networks Using Random Walks
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Community detection in networks via a spectral heuristic based on the clustering coefficient