Haikun Shang, Zixuan Zhao, Jiawen Li, Zhiming Wang
Partial discharge (PD) fault diagnosis is of great importance for ensuring the safe and stable operation of power transformers. To address the issues of low accuracy in traditional PD fault diagnostic methods, this paper proposes a novel method for the power transformer PD fault diagnosis. It incorporates the approximate entropy (ApEn) of symplectic geometry mode decomposition (SGMD) into the optimized bidirectional long short-term memory (BILSTM) neural network. This method extracts dominant PD features employing SGMD and ApEn. Meanwhile, it improves the diagnostic accuracy with the optimized BILSTM by introducing the golden jackal optimization (GJO). Simulation studies evaluate the performance of FFT, EMD, VMD, and SGMD. The results show that SGMD–ApEn outperforms other methods in extracting dominant PD features. Experimental results verify the effectiveness and superiority of the proposed method by comparing different traditional methods. The proposed method improves PD fault recognition accuracy and provides a diagnostic rate of 98.6%, with lower noise sensitivity.
{"title":"Partial Discharge Fault Diagnosis in Power Transformers Based on SGMD Approximate Entropy and Optimized BILSTM","authors":"Haikun Shang, Zixuan Zhao, Jiawen Li, Zhiming Wang","doi":"10.3390/e26070551","DOIUrl":"https://doi.org/10.3390/e26070551","url":null,"abstract":"Partial discharge (PD) fault diagnosis is of great importance for ensuring the safe and stable operation of power transformers. To address the issues of low accuracy in traditional PD fault diagnostic methods, this paper proposes a novel method for the power transformer PD fault diagnosis. It incorporates the approximate entropy (ApEn) of symplectic geometry mode decomposition (SGMD) into the optimized bidirectional long short-term memory (BILSTM) neural network. This method extracts dominant PD features employing SGMD and ApEn. Meanwhile, it improves the diagnostic accuracy with the optimized BILSTM by introducing the golden jackal optimization (GJO). Simulation studies evaluate the performance of FFT, EMD, VMD, and SGMD. The results show that SGMD–ApEn outperforms other methods in extracting dominant PD features. Experimental results verify the effectiveness and superiority of the proposed method by comparing different traditional methods. The proposed method improves PD fault recognition accuracy and provides a diagnostic rate of 98.6%, with lower noise sensitivity.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141522035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Qiliang Du, Mingde Sheng, Lubin Yu, Zhenwei Zhou, Lianfang Tian, Shilie He
Since the reliability of the avionics module is crucial for aircraft safety, the fault diagnosis and health management of this module are particularly significant. While deep learning-based prognostics and health management (PHM) methods exhibit highly accurate fault diagnosis, they have disadvantages such as inefficient data feature extraction and insufficient generalization capability, as well as a lack of avionics module fault data. Consequently, this study first employs fault injection to simulate various fault types of the avionics module and performs data enhancement to construct the P2020 communications processor fault dataset. Subsequently, a multichannel fault diagnosis method, the Hybrid Attention Adaptive Multi-scale Temporal Convolution Network (HAAMTCN) for the integrated functional circuit module of the avionics module, is proposed, which adaptively constructs the optimal size of the convolutional kernel to efficiently extract features of avionics module fault signals with large information entropy. Further, the combined use of the Interaction Channel Attention (ICA) module and the Hierarchical Block Temporal Attention (HBTA) module results in the HAAMTCN to pay more attention to the critical information in the channel dimension and time step dimension. The experimental results show that the HAAMTCN achieves an accuracy of 99.64% in the avionics module fault classification task which proves our method achieves better performance in comparison with existing methods.
{"title":"Avionics Module Fault Diagnosis Algorithm Based on Hybrid Attention Adaptive Multi-Scale Temporal Convolution Network","authors":"Qiliang Du, Mingde Sheng, Lubin Yu, Zhenwei Zhou, Lianfang Tian, Shilie He","doi":"10.3390/e26070550","DOIUrl":"https://doi.org/10.3390/e26070550","url":null,"abstract":"Since the reliability of the avionics module is crucial for aircraft safety, the fault diagnosis and health management of this module are particularly significant. While deep learning-based prognostics and health management (PHM) methods exhibit highly accurate fault diagnosis, they have disadvantages such as inefficient data feature extraction and insufficient generalization capability, as well as a lack of avionics module fault data. Consequently, this study first employs fault injection to simulate various fault types of the avionics module and performs data enhancement to construct the P2020 communications processor fault dataset. Subsequently, a multichannel fault diagnosis method, the Hybrid Attention Adaptive Multi-scale Temporal Convolution Network (HAAMTCN) for the integrated functional circuit module of the avionics module, is proposed, which adaptively constructs the optimal size of the convolutional kernel to efficiently extract features of avionics module fault signals with large information entropy. Further, the combined use of the Interaction Channel Attention (ICA) module and the Hierarchical Block Temporal Attention (HBTA) module results in the HAAMTCN to pay more attention to the critical information in the channel dimension and time step dimension. The experimental results show that the HAAMTCN achieves an accuracy of 99.64% in the avionics module fault classification task which proves our method achieves better performance in comparison with existing methods.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141531640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yiran Zhao, Xiangyun Gao, Hongyu Wei, Xiaotian Sun, Sufang An
This study aims to employ a causal network model based on transfer entropy for the early warning of systemic risk in commodity markets. We analyzed the dynamic causal relationships of prices for 25 commodities related to China (including futures and spot prices of energy, industrial metals, precious metals, and agricultural products), validating the effect of the causal network structure among commodity markets on systemic risk. Our research results identified commodities and categories playing significant roles, revealing that industry and precious metal markets possess stronger market information transmission capabilities, with price fluctuations impacting a broader range and with greater force on other commodity markets. Under the influence of different types of crisis events, such as economic crises and the Russia–Ukraine conflict, the causal network structure among commodity markets exhibited distinct characteristics. The results of the effect of external shocks to the causal network structure of commodity markets on the entropy of systemic risk suggest that network structure indicators can warn of systemic risk. This article can assist investors and policymakers in managing systemic risk to avoid unexpected losses.
{"title":"Early Warning of Systemic Risk in Commodity Markets Based on Transfer Entropy Networks: Evidence from China","authors":"Yiran Zhao, Xiangyun Gao, Hongyu Wei, Xiaotian Sun, Sufang An","doi":"10.3390/e26070549","DOIUrl":"https://doi.org/10.3390/e26070549","url":null,"abstract":"This study aims to employ a causal network model based on transfer entropy for the early warning of systemic risk in commodity markets. We analyzed the dynamic causal relationships of prices for 25 commodities related to China (including futures and spot prices of energy, industrial metals, precious metals, and agricultural products), validating the effect of the causal network structure among commodity markets on systemic risk. Our research results identified commodities and categories playing significant roles, revealing that industry and precious metal markets possess stronger market information transmission capabilities, with price fluctuations impacting a broader range and with greater force on other commodity markets. Under the influence of different types of crisis events, such as economic crises and the Russia–Ukraine conflict, the causal network structure among commodity markets exhibited distinct characteristics. The results of the effect of external shocks to the causal network structure of commodity markets on the entropy of systemic risk suggest that network structure indicators can warn of systemic risk. This article can assist investors and policymakers in managing systemic risk to avoid unexpected losses.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141522032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
What guarantees the “peaceful coexistence” of quantum nonlocality and special relativity? The tension arises because entanglement leads to locally inexplicable correlations between distant events that have no absolute temporal order in relativistic spacetime. This paper identifies a relativistic consistency condition that is weaker than Bell locality but stronger than the no-signaling condition meant to exclude superluminal communication. While justifications for the no-signaling condition often rely on anthropocentric arguments, relativistic consistency is simply the requirement that joint outcome distributions for spacelike separated measurements (or measurement-like processes) must be independent of their temporal order. This is necessary to obtain consistent statistical predictions across different Lorentz frames. We first consider ideal quantum measurements, derive the relevant consistency condition on the level of probability distributions, and show that it implies no-signaling (but not vice versa). We then extend the results to general quantum operations and derive corresponding operator conditions. This will allow us to clarify the relationships between relativistic consistency, no-signaling, and local commutativity. We argue that relativistic consistency is the basic physical principle that ensures the compatibility of quantum statistics and relativistic spacetime structure, while no-signaling and local commutativity can be justified on this basis.
{"title":"Relativistic Consistency of Nonlocal Quantum Correlations","authors":"Christian Beck, Dustin Lazarovici","doi":"10.3390/e26070548","DOIUrl":"https://doi.org/10.3390/e26070548","url":null,"abstract":"What guarantees the “peaceful coexistence” of quantum nonlocality and special relativity? The tension arises because entanglement leads to locally inexplicable correlations between distant events that have no absolute temporal order in relativistic spacetime. This paper identifies a relativistic consistency condition that is weaker than Bell locality but stronger than the no-signaling condition meant to exclude superluminal communication. While justifications for the no-signaling condition often rely on anthropocentric arguments, relativistic consistency is simply the requirement that joint outcome distributions for spacelike separated measurements (or measurement-like processes) must be independent of their temporal order. This is necessary to obtain consistent statistical predictions across different Lorentz frames. We first consider ideal quantum measurements, derive the relevant consistency condition on the level of probability distributions, and show that it implies no-signaling (but not vice versa). We then extend the results to general quantum operations and derive corresponding operator conditions. This will allow us to clarify the relationships between relativistic consistency, no-signaling, and local commutativity. We argue that relativistic consistency is the basic physical principle that ensures the compatibility of quantum statistics and relativistic spacetime structure, while no-signaling and local commutativity can be justified on this basis.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141531639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wireless communication systems and networks are rapidly evolving to meet the increasing demands for higher data rates, better reliability, and connectivity anywhere, anytime [...]
{"title":"Information Theory in Emerging Wireless Communication Systems and Networks","authors":"Erdem Koyuncu","doi":"10.3390/e26070543","DOIUrl":"https://doi.org/10.3390/e26070543","url":null,"abstract":"Wireless communication systems and networks are rapidly evolving to meet the increasing demands for higher data rates, better reliability, and connectivity anywhere, anytime [...]","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141522038","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The partial information decomposition (PID) aims to quantify the amount of redundant information that a set of sources provides about a target. Here, we show that this goal can be formulated as a type of information bottleneck (IB) problem, termed the “redundancy bottleneck” (RB). The RB formalizes a tradeoff between prediction and compression: it extracts information from the sources that best predict the target, without revealing which source provided the information. It can be understood as a generalization of “Blackwell redundancy”, which we previously proposed as a principled measure of PID redundancy. The “RB curve” quantifies the prediction–compression tradeoff at multiple scales. This curve can also be quantified for individual sources, allowing subsets of redundant sources to be identified without combinatorial optimization. We provide an efficient iterative algorithm for computing the RB curve.
{"title":"Partial Information Decomposition: Redundancy as Information Bottleneck","authors":"Artemy Kolchinsky","doi":"10.3390/e26070546","DOIUrl":"https://doi.org/10.3390/e26070546","url":null,"abstract":"The partial information decomposition (PID) aims to quantify the amount of redundant information that a set of sources provides about a target. Here, we show that this goal can be formulated as a type of information bottleneck (IB) problem, termed the “redundancy bottleneck” (RB). The RB formalizes a tradeoff between prediction and compression: it extracts information from the sources that best predict the target, without revealing which source provided the information. It can be understood as a generalization of “Blackwell redundancy”, which we previously proposed as a principled measure of PID redundancy. The “RB curve” quantifies the prediction–compression tradeoff at multiple scales. This curve can also be quantified for individual sources, allowing subsets of redundant sources to be identified without combinatorial optimization. We provide an efficient iterative algorithm for computing the RB curve.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141522039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
As one of the most widely used spread spectrum techniques, the frequency-hopping spread spectrum (FHSS) has been widely adopted in both civilian and military secure communications. In this technique, the carrier frequency of the signal hops pseudo-randomly over a large range, compared to the baseband. To capture an FHSS signal, conventional non-cooperative receivers without knowledge of the carrier have to operate at a high sampling rate covering the entire FHSS hopping range, according to the Nyquist sampling theorem. In this paper, we propose an adaptive compressed method for joint carrier and direction of arrival (DOA) estimations of FHSS signals, enabling subsequent non-cooperative processing. The compressed measurement kernels (i.e., non-zero entries in the sensing matrix) have been adaptively designed based on the posterior knowledge of the signal and task-specific information optimization. Moreover, a deep neural network has been designed to ensure the efficiency of the measurement kernel design process. Finally, the signal carrier and DOA are estimated based on the measurement data. Through simulations, the performance of the adaptively designed measurement kernels is proved to be improved over the random measurement kernels. In addition, the proposed method is shown to outperform the compressed methods in the literature.
{"title":"Adaptive Joint Carrier and DOA Estimations of FHSS Signals Based on Knowledge-Enhanced Compressed Measurements and Deep Learning","authors":"Yinghai Jiang, Feng Liu","doi":"10.3390/e26070544","DOIUrl":"https://doi.org/10.3390/e26070544","url":null,"abstract":"As one of the most widely used spread spectrum techniques, the frequency-hopping spread spectrum (FHSS) has been widely adopted in both civilian and military secure communications. In this technique, the carrier frequency of the signal hops pseudo-randomly over a large range, compared to the baseband. To capture an FHSS signal, conventional non-cooperative receivers without knowledge of the carrier have to operate at a high sampling rate covering the entire FHSS hopping range, according to the Nyquist sampling theorem. In this paper, we propose an adaptive compressed method for joint carrier and direction of arrival (DOA) estimations of FHSS signals, enabling subsequent non-cooperative processing. The compressed measurement kernels (i.e., non-zero entries in the sensing matrix) have been adaptively designed based on the posterior knowledge of the signal and task-specific information optimization. Moreover, a deep neural network has been designed to ensure the efficiency of the measurement kernel design process. Finally, the signal carrier and DOA are estimated based on the measurement data. Through simulations, the performance of the adaptively designed measurement kernels is proved to be improved over the random measurement kernels. In addition, the proposed method is shown to outperform the compressed methods in the literature.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141522036","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
David Sutherland Blair, Robyn L. Miller, Vince D. Calhoun
Over the past decade and a half, dynamic functional imaging has revealed low-dimensional brain connectivity measures, identified potential common human spatial connectivity states, tracked the transition patterns of these states, and demonstrated meaningful transition alterations in disorders and over the course of development. Recently, researchers have begun to analyze these data from the perspective of dynamic systems and information theory in the hopes of understanding how these dynamics support less easily quantified processes, such as information processing, cortical hierarchy, and consciousness. Little attention has been paid to the effects of psychiatric disease on these measures, however. We begin to rectify this by examining the complexity of subject trajectories in state space through the lens of information theory. Specifically, we identify a basis for the dynamic functional connectivity state space and track subject trajectories through this space over the course of the scan. The dynamic complexity of these trajectories is assessed along each dimension of the proposed basis space. Using these estimates, we demonstrate that schizophrenia patients display substantially simpler trajectories than demographically matched healthy controls and that this drop in complexity concentrates along specific dimensions. We also demonstrate that entropy generation in at least one of these dimensions is linked to cognitive performance. Overall, the results suggest great value in applying dynamic systems theory to problems of neuroimaging and reveal a substantial drop in the complexity of schizophrenia patients’ brain function.
{"title":"A Dynamic Entropy Approach Reveals Reduced Functional Network Connectivity Trajectory Complexity in Schizophrenia","authors":"David Sutherland Blair, Robyn L. Miller, Vince D. Calhoun","doi":"10.3390/e26070545","DOIUrl":"https://doi.org/10.3390/e26070545","url":null,"abstract":"Over the past decade and a half, dynamic functional imaging has revealed low-dimensional brain connectivity measures, identified potential common human spatial connectivity states, tracked the transition patterns of these states, and demonstrated meaningful transition alterations in disorders and over the course of development. Recently, researchers have begun to analyze these data from the perspective of dynamic systems and information theory in the hopes of understanding how these dynamics support less easily quantified processes, such as information processing, cortical hierarchy, and consciousness. Little attention has been paid to the effects of psychiatric disease on these measures, however. We begin to rectify this by examining the complexity of subject trajectories in state space through the lens of information theory. Specifically, we identify a basis for the dynamic functional connectivity state space and track subject trajectories through this space over the course of the scan. The dynamic complexity of these trajectories is assessed along each dimension of the proposed basis space. Using these estimates, we demonstrate that schizophrenia patients display substantially simpler trajectories than demographically matched healthy controls and that this drop in complexity concentrates along specific dimensions. We also demonstrate that entropy generation in at least one of these dimensions is linked to cognitive performance. Overall, the results suggest great value in applying dynamic systems theory to problems of neuroimaging and reveal a substantial drop in the complexity of schizophrenia patients’ brain function.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141531641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
There is much interest in the topic of partial information decomposition, both in developing new algorithms and in developing applications. An algorithm, based on standard results from information geometry, was recently proposed by Niu and Quinn (2019). They considered the case of three scalar random variables from an exponential family, including both discrete distributions and a trivariate Gaussian distribution. The purpose of this article is to extend their work to the general case of multivariate Gaussian systems having vector inputs and a vector output. By making use of standard results from information geometry, explicit expressions are derived for the components of the partial information decomposition for this system. These expressions depend on a real-valued parameter which is determined by performing a simple constrained convex optimisation. Furthermore, it is proved that the theoretical properties of non-negativity, self-redundancy, symmetry and monotonicity, which were proposed by Williams and Beer (2010), are valid for the decomposition Iig derived herein. Application of these results to real and simulated data show that the Iig algorithm does produce the results expected when clear expectations are available, although in some scenarios, it can overestimate the level of the synergy and shared information components of the decomposition, and correspondingly underestimate the levels of unique information. Comparisons of the Iig and Idep (Kay and Ince, 2018) methods show that they can both produce very similar results, but interesting differences are provided. The same may be said about comparisons between the Iig and Immi (Barrett, 2015) methods.
{"title":"A Partial Information Decomposition for Multivariate Gaussian Systems Based on Information Geometry","authors":"Jim W. Kay","doi":"10.3390/e26070542","DOIUrl":"https://doi.org/10.3390/e26070542","url":null,"abstract":"There is much interest in the topic of partial information decomposition, both in developing new algorithms and in developing applications. An algorithm, based on standard results from information geometry, was recently proposed by Niu and Quinn (2019). They considered the case of three scalar random variables from an exponential family, including both discrete distributions and a trivariate Gaussian distribution. The purpose of this article is to extend their work to the general case of multivariate Gaussian systems having vector inputs and a vector output. By making use of standard results from information geometry, explicit expressions are derived for the components of the partial information decomposition for this system. These expressions depend on a real-valued parameter which is determined by performing a simple constrained convex optimisation. Furthermore, it is proved that the theoretical properties of non-negativity, self-redundancy, symmetry and monotonicity, which were proposed by Williams and Beer (2010), are valid for the decomposition Iig derived herein. Application of these results to real and simulated data show that the Iig algorithm does produce the results expected when clear expectations are available, although in some scenarios, it can overestimate the level of the synergy and shared information components of the decomposition, and correspondingly underestimate the levels of unique information. Comparisons of the Iig and Idep (Kay and Ince, 2018) methods show that they can both produce very similar results, but interesting differences are provided. The same may be said about comparisons between the Iig and Immi (Barrett, 2015) methods.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141508675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Boxin Sun, Jinxian Deng, Norman Scheel, David C. Zhu, Jian Ren, Rong Zhang, Tongtong Li
Rooted in dynamic systems theory, convergent cross mapping (CCM) has attracted increased attention recently due to its capability in detecting linear and nonlinear causal coupling in both random and deterministic settings. One limitation with CCM is that it uses both past and future values to predict the current value, which is inconsistent with the widely accepted definition of causality, where it is assumed that the future values of one process cannot influence the past of another. To overcome this obstacle, in our previous research, we introduced the concept of causalized convergent cross mapping (cCCM), where future values are no longer used to predict the current value. In this paper, we focus on the implementation of cCCM in causality analysis. More specifically, we demonstrate the effectiveness of cCCM in identifying both linear and nonlinear causal coupling in various settings through a large number of examples, including Gaussian random variables with additive noise, sinusoidal waveforms, autoregressive models, stochastic processes with a dominant spectral component embedded in noise, deterministic chaotic maps, and systems with memory, as well as experimental fMRI data. In particular, we analyze the impact of shadow manifold construction on the performance of cCCM and provide detailed guidelines on how to configure the key parameters of cCCM in different applications. Overall, our analysis indicates that cCCM is a promising and easy-to-implement tool for causality analysis in a wide spectrum of applications.
{"title":"Causalized Convergent Cross Mapping and Its Implementation in Causality Analysis","authors":"Boxin Sun, Jinxian Deng, Norman Scheel, David C. Zhu, Jian Ren, Rong Zhang, Tongtong Li","doi":"10.3390/e26070539","DOIUrl":"https://doi.org/10.3390/e26070539","url":null,"abstract":"Rooted in dynamic systems theory, convergent cross mapping (CCM) has attracted increased attention recently due to its capability in detecting linear and nonlinear causal coupling in both random and deterministic settings. One limitation with CCM is that it uses both past and future values to predict the current value, which is inconsistent with the widely accepted definition of causality, where it is assumed that the future values of one process cannot influence the past of another. To overcome this obstacle, in our previous research, we introduced the concept of causalized convergent cross mapping (cCCM), where future values are no longer used to predict the current value. In this paper, we focus on the implementation of cCCM in causality analysis. More specifically, we demonstrate the effectiveness of cCCM in identifying both linear and nonlinear causal coupling in various settings through a large number of examples, including Gaussian random variables with additive noise, sinusoidal waveforms, autoregressive models, stochastic processes with a dominant spectral component embedded in noise, deterministic chaotic maps, and systems with memory, as well as experimental fMRI data. In particular, we analyze the impact of shadow manifold construction on the performance of cCCM and provide detailed guidelines on how to configure the key parameters of cCCM in different applications. Overall, our analysis indicates that cCCM is a promising and easy-to-implement tool for causality analysis in a wide spectrum of applications.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2024-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141522040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：