BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Mining large social networks 
DTSTART:20100608T141500
DTSTAMP:20260407T043421Z
UID:7a4b1d89c2c80367e77825ba45a635c50f43696511cc29f3845293d1
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Vincent Blondel\, Université Catholique de Louvain and 
 MIT\nI will describe recent methods that allows the efficient extraction o
 f information in very large networks. I will first show how a simple gener
 alization of PageRank can be used to compute similarities between graph ve
 rtices. I will then describe an algorithm for detecting communities in ver
 y large networks and will show the surprising results obtained with this a
 lgorithm on a country-wide mobile phone database of more than one billion 
 phone calls.  Prof. Blondel's homepage
LOCATION:BC 01 https://plan.epfl.ch/?room==BC%2001
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR