色散熵:一种图信号不规则性的度量
Dispersion entropy: A Measure of Irregularity for Graph Signals
AI总结:
提出图信号色散熵($DE_G$)方法以分析图信号的不规则性,该方法推广了经典色散熵,能有效捕捉不同网络配置下的信号不规则性并揭示图信号与拓扑间的关系。
摘要:
我们引入了一种名为图信号色散熵($DE_G$)的新方法,作为分析定义在图上的信号不规则性的强大工具。我们通过在随机几何图或具有小世界特性的图上定义混合处理,展示了 $DE_G$ 在检测合成图和真实世界图上信号动态变化方面的有效性。值得注意的是,$DE_G$ 推广了单变量时间序列的经典色散熵,使其能够应用于图像处理、时间序列分析和网络分析等多个领域,以及建立理论关系(即图中心性度量、谱)。我们的结果表明,$DE_G$ 有效捕捉了各种网络配置下图信号的不规则性,成功区分了不同级别的随机性和连通性。因此,$DE_G$ 为各种数据类型的熵分析提供了一个全面的框架,实现了色散熵以前不可行的新应用,并揭示了图信号与其图拓扑之间的关系。
英文摘要:
We introduce a novel method, called Dispersion Entropy for Graph Signals, $DE_G$, as a powerful tool for analysing the irregularity of signals defined on graphs. We demonstrate the effectiveness of $DE_G$ 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, $DE_G$ 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 $DE_G$ effectively captures the irregularity of graph signals across various network configurations, successfully differentiating between distinct levels of randomness and connectivity. Consequently, $DE_G$ 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。