Transformation from Graphs to Signals and Back

Network science has been a rapidly evolving field to study systems made of interactions between entities. Studying the structure of such networks reveals indeed the underlying mechanisms of these systems, and has been proven successful in many domains, such as sociology, biology, or geography. Recently, connections between network science and signal processing have emerged, making the use of a wide variety of tools possible to study networks. In this chapter, a focus is made on a methodology introduced to transform a graph into a collection of signals, using a multidimensional scaling technique: by projecting a distance matrix representing relations between vertices of the graph as points in a Euclidean space, it is possible to interpret coordinates of vertices in this space as signals, and take advantage of this dual representation to develop new tools for the study of networks. Deeper considerations of this methodology are proposed, by strengthening the connections between the obtained signals and the common graph structures. A robust inverse transformation method is next described, taking into account possible changes in the signals. Establishing a robust duality between graphs and signals opens up new perspectives, as classical signal processing tools, such as spectral analysis or filtering, are made available for the study of the structure of networks.

[1]  J. Kurths,et al.  Analytical framework for recurrence network analysis of time series. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[3]  N. Otsu.  A threshold selection method from gray level histograms , 1979 .

[4]  Michael Small,et al.  Time-series analysis of networks: exploring the structure with random walks. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Sunil K. Narang,et al.  Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data , 2011, IEEE Transactions on Signal Processing.

[6]  Yuichi Tanaka,et al.  Oversampled Graph Laplacian Matrix for Graph Filter Banks , 2014, IEEE Transactions on Signal Processing.

[7]  José M. F. Moura,et al.  Discrete Signal Processing on Graphs: Frequency Analysis , 2013, IEEE Transactions on Signal Processing.

[8]  Pierre Borgnat,et al.  Graph Wavelets for Multiscale Community Mining , 2014, IEEE Transactions on Signal Processing.

[9]  Gaël Varoquaux,et al.  Scikit-learn: Machine Learning in Python , 2011, J. Mach. Learn. Res..

[10]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[11]  Aric Hagberg,et al.  Exploring Network Structure, Dynamics, and Function using NetworkX , 2008, Proceedings of the Python in Science Conference.

[12]  Céline Robardet,et al.  Networks as signals, with an application to a bike sharing system , 2013, 2013 IEEE Global Conference on Signal and Information Processing.

[13]  Hao Jianxiu.  Cyclic bandwidth sum of graphs , 2001 .

[14]  Tiefeng Jiang,et al.  SPECTRAL DISTRIBUTIONS OF ADJACENCY AND LAPLACIAN MATRICES OF RANDOM GRAPHS , 2010, 1011.2608.

[15]  John D. Hunter,et al.  Matplotlib: A 2D Graphics Environment , 2007, Computing in Science & Engineering.

[16]  James R. Lee,et al.  Eigenvectors of random graphs: Nodal Domains , 2011, Random Struct. Algorithms.

[17]  J. Gower.  Properties of Euclidean and non-Euclidean distance matrices , 1985 .

[18]  Kazuyuki Aihara,et al.  Transformation from Complex Networks to Time Series Using Classical Multidimensional Scaling , 2009, ICANN.

[19]  Antonio Ortega,et al.  A probabilistic interpretation of sampling theory of graph signals , 2015, 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[20]  Santo Fortunato,et al.  Community detection in networks: A user guide , 2016, ArXiv.

[21]  M Small,et al.  Complex network from pseudoperiodic time series: topology versus dynamics. , 2006, Physical review letters.

[22]  Paulo Gonçalves,et al.  Semi-supervised learning for graph to signal mapping: A graph signal wiener filter interpretation , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[23]  Pierre Vandergheynst,et al.  A Framework for Multiscale Transforms on Graphs , 2013, arXiv.org.

[24]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[25]  J. Kurths,et al.  Complex network approach for recurrence analysis of time series , 2009, 0907.3368.

[26]  Céline Robardet,et al.  Relabelling vertices according to the network structure by minimizing the cyclic bandwidth sum , 2016, J. Complex Networks.

[27]  Lucas Lacasa,et al.  From time series to complex networks: The visibility graph , 2008, Proceedings of the National Academy of Sciences.

[28]  Minh N. Do,et al.  Downsampling of Signals on Graphs Via Maximum Spanning Trees , 2015, IEEE Transactions on Signal Processing.

[29]  Takaomi Shigehara,et al.  From networks to time series. , 2012, Physical review letters.

[30]  Mark E. J. Newman,et al.  Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  Pierre Vandergheynst,et al.  Wavelets on Graphs via Spectral Graph Theory , 2009, ArXiv.

[32]  Jelena Kovacevic,et al.  Discrete Signal Processing on Graphs: Sampling Theory , 2015, IEEE Transactions on Signal Processing.

[33]  Patrick Flandrin,et al.  Extraction of Temporal Network Structures From Graph-Based Signals , 2016, IEEE Trans. Signal Inf. Process. over Networks.

[34]  Yue Yang,et al.  Complex network-based time series analysis , 2008 .

[35]  Pascal Frossard,et al.  The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains , 2012, IEEE Signal Processing Magazine.

[36]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[37]  Pierre Vandergheynst,et al.  Vertex-Frequency Analysis on Graphs , 2013, ArXiv.

[38]  Santiago Segarra,et al.  Sampling of Graph Signals With Successive Local Aggregations , 2015, IEEE Transactions on Signal Processing.

[39]  R. Durrett.  Random Graph Dynamics: References , 2006 .

[40]  Pierre Borgnat,et al.  Subgraph-Based Filterbanks for Graph Signals , 2015, IEEE Transactions on Signal Processing.

[41]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[42]  Van H. Vu,et al.  Eigenvectors of random matrices: A survey , 2016, J. Comb. Theory, Ser. A.

[43]  Antonio Ortega,et al.  Towards a sampling theorem for signals on arbitrary graphs , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[44]  Konstantin Avrachenkov,et al.  Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.

[45]  L. Guzmán-Vargas,et al.  Earthquake magnitude time series: scaling behavior of visibility networks , 2013 .

[46]  Michael Small,et al.  Recurrence-based time series analysis by means of complex network methods , 2010, Int. J. Bifurc. Chaos.

[47]  Jürgen Kurths,et al.  Recurrence networks—a novel paradigm for nonlinear time series analysis , 2009, 0908.3447.

[48]  Xiao Fan Liu,et al.  Complex network structure of musical compositions: Algorithmic generation of appealing music , 2010 .

[49]  Tosio Kato.  Perturbation theory for linear operators , 1966 .

[50]  Kwok-Wing Chau,et al.  A new image thresholding method based on Gaussian mixture model , 2008, Appl. Math. Comput..

[51]  Jianbo Shi,et al.  A Random Walks View of Spectral Segmentation , 2001, AISTATS.

[52]  Sergio Barbarossa,et al.  On the degrees of freedom of signals on graphs , 2015, 2015 23rd European Signal Processing Conference (EUSIPCO).

[53]  L. Amaral,et al.  Duality between Time Series and Networks , 2011, PloS one.

[54]  Yutaka Shimada,et al.  Analysis of Chaotic Dynamics Using Measures of the Complex Network Theory , 2008, ICANN.

[55]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[56]  Robert M. Gray,et al.  Toeplitz and Circulant Matrices: A Review , 2005, Found. Trends Commun. Inf. Theory.

[57]  Lucas Lacasa,et al.  Visibility Algorithms: A Short Review , 2012 .

[58]  Gaël Varoquaux,et al.  The NumPy Array: A Structure for Efficient Numerical Computation , 2011, Computing in Science & Engineering.