Date
Fri, 13 Apr 2012
Time
15:00 - 16:00
Location
DH 1st floor SR
Speaker
SPECIAL EVENT OCIAM joint with The Oxford Internet Institute Jure Leskovec

TALK 1 -- social media for OII:

TITLE: Computational Perspectives on the Structure and Information

Flows in On-Line Networks

ABSTRACT:

With an increasing amount of social interaction taking place in on-line settings, we are accumulating massive amounts of data about phenomena that were once essentially invisible to us: the collective behavior and social interactions of hundreds of millions of people Analyzing this massive data computationally offers enormous potential both to address long-standing scientific questions, and also to harness and inform the design of future social computing applications: What are emerging ideas and trends? How is information being created, how it flows and mutates as it is passed from a node to node like an epidemic?

We discuss how computational perspective can be applied to questions involving structure of online networks and the dynamics of information flows through such networks, including analysis of massive data as well as mathematical models that seek to abstract some of the underlying phenomena.

TALK 2 -- Community detection:

TITLE: Networks, Communities and the Ground-Truth

ABSTRACT: Nodes in complex networks organize into communities of nodes that share a common property, role or function, such as social communities, functionally related proteins, or topically related webpages. Identifying such communities is crucial to the understanding of the structural and functional roles of networks.Current work on overlapping community detection (often implicitly) assumes that community overlaps are less densely connected than non-overlapping parts of communities. This is unnatural as it means that the more communities nodes share, the less likely it is they are linked. We validate this assumption on a diverse set of large networks and find an increasing relationship between the number of shared communities of a pair of nodes and the probability of them being connected by an edge, which means that parts of the network where communities overlap tend to be more densely connected than the non-overlapping parts of communities. Existing community detection methods fail to detect communities with such overlaps. We propose a model-based community detection method that builds on bipartite node-community affiliation networks. Our method successfully detects overlapping, non-overlapping and hierarchically nested communities. We accurately identify relevant communities in networks ranging from biological protein-protein interaction networks to social, collaboration and information networks. Our results show that while networks organize into overlapping communities, globally networks also exhibit a nested core-periphery structure, which arises as a consequence of overlapping parts of communities being more densely connected.

Please contact us with feedback and comments about this page. Last updated on 04 Apr 2022 14:57.