35 citations · 84 across the 10 of their papers we have counts for
10 papers
Memory Uncertainty Relation and Harmonic Memory in Random Recurrent Networks
Taichi Haruna, Kohei Nakajima
We present an inequality that bounds the short-term memory capability of dynamical systems from below. It can be interpreted as an uncertainty relation between a measure of short-t…
Optimal short-term memory before the edge of chaos in driven random recurrent networks
Taichi Haruna, Kohei Nakajima
The ability of discrete-time nonlinear recurrent neural networks to store time-varying small input signals is investigated by mean-field theory. The combination of a small input st…
Evolution of Activity-Dependent Adaptive Boolean Networks towards Criticality: An Analytic Approach
Taichi Haruna
We propose new activity-dependent adaptive Boolean networks inspired by the cis-regulatory mechanism in gene regulatory networks. We analytically show that our model can be solved…
Symbolic local information transfer
Kohei Nakajima, Taichi Haruna
Recently, the permutation-information theoretic approach has been used in a broad range of research fields. In particular, in the study of highdimensional dynamical systems, it has…
Robustness and Directed Structures in Ecological Flow Networks
Taichi Haruna
Robustness of ecological flow networks under random failure of arcs is considered with respect to two different functionalities: coherence and circulation. In our previous work, we…
Theory of Interface: Category Theory, Directed Networks and Evolution of Biological Networks
Taichi Haruna
Biological networks have two modes. The first mode is static: a network is a passage on which something flows. The second mode is dynamic: a network is a pattern constructed by glu…
Permutation Complexity and Coupling Measures in Hidden Markov Models
Taichi Haruna, Kohei Nakajima
In [Haruna, T. and Nakajima, K., 2011. Physica D 240, 1370-1377], the authors introduced the duality between values (words) and orderings (permutations) as a basis to discuss the r…
Permutation Excess Entropy and Mutual Information between the Past and Future
Taichi Haruna, Kohei Nakajima
We address the excess entropy, which is a measure of complexity for stationary time series, from the ordinal point of view. We show that the permutation excess entropy is equal to…
Permutation Complexity via Duality between Values and Orderings
Taichi Haruna, Kohei Nakajima
We study the permutation complexity of finite-state stationary stochastic processes based on a duality between values and orderings between values. First, we establish a duality be…
Symbolic transfer entropy rate is equal to transfer entropy rate for bivariate finite-alphabet stationary ergodic Markov processes
Taichi Haruna, Kohei Nakajima
Transfer entropy is a measure of the magnitude and the direction of information flow between jointly distributed stochastic processes. In recent years, its permutation analogues ar…