Extracting Information from Large Graphs by Computing Similarities Between Node
Google TechTalks March 20, 2006 Vincent Blondel Vincent D. Blondel (http://www.inma.ucl.ac.be/~blondel) is currently spending a sabbatical year at MIT as a visiting professor and Fulbright scholar. He is professor of Applied Mathematics at the Université catholique de Louvain (Belgium) where he is also head of the Department of Mathematical Engineering. He obtained a MSc in Pure Mathematics from Imperial College (London, UK) and a PhD in Applied Mathematics from the Université catholique de Louvain. He has held positions at the Royal Institute of Technology (Stockholm, Sweden), at INRIA (Paris), at the Santa-Fe Institute. He was an invited professor at the Ecole Normale Supérieure in Lyon and at the University of Paris VII (1999 and 2000). ABSTRACT We introduce a concept of similarity between nodes in graphs and describe various applications of this concept, including web searching, automatic extraction of synonyms in a dictionary, and analysis of large cellular phone communication networks.