Research

My research interests include stochastic graph theory and network modeling, applications of probabilistic methods to combinatorial problems, extremal combinatorics, graph coloring, and random matrices. A list of publications can be found on my CV.

Among other things, I am currently researching various properties of the Random Kronecker Graph model (see, for example, Kronecker Graphs: An approach to modeling networks by J. Leskovec, D. Chakrabarti, J. Kleinberg, C. Faloutsos, and Z. Ghahramani). In particular, I am exploring spectral properties of the model, as well as thresholds for various graph properties. I am also interested in generalizations of this model, such as the Multiplicative Attribute Graph.

In addition, I am exploring applications of matrix concentration inequalities to random graphs (see, for example, On the Spectra of General Random Graphs by F. Chung and M. Radcliffe). Concentration inequalities play an important role in the study of random variables, and the use of such inequalities to study properties of random matrices, and in particular spectral structure, seems to be a promising tool.

Last updated: 16 October 2011