Entropy metrics for graph signals

John Stewart Fabila Carrasco*, Javier Escudero, Chao Tan

*Corresponding author for this work

Research output: Contribution to conferenceAbstractpeer-review

Abstract / Description of output

Entropy metrics (for example, permutation entropy) are nonlinear measures of irregularity in time series (1-dimensional data). These entropy metrics can be generalised to data on periodic structures (such as a grid or lattice pattern) using its symmetry, thus enabling their application to images. However, these metrics have not been developed for signals settled on irregular domains, defined by a graph. In this work, we define for the first time an entropy metric to analyse signals measured over irregular graphs by generalising permutation entropy, a well established nonlinear metric based on the comparison of neighbouring values within patterns in a time series, to data on general graphs. Our algorithm is based on the idea of comparing signal values on neighbouring nodes (using the adjacency matrix). We show that this generalisation preserves the properties of classical permutation for time series, and it can be applied to any structure with synthetic and real graphs.
Original languageEnglish
Publication statusPublished - 30 Nov 2021
EventThe 10th International Conference on Complex Networks and their Applications - Madrid, Spain
Duration: 30 Nov 20212 Dec 2021
Conference number: 10


ConferenceThe 10th International Conference on Complex Networks and their Applications
Abbreviated titleComplex Networks 2021
Internet address


Dive into the research topics of 'Entropy metrics for graph signals'. Together they form a unique fingerprint.

Cite this