Community Detection in Massive Graphs

WNCG Ph.D Students Dimitris Papailiopoulos and Yannis Mitliagkas, along with WNCG Professors Alex Dimakis and Constantine Caramanis, have developed an efficient low-rank framework for finding dense components of graphs with billions of connections.

Detecting Epidemics in Networks

WNCG Ph.D. student Chris Milling, along with WNCG Professors Constantine Caramanis and Sanjay Shakkottai, and Technion Professor Shie Mannor, have developed efficient algorithms for quickly and efficiently determining if an epidemic is spreading through a social network.

Memory-Limited Learning

WNCG Prof. Constantine Caramanis along with Ph.D. student Ioannis Mitliagkas and MSR Bangalore researcher Dr. Prateek Jain, have obtained the first-ever linear-memory algorithm for Principal Component Analysis. Their algorithm is efficient to implement, needs to see each data point only once, and works even in the setting of many missing entries.

Subscribe to RSS - Statistics