Community detection by resistance distance: automation and benchmark testing

DOI10.1007/978-3-030-93409-5_26zbMath1506.05192arXiv2111.04438OpenAlexW3213250931MaRDI QIDQ2086605

Juan Gancio, Nicolás Rubido

Publication date: 25 October 2022

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

zbMATH Keywords

community detectionresistance distancebenchmark tests

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Resistance distance and the normalized Laplacian spectrum
• Laplacians and the Cheeger inequality for directed graphs
• Finding the resistance distance and eigenvector centrality from the network's eigenvalues
• Complex networks: structure and dynamics
• On clusterings
• Community structure in social and biological networks
• Graph Clustering using Effective Resistance

This page was built for publication: Community detection by resistance distance: automation and benchmark testing