Related papers: Assessing complexity by means of maximum entropy m…
We introduce a class of information measures based on group entropies, allowing us to describe the information-theoretical properties of complex systems. These entropic measures are nonadditive, and are mathematically deduced from a series…
Biological systems are generally complicated and/or complex. In the former approach, one sets up a model with a large number of parameters to describe the system in detail. The latter approach focuses on understanding the universal aspects…
Characterising the capacity region for a network can be extremely difficult, especially when the sources are dependent. Most existing computable outer bounds are relaxations of the Linear Programming bound. One main challenge to extend…
A definition of entropy via the Kolmogorov algorithmic complexity is discussed. As examples, we show how the meanfield theory for the Ising model, and the entropy of a perfect gas can be recovered. The connection with computations are…
In this paper we introduce a new approach for the study of the complex behavior of Minority Game using the tools of algorithmic complexity, physical entropy and information theory. We show that physical complexity and mutual information…
Complexity is a multi-faceted phenomenon, involving a variety of features including disorder, nonlinearity, and self-organisation. We use a recently developed rigorous framework for complexity to understand measures of complexity. We…
Like natural complex systems such as the Earth's climate or a living cell, semiconductor lithography systems are characterized by nonlinear dynamics across more than a dozen orders of magnitude in space and time. Thousands of sensors…
The evolution of complexity has been a central theme for Biology [2] and Artificial Life research [1]. It is generally agreed that complexity has increased in our universe, giving way to life, multi-cellularity, societies, and systems of…
Complex systems can be described at myriad different scales, and their causal workings often have multiscale structure (e.g., a computer can be described at the microscale of its hardware circuitry, the mesoscale of its machine code, and…
Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a…
We demonstrate some novel links between entropy and description complexity, a notion referring to the minimal formula length for specifying given properties. Let MLU be the logic obtained by extending propositional logic with the universal…
We analyze the effect of varying system conditions on the single-particle entanglement entropy for an arbitrary eigenstate of a complex system that can be described by a multiparametric Gaussian ensemble. Our theoretical analysis leads to…
In a genetic algorithm, fluctuations of the entropy of a genome over time are interpreted as fluctuations of the information that the genome's organism is storing about its environment, being this reflected in more complex organisms. The…
Several approaches and corresponding definitions of complexity have been developed in different fields. Urban systems are the archetype of complex socio-technical systems concerned with these different viewpoints. We suggest in this chapter…
In this paper, we reveal the relationship between entropy rate and the congestion in complex network and solve it analytically for special cases. Finding maximizing entropy rate will lead to an improvement of traffic efficiency, we propose…
Algorithms which learn environments represented by automata in the past have had complexity scaling with the number of states in the automaton, which can be exponentially large even for automata recognizing regular expressions with a small…
We propose a method for deriving networks from one-dimensional binary cellular automata. The derived networks are usually directed and have structural properties corresponding to the dynamical behaviors of their cellular automata. Network…
We analyze and compare the computational complexity of different simulation strategies for Monte Carlo in the setting of classically scaled population processes. This allows a range of widely used competing strategies to be judged…
The spatial character of territorial systems plays a crucial role in the emergence of their complexities. This contribution aims at illustrating to what extent different types of complexities can be exhibited in models of such systems. We…
In the last years different studies have revealed the usefulness of a microcanonical analysis of finite systems when dealing with phase transitions. In this approach the quantities of interest are exclusively expressed as derivatives of the…