35 citations · 84 across the 10 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
nlin.CD2011★ 6 cited
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…
nlin.CD2011★ 27 cited
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…
nlin.CD2011★ 3 cited
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…