相关论文: Comment on "Inferring Statistical Complexity"

Quantitative linguistics has been allowed, in the last few decades, within the admittedly blurry boundaries of the field of complex systems. A growing host of applied mathematicians and statistical physicists devote their efforts to…

Bandt and Pompe introduced Permutation Entropy in 2002 for Time Series where equal values, xt1 = xt2, t1 = t2, were neglected and only inequalities between the xt were considered. Since then, this measure has been modified and extended, in…

The qualitatively new concept of dynamic complexity in quantum mechanics is based on a new paradigm appearing within a nonperturbational analysis of the Schroedinger equation for a generic Hamiltonian system. The unreduced analysis…

We recount recent history behind building compact models of nonlinear, complex processes and identifying their relevant macroscopic patterns or "macrostates". We give a synopsis of computational mechanics, predictive rate-distortion theory,…

This is a comment on arXiv:1402.6767 (2014) by Y. Imura, T. Okubo, S. Morita, and K. Okunishi.

How much information do we need about a process' past to faithfully simulate its future? The statistical complexity is a prominent quantifier of structure for stochastic processes. Quantum machines, however, can simulate classical…

We propose a new class of univariate nonstationary time series models, using the framework of modulated time series, which is appropriate for the analysis of rapidly-evolving time series as well as time series observations with missing…

The question What is Complexity? has occupied a great deal of time and paper over the last 20 or so years. There are a myriad different perspectives and definitions but still no consensus. In this paper I take a phenomenological approach,…

We give a review of some recent developments in embeddings of time series and dynamic networks. We start out with traditional principal components and then look at extensions to dynamic factor models for time series. Unlike principal…

For over a decade, the hypercomputation movement has produced computational models that in theory solve the algorithmically unsolvable, but they are not physically realizable according to currently accepted physical theories. While…

We introduce a measure of complexity in terms of the average number of bits per time unit necessary to specify the sequence generated by the system. In random dynamical system, this indicator coincides with the rate K of divergence of…

Inspired by the work of Feynman, Deutsch, We formally propose the theory of physical computability and accordingly, the physical complexity theory. To achieve this, a framework that can evaluate almost all forms of computation using various…

Wibral et al. propose a measure of interaction delays rooted in an information-theoretic framework and contrast their measure with the bivariate momentary information transfer (MIT), introduced in Pompe, B., & Runge, J. (2011). Momentary…

Quantum mechanics, one of the most successful theories in the history of science, was created to account for physical systems not describable by classical physics. Though it is consistent with all experiments conducted thus far, many of its…

I present a selection of conceptual and mathematical problems in the foundations of modern physics as they derive from the title question. Contribution to a panel session, "Springer Forum: Quantum Structures -- Physical, Mathematical and…

A mathematical concept is identified and analyzed that is implicit in the 2012 paper Turing Incomputable Computation, presented at the Alan Turing Centenary Conference (Turing-100, Manchester). The concept, called dynamic level sets, is…

Applying machine learning (ML) on multivariate time series data has growing popularity in many application domains, including in computer system management. For example, recent high performance computing (HPC) research proposes a variety of…

The article outlines in memoriam Prof. Pavel Zampa's concepts of system theory which enable to devise a measurement in dynamic systems independently of the particular system behaviour. From the point of view of Zampa's theory, terms like…

Permutation entropy measures the complexity of deterministic time series via a data symbolic quantization consisting of rank vectors called ordinal patterns or just permutations. The reasons for the increasing popularity of this entropy in…

This contribution analyses the classical laws of motion by means of an approach relating time and entropy. We argue that adopting the notion of change of states as opposed to the usual derivation of Newton's laws in terms of fields a…