Aller au contenu. | Aller à la navigation

Outils personnels

Navigation

UMR 5672

logo de l'ENS de Lyon
logo du CNRS
Vous êtes ici : Accueil / Équipes / SIgnaux, SYstèmes & PHysiquE / Thèmes de recherche / Signaux sur graphes et réseaux complexes

Signaux sur graphes et réseaux complexes

Data appear often with a mixture or relational properties –coded by graphs or networks–, and attributes —naturally dealt as signals (possibly multivariate signals). An activity of the group is to study signal an ddata processing for these types of data, both for graph signals (when a signal is indexed by a graph) and for complex networks where the signal of interest is the network itself. In both cases, the group has a specific interest in networks which are dynamic, or for which a multiscale approach is fruitful.

Graph signals and complex networks

Graph signal processing and complex networks.
We develop methods and applications of Graph Signal Processing, with a particular focus on also applying these to study complex networks. We have developed new filterbanks for graph signals that are built on connected subgraphs. Also, using spectral graph wavelets we studied communities in networks; that allows us to revisite multi-scale methods to find communities in network. This method is alaso a wavelet-based clustering, and we have shown also how to use it on large networks with wavelet transform of random vectors as features and for unsupervised classification.

Complex network dynamics. 
To study dynamical properties of networks, we have proposed new descriptors and a model for the dynamics of mobility networks, before adopting a signal processing approach. Leveraging on the transform of graphs in signals, we propose “time-frequency”-like analyses of dynamic networks. This has been applied to the network of bike sharing systems. Relying on nonnegative matrix factorization, features of temporal networks are exhibited along with the periods they are active, opening a new approach to the study of dynamical networks.

Time-series and graph signals.

For sensor networks, cycles (e.g., daily, yearly) and trends are important. Using nonstationary tools, we show how to compute cycles, residuals and correlations for Live E! data (environmental sensors in Japan) to obtain signals which are then processed on a graph of simularity between data. This can be used to group series together or detect anomalies. We have used also EMD to detect anomalies in sensor network of energy consumption in building. 

Contacts

Pierre Borgnat, Patrick Flandrin, Pablo Jensen

Mots-clés associés :