Researching Algorithms Design & Analysis, Graph Theory, and Social Network Analysis
Working in the Algorithms & Complexity Lab
Under the supervision of Professor Hovhannes Harutyunyan
Date: Aug 2024 – Now
My key role consisted of:
Designed Spider, a graph community detection algorithm combining geodesic expansion, modularity-guided refinement, and greedy merge matching.
Benchmarked Spider on 14 real-world networks (up to 8,035 nodes / 183,663 edges) against Leiden, Louvain, and Infomap, achieving 8–15% improvements in NMI, modularity, and F1-score.
Applied metric backbone sparsification, achieving an average 65% edge reduction, and introduced Weighted Average Geodesic Distance Modularity (wGDM) to normalize and balance GDM for local community quality evaluation.
Built a fully reproducible experimental pipeline with fixed random seeds, baseline implementations, and automated evaluation scripts.