We propose a new Statistical Complexity Measure (SCM) to qualify edge maps without Ground Truth (GT) knowledge. The measure is the product of two indices, an Equilibrium index E obtained by projecting the edge map into a ...

The generation of series of random numbers is an important and difficult problem. Appropriate measurements on entangled states have been proposed as the definitive solution. In principle, this solution requires reaching ...

In this thesis we study the heat equation on graphs from the perspective of information theory. To this end, we introduce the discrete heat equation using the probabilistic approach of random walks on graphs. Then we present ...

In the past decades, all of the efforts at quantifying systems complexity with a general tool has usually relied on using Shannon's classical information framework to address the disorder of the system through the ...

Thanks to the simplicity and robustness of its calculation methods, algorithmic (or Kolmogorov) complexity appears as a useful tool to reveal chaotic dynamics when experimental time series are too short and noisy to apply ...

In computability theory and computable analysis, finite programs can compute infinite objects. Such objects can then be represented by finite programs. Can one characterize the additional useful information contained in a ...

Working memory capacity can be improved by recoding the memorized information in a condensed form. Here, we tested the theory that human adults encode binary sequences of stimuli in memory using an abstract internal language ...