- Formalizing heuristics and algorithms that has been empirically shown to work well in practice.

- Scalable parametric and nonparametric models for dynamic networks.

- Using the nonparametric Bootstrap for estimating confidence.

- Fast and memory efficient algorithms for random walk based proximity search in large graphs.