Department of Informatics
King's College London, Strand, London, WC2R 2LS, UK
Research Interests
Probabilistic Combinatorics:
Random graphs
Random boolean matrices
The probabilistic method
Random walks
Applications to Computer Science:
Probabilistic algorithm performance
Randomized algorithms
Markov enumeration algorithms
Discrete graph processes:
Models the world wide web etc: (Web Graphs)
Peer-to-peer models (P2P)
Algorithms on web graphs eg: Structural classification, Search (Crawling)
Fast and low cost algorithmic methods for large on-line networks
Estimation of network properties using random walks
Random walk based recommender systems
Practical aspects
Department of Informatics