Local community detection in dynamic graphs using personalized centrality

DOI10.3390/a10030102zbMath1433.68305OpenAlexW2751435225MaRDI QIDQ1657082

Anita Zakrzewska, Jason Riedy, Eisha Nathan, David A. Bader

Publication date: 13 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a10030102

zbMATH Keywords

dynamic graphslocal community detectionpersonalized centrality metrics

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

M-Centrality: identifying key nodes based on global position and local degree variation

Uses Software

• DIMACS
• GenLouvain
• KONECT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new status index derived from sociometric analysis
• Estimating PageRank on graph streams
• Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Community structure in social and biological networks
• Dynamic graph clustering combining modularity and smoothness
• Fast unfolding of communities in large networks
• On the Limiting Behavior of Parameter-Dependent Network Centrality Measures
• Updating Markov Chains with an Eye on Google's PageRank
• Iterative Refinement in Floating Point
• CENTRALITY ESTIMATION IN LARGE NETWORKS