Research Interests

I am interested in Large Scale Networks - Social Networks, Internet, etc. In particular, (1) Modelling, Analysis and Simulation of Large Scale Networks and (2) Theoretic Problems- Information Diffusion, Link Prediction, etc. Look below for detailed information.

Research Experience



Navigability and Searching in Complex Networks
B.Tech Major Project
Sept 2010- Apr 2011
Guide : Praphul Chandra, Senior Research Scientist, Hewlett Packard Labs, Bangalore

I'm studying about Complex Networks and Decentralised Search Algorithms in these networks. I'm also studying efficient Search mechanisms based on Hidden Metric Spaces. Read more
Download the Report here.

Download the document on Random Walks in Power Law Graphs here



Placement Algorithm for Virtual Machines
Research Project
Feb 2010- May 2010
Guide : Dr. Umesh Bellur, Associate Prof., Department of Computer Science and Engineering, IIT Bombay

This was an independent research project with Prof. Umesh Bellur at Indian Institute of Technology(IIT), Mumbai. The problem was that of packing virtual machines in physical machines in a data center. The problem was mapped to an instance of the multi-dimensional vector bin packing problem which is NP-hard. Although the bin packing problem and the vector packing problem are well studied in a single dimension, good approximation algorithms are very rare, especially for the Vector Bin packing problem in multiple dimensions.We came up with a Linear Programming(LP) Approach which gives reasonable approximation ratios.
This is the wiki page for the project.

The first Report is available. View

Improved approximation bounds for Vector Bin Packing
Chetan S Rao, Jeffrey John Geevarghese, Karthik Rajan
Submitted http://arxiv.org/abs/1007.1345v1


Link Prediction in Social Networks
B.Tech Mini Project
Jan 2010- April 2010

Studied the Link prediction problem in Social Networks. Surveyed existing link prediction techniques from Data Mining, Graph Theory and Statistics. Read more
Download the final report here


f-Edge Cover Coloring of Nearly Bipartite Graphs
Summer Internship , Indian Institute of Science(IISc.), Bangalore
Jun 2009- Jul 2009
Guide : Dr. Sunil Chandran, Computer Science and Automation, IISc., Bangalore

Reviewed an unpublished manuscript On f-edge cover coloring of nearly Bipartite Graphs. A thorough literature survey of edge colorings and edge cover colorings on different types of graphs was done, with emphasis on Bipartite Graphs. Read more

 

Free Web Hosting