In this paper, inspired from our previous algorithm, which was based on the theory of Tsallis statistical mechanics, we develop a new evolving stochastic learning algorithm for neural networks. The new algorithm combines deterministic and stochastic search steps by employing a different adaptive...

We discuss a practical method to determine the eigenvalue spectrum of the empirical correlation matrix. The method is based on analysis of behavior of a conformal map at a critical horizon which is defined as a border line of the physical Riemann sheet of this map. The map is a convenient...

Over the last decade, an enormous interest and activity in complex networks have been witnessed within the physics community. On the other hand, diffusion and its theory have equipped the toolbox of the physicist for decades. In this paper, we will demonstrate how to combine these two seemingly...

We use the formalism of “maximum principle of Shannon's entropy” to derive the general power law distribution function, using what seems to be a reasonable physical assumption, namely, the demand of a constant mean “internal order” (Boltzmann entropy) of a complex, self-interacting,...

A diffusion process on complex networks is introduced in order to uncover their large-scale topological structures. This is achieved by focusing on the slowest decaying diffusive modes of the network. The proposed procedure is applied to real-world networks like a friendship network of known...

A statistical thermodynamic approach of moving particles forming an elastic body is presented which leads to reveal molecular–mechanical properties of classical and nonextensive dynamical systems. We derive the Boltzmann–Gibbs (BG) entropy form and relate it to Newton's law of motion in...

As a representative of a complex technological system, the so-called wireless multihop ad hoc communication networks are discussed. They represent an infrastructure-less generalization of todays wireless cellular phone networks. Lacking a central control authority, the ad hoc nodes have to...

In this paper we elaborate on the recently proposed superstatistics formalism [C. Beck, E.G.D. Cohen, Physica A 322 (2003) 267], used to interpret unconventional statistics. Their interpretation is that unconventional statistics in dynamical systems arise as weighted averages of the ordinary...

It is demonstrated how dynamic storage allocation algorithms can be analyzed in terms of finite-size scaling. The method is illustrated in the three simple cases of the first-fit, next-fit and best-fit algorithms, and the system works at full capacity. The analysis is done from two different...