silvio_lattanzi.png

/2 From micro to macro: ego-network analysis and its applications

Detecting the clustering structure of real-world networks has emerged as an important primitive in a wide range of data analysis tasks such as community detection, event detection, spam detection, computational biology, link prediction and many others. As a result, the study of the topology of real world networks and of their clustering (or community) structure is central in modern network analysis. In particular, in recent years, several models have been introduced to capture the community structure of social networks and numerous empirical studies analyzed the community structures at a macroscopic and microscopic  levels. One of the main observations in this line of work is the lack of a clear macroscopic community structure in real world networks. In sharp contrast with these findings, it has been observed that while the community detection problem is hard at a macroscopic level, it becomes simple at a microscopic level. This is is especially true when we restrict our attention to local structures know as ego-nets (a.k.a. ego-networks) which consist of the subgraph induced over the neighborhood of a single node in the graph. Intuitively, this happens because, even if a node is part of many communities, if we restrict our attention to a node and one of her neighbors, there is only one or a limited number of communities in which the two nodes interact, which present a clearer structure at the level of the neighborhood. In this talk we will first present this phenomena then we will discuss how to analyze ego-networks at scale and finally describe few applications of ego-network analysis.

Silvio Lattanzi
Google Zurich, Switzerland

He is a Research Scientist at Google Research Europe since April 2017. Before he was in the NY Algorithm group at Google New York from January 2011 to March 2017. He received my PhD from Sapienza University of Rome under the supervision of Alessandro Panconesi. During my PhD he interned twice at Google and once at Yahoo! Research.
My research interests are in the areas of algorithms, machine learning and information retrieval.