Dispersion entropy: A Measure of Irregularity for Graph Signals
From MaRDI portal
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Dynamical systems involving maps of trees and graphs (37E25) General topics of discrete mathematics in relation to computer science (68R01) Graph theory (including graph drawing) in computer science (68R10)
Abstract: We introduce a novel method, called Dispersion Entropy for Graph Signals, , as a powerful tool for analysing the irregularity of signals defined on graphs. We demonstrate the effectiveness of in detecting changes in the dynamics of signals defined on synthetic and real-world graphs, by defining mixed processing on random geometric graphs or those exhibiting with small-world properties. Remarkably, generalises the classical dispersion entropy for univariate time series, enabling its application in diverse domains such as image processing, time series analysis, and network analysis, as well as in establishing theoretical relationships (i.e., graph centrality measures, spectrum). Our results indicate that effectively captures the irregularity of graph signals across various network configurations, successfully differentiating between distinct levels of randomness and connectivity. Consequently, provides a comprehensive framework for entropy analysis of various data types, enabling new applications of dispersion entropy not previously feasible, and revealing relationships between graph signals and its graph topology.
This page was built for publication: Dispersion entropy: A Measure of Irregularity for Graph Signals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6431607)
