Sample entropy for graph signals: An approach to nonlinear dynamic analysis of data on networks
Mei-San Maggie Lei, John Stewart Fabila Carrasco, Javier Escudero

TL;DR
This paper introduces SampEnG, a novel measure extending sample entropy to graph signals, enabling nonlinear dynamic analysis of complex network data with applications in traffic and sensor systems.
Contribution
It presents the first effective definition of sample entropy for graph signals, generalizing classical methods to network-structured data.
Findings
SampEnG recovers known nonlinear features in synthetic and real-world datasets.
SampEnG detects phase transitions in traffic flow, distinguishing free-flow and congestion states.
The method offers complementary insights to Shannon-entropy based approaches.
Abstract
The recent extension of permutation entropy and its derivatives to graph signals has opened up new horizons for the analysis of complex, high-dimensional systems evolving on networks. However, these measures are all fundamentally rooted in Shannon entropy and symbol dynamics. In this paper, we explore, for the first time, whether and how a popular conditional-entropy based measure --Sample Entropy (SampEn)-- can be effectively defined for graph signals and used to characterise the nonlinear dynamics of data on complex networks. We introduce sample entropy for graph signals (SampEnG), a unified framework that generalises classical sample entropy from uni- and bi-dimensional signals, including time series and images, by building on topology-aware embeddings using multi-hop neighbourhoods and computing finite scale of correlation sums in the continuous embedding state space. Experiments…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
