Renaud Lambiotte 2010-03-24 16:00:00 (Avviso di seminario/evento)

Avviso di seminario/evento

Date: March 24, 2010 (Wednesday) - 16:00

Location: Dipartimento di Fisica e Astronomia, Via S. Sofia, 64, Aula F

Dr. Renaud Lambiotte
Institute for Mathematical Sciences, Imperial College London, UK

Multi-scale dynamics and hierarchical structure in complex networks


Abstract/Calendar:
The complex structure of many social, information and biological networks
is underpinned by communities at different scales. These topological
modules are often indicative of underlying features and functionalities,
such as tightly-knit groups of metabolites or species in biological
networks. The presence of well-defined communities also has an effect on
the dynamics taking place on a network. A variety of methods and measures
have been proposed to uncover these modules, most notably modularity and
spectral partitioning. However, these approaches are based on structural,
static properties of the network. Here we introduce a definition for the
quality of the partition of a network that is based on the statistical
properties of a dynamical process taking place on the graph. This measure,
denoted the stability of the partition, has an intrinsic dependence on the
time-scale of the process, which can be used to uncover community
structures at different resolutions. The stability extends and unifies
standard community detection algorithms. In particular, both modularity
and spectral partitioning are shown to have a dynamical interpretation in
the case of undirected networks and can be seen as limiting cases of the
stability. Similarly, several multi-resolution methods correspond to
linearisations of our measure at short times. In the case of directed
networks, however, stability differs from modularity by its non-local
nature as it is based on the persistence of probabilistic flows in
modules. We apply our method to find multi-scale partitions for different
examples and show that the stability can be computed efficiently through
the use of extended versions of current algorithms that can deal with
large networks.