No Arabic abstract
We propose a method to obtain phase portraits for stochastic systems. Starting from the Fokker-Planck equation, we separate the dynamics into a convective and a diffusive part. We show that stable and unstable fixed points of the convective field correspond to maxima and minima of the stationary probability distribution if the probability current vanishes at these points. Stochastic phase portraits, which are vector plots of the convective field, therefore indicate the extrema of the stationary distribution and can be used to identify stochastic bifurcations that change the number and stability of these extrema. We show that limit cycles in stochastic phase portraits can indicate ridges of the probability distribution, and we identify a novel type of stochastic bifurcations, where the probability maximum moves to the edge of the system through a gap between the two nullclines of the convective field.
The 3D fundamental diagrams and phase portraits for tunnel traffic is constructed based on the empirical data collected during the last years in the deep long branch of the Lefortovo tunnel located on the 3rd circular highway in Moscow. This tunnel of length 3 km is equipped with a dense system of stationary ra-diodetetors distributed uniformly along it chequerwise at spacing of 60 m. The data were averaged over 30 s. Each detector measures three characteristics of the vehicle ensemble; the flow rate, the car velocity, and the occupancy for three lanes individually. The conducted analysis reveals complexity of phase states of tunnel traffic. In particular, we show the presence of cooperative traffic dynamics in this tunnel and the variety of phase states different in properties. Besides, the regions of regular and stochastic dynamics are found and the presence of dynamical traps is demonstrated.
In this paper we present the concept of description of random processes in complex systems with the discrete time. It involves the description of kinetics of discrete processes by means of the chain of finite-difference non-Markov equations for time correlation functions (TCF). We have introduced the dynamic (time dependent) information Shannon entropy $S_i(t)$ where i=0,1,2,3,... as an information measure of stochastic dynamics of time correlation $(i=0)$ and time memory (i=1,2,3,...). The set of functions $S_i(t)$ constitute the quantitative measure of time correlation disorder $(i=0)$ and time memory disorder (i=1,2,3,...) in complex system. Harnessing the infinite set of orthogonal dynamic random variables on a basis of Gram-Shmidt orthogonalization procedure tends to creation of infinite chain of finite-difference non-Markov kinetic equations for discrete TCF and memory function.The solution of the equations above thereof brings to the recurrence relations between the TCF and MF of senior and junior orders. The results obtained offer considerable scope for attack on stochastic dynamics of discrete random processes in a complex systems. Application of this technique on the analysis of stochastic dynamics of RR-intervals from human ECGs shows convincing evidence for a non-Markovian phenomemena associated with a peculiarities in short and long-range scaling. This method may be of use in distinguishing healthy from pathologic data sets based in differences in these non-Markovian properties.
We revisit the Ornstein-Uhlenbeck (OU) process as the fundamental mathematical description of linear irreversible phenomena, with fluctuations, near an equilibrium. By identifying the underlying circulating dynamics in a stationary process as the natural generalization of classical conservative mechanics, a bridge between a family of OU processes with equilibrium fluctuations and thermodynamics is established through the celebrated Helmholtz theorem. The Helmholtz theorem provides an emergent macroscopic equation of state of the entire system, which exhibits a universal ideal thermodynamic behavior. Fluctuating macroscopic quantities are studied from the stochastic thermodynamic point of view and a non-equilibrium work relation is obtained in the macroscopic picture, which may facilitate experimental study and application of the equalities due to Jarzynski, Crooks, and Hatano and Sasa.
Unsupervised learning makes manifest the underlying structure of data without curated training and specific problem definitions. However, the inference of relationships between data points is frustrated by the `curse of dimensionality in high-dimensions. Inspired by replica theory from statistical mechanics, we consider replicas of the system to tune the dimensionality and take the limit as the number of replicas goes to zero. The result is the intensive embedding, which is not only isometric (preserving local distances) but allows global structure to be more transparently visualized. We develop the Intensive Principal Component Analysis (InPCA) and demonstrate clear improvements in visualizations of the Ising model of magnetic spins, a neural network, and the dark energy cold dark matter ({Lambda}CDM) model as applied to the Cosmic Microwave Background.
In a recent paper [textit{M. Cristelli, A. Zaccaria and L. Pietronero, Phys. Rev. E 85, 066108 (2012)}], Cristelli textit{et al.} analysed relation between skewness and kurtosis for complex dynamical systems and identified two power-law regimes of non-Gaussianity, one of which scales with an exponent of 2 and the other is with $4/3$. Finally the authors concluded that the observed relation is a universal fact in complex dynamical systems. Here, we test the proposed universal relation between skewness and kurtosis with large number of synthetic data and show that in fact it is not universal and originates only due to the small number of data points in the data sets considered. The proposed relation is tested using two different non-Gaussian distributions, namely $q$-Gaussian and Levy distributions. We clearly show that this relation disappears for sufficiently large data sets provided that the second moment of the distribution is finite. We find that, contrary to the claims of Cristelli textit{et al.} regarding a power-law scaling regime, kurtosis saturates to a single value, which is of course different from the Gaussian case ($K=3$), as the number of data is increased. On the other hand, if the second moment of the distribution is infinite, then the kurtosis seems to never converge to a single value. The converged kurtosis value for the finite second moment distributions and the number of data points needed to reach this value depend on the deviation of the original distribution from the Gaussian case. We also argue that the use of kurtosis to compare distributions to decide which one deviates from the Gaussian more can lead to incorrect results even for finite second moment distributions for small data sets, whereas it is totally misleading for infinite second moment distributions where the difference depends on $N$ for all finite $N$.