Dynamic networks naturally appear in a multitude of applications from different fields. Analyzing and exploring dynamic networks in order to understand and detect patterns and phenomena is challenging, fostering the development of new methodologies, particularly in the field of visual analytics. In this work, we propose a novel visual analytics methodology for dynamic networks, which relies on the spectral graph wavelet theory. We enable the automatic analysis of a signal defined on the nodes of the network, making viable the robust detection of network properties. Specifically, we use a fast approximation of a graph wavelet transform to derive a set of wavelet coefficients, which are then used to identify activity patterns on large networks, including their temporal recurrence. The coefficients naturally encode the spatial and temporal variations of the signal, leading to an efficient and meaningful representation. This methodology allows for the exploration of the structural evolution of the network and their patterns overtime. The effectiveness of our approach is demonstrated using usage scenarios and comparisons involving real dynamic networks.
1 September 2017 in Computing in Science & Engineering
The conventional wavelet transform is widely used in image and signal processing, where a signal is decomposed into a combination of known signals. By analyzing the individual contributions, the behavior of the original signal can be inferred. In this article, the authors present an introductory overview of the extension of this theory into graphs domains. They review the graph Fourier transform and graph wavelet transforms that are based on dictionaries of graph spectral filters, namely, spectral graph wavelet transforms. Then, the main features of the graph wavelet transforms are presented using real and synthetic data.