Digital System Reconstruction by Pairwise Transfer Entropy
Transfer entropy (TE) is an attractive model-free method to detect causality and infer structural connectivity of general digital systems. However it relies on high dimensions used in its definition to clearly remove the memory effect and distinguish the direct causality from the indirect ones which makes it almost inoperable in practice. In this work, we try to use a low order and pairwise TE framework with binary data suitably filtered from the recorded signals to avoid the high dimensional problem. Under this setting, we find and explain that the TE values from the connected and unconnected pairs have a significant difference of magnitude, which can be easily classified by cluster methods. This phenomenon widely and robustly holds over a wide range of systems and dynamical regimes. In addition, we find the TE value is quadratically related to the coupling strength and thus we can establish a quantitative mapping between the causal and structural connectivity.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Inferring Coupling of Distributed Dynamical Systems via Transfer Entropy
In this work, we are interested in structure learning for a set of spatially distributed dynamical systems, where individual subsystems are coupled via latent variables and observed through a filter. We represent this mo…
The Two-Sided Market Network Analysis Based on Transfer Entropy & Labelr
This study more complex digital platforms in early stages in the two-sided market to produce powerful network effects. In this study, I use Transfer Entropy to look for super users who connect hominids in different netwo…
Vocal Bursts Valence PredictionHigher order definition of causality by optimally conditioned transfer entropy
The description of the dynamics of complex systems, in particular the capture of the interaction structure and causal relationships between elements of the system, is one of the central questions of interdisciplinary res…
Causal InferenceA unifying mutual information view of metric learning: cross-entropy vs. pairwise losses
Recently, substantial research efforts in Deep Metric Learning (DML) focused on designing complex pairwise-distance losses, which require convoluted schemes to ease optimization, such as sample mining or pair weighting. …
Metric LearningELSPR: Evaluator LLM Training Data Self-Purification on Non-Transitive Preferences via Tournament Graph Reconstruction
Large language models (LLMs) are widely used as evaluators for open-ended tasks, while previous research has emphasized biases in LLM evaluations, the issue of non-transitivity in pairwise comparisons remains unresolved:…
Graph Reconstruction