3D Modularity Community Detection in a Quantum-Tech Collaboration Network
A free-orbit 3D graph of quantum-tech researchers where a real greedy modularity-optimization algorithm (Clauset-Newman-Moore) discovers hidden research communities, visibly pulling same-community clusters together as the live modularity Q climbs.
This is the free-orbit 3D counterpart to the 2D modularity community-detection simulation: the same synthetic quantum-tech collaboration network and the same real greedy modularity-optimization algorithm (Clauset–Newman–Moore), but rendered as a 3D point cloud you can rotate and zoom around. Communities are discovered, not assigned — every merge is chosen because it produces the largest exact increase in Q = Σ_c[L_c/m − (K_c/2m)²] computed from the graph's own adjacency and degree sequence — and as detection converges, same-community researchers visibly pull together into distinct clusters in 3D space while different communities drift apart.
Explore the 3D visualization of a synthetic quantum-tech researcher collaboration network optimized using greedy modularity-optimization (Clauset-Newman-Moore) where nodes from the same community feel an extra spring pull, separating and drawing together clusters as the algorithm converges.
3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install