Calculation of the transition matrix and of the occupation probabilities for the states of the Oslo sandpile model

Three faces of entropy for complex systems: Information, thermodynamics, and the maximum entropy principle

There are at least three distinct ways to conceptualize entropy: entropy as an extensive thermodynamic quantity of physical systems (Clausius, Boltzmann, Gibbs), entropy as a measure for information production of ergodic sources (Shannon), and entropy as a means for statistical inference on multinomial processes (Jaynes maximum entropy principle). Even though these notions represent fundamentally different concepts, the functional form of the entropy for thermodynamic systems in equilibrium, for ergodic sources in information theory, and for independent sampling processes in statistical systems, is degenerate, H(p)=-∑_{i}p_{i}logp_{i}. For many complex systems, which are typically history-dependent, nonergodic, and nonmultinomial, this is no longer the case. Here we show that for such processes, the three entropy concepts lead to different functional forms of entropy, which we will refer to as S_{EXT} for extensive entropy, S_{IT} for the source information rate in information theory, and S_{MEP} for the entropy functional that appears in the so-called maximum entropy principle, which characterizes the most likely observable distribution functions of a system. We explicitly compute these three entropy functionals for three concrete examples: for Pólya urn processes, which are simple self-reinforcing processes, for sample-space-reducing (SSR) processes, which are simple history dependent processes that are associated with power-law statistics, and finally for multinomial mixture processes.

Hidden geometry of traffic jamming

We introduce an approach based on algebraic topological methods that allow an accurate characterization of jamming in dynamical systems with queues. As a prototype system, we analyze the traffic of information packets with navigation and queuing at nodes on a network substrate in distinct dynamical regimes. A temporal sequence of traffic density fluctuations is mapped onto a mathematical graph in which each vertex denotes one dynamical state of the system. The coupling complexity between these states is revealed by classifying agglomerates of high-dimensional cliques that are intermingled at different topological levels and quantified by a set of geometrical and entropy measures. The free-flow, jamming, and congested traffic regimes result in graphs of different structure, while the largest geometrical complexity and minimum entropy mark the edge of the jamming region.

Scaling properties of a rice-pile model: inertia and friction effects

We present a rice-pile cellular automaton model that includes inertial and friction effects. This model is studied in one dimension, where the updating of metastable sites is done according to a stochastic dynamics governed by a probabilistic toppling parameter p that depends on the accumulated energy of moving grains. We investigate the scaling properties of the model using finite-size scaling analysis. The avalanche size, the lifetime, and the residence time distributions exhibit a power-law behavior. Their corresponding critical exponents, respectively, tau, y, and yr, are not universal. They present continuous variation versus the parameters of the system. The maximal value of the critical exponent tau that our model gives is very close to the experimental one, tau=2.02 [Frette, Nature (London) 379, 49 (1996)], and the probability distribution of the residence time is in good agreement with the experimental results. We note that the critical behavior is observed only in a certain range of parameter values of the system which correspond to low inertia and high friction.