How can we find patterns and anomalies in large graphs that do not fit in the memory or disks of a single machine? Graphs are everywhere in our lives: social networks, the World Wide Web, biological networks, and many more. These graphs are growing at unprecedented rate, now exceeding billions of nodes and edges. What are the patterns and anomalies in such big graphs? How to design scalable algorithms to discover them? In this project, we work on algorithms, systems, and applications for analyzing large graphs, like social networks or the Web.
We develop algorithms and systems for the following areas.
We develop applications in the following areas.