A theory of systems with long-range correlations based on the consideration of binary N-step Markov chains is developed. In the model, the conditional probability that the ith symbol in the chain equals zero (or unity) is a linear function of the number of unities among the preceding N symbols. The correlation and distribution functions as well as the variance of the number of symbols in the words of arbitrary length L are obtained analytically and numerically. A self-similarity of the studied stochastic process is revealed and the similarity group transformation of the chain parameters is presented. The diffusion Fokker-Planck equation governing the distribution function of the L words is explored. If the persistent correlations are not extremely strong, the distribution function is shown to be the Gaussian with the variance being nonlinearly dependent on L. The applicability of the developed theory to the coarse-grained written and DNA texts is discussed.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1103/PhysRevE.68.061107 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
AQMDRL: Automatic Quality of Service Architecture Based on Multistep Deep Reinforcement Learning in Software-Defined Networking.
Sensors (Basel)
December 2022
School of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin 541004, China.
Software-defined networking (SDN) has become one of the critical technologies for data center networks, as it can improve network performance from a global perspective using artificial intelligence algorithms. Due to the strong decision-making and generalization ability, deep reinforcement learning (DRL) has been used in SDN intelligent routing and scheduling mechanisms. However, traditional deep reinforcement learning algorithms present the problems of slow convergence rate and instability, resulting in poor network quality of service (QoS) for an extended period before convergence.
View Article and Find Full Text PDFInformation entropy and temperature of binary Markov chains.
Phys Rev E
September 2022
A. Ya. Usikov Institute for Radiophysics and Electronics NASU, 61085 Kharkov, Ukraine.
We propose two different approaches for introducing the information temperature of binary Nth-order Markov chains. The first approach is based on a comparison of Markov sequences with equilibrium Ising chains at given temperatures. The second approach uses probabilities of finite-length subsequences of symbols occurring, which determine their entropies.
View Article and Find Full Text PDFEntropy of finite random binary sequences with weak long-range correlations.
Phys Rev E Stat Nonlin Soft Matter Phys
November 2014
A. Ya. Usikov Institute for Radiophysics and Electronics Ukrainian Academy of Science, 12 Proskura Street, 61805 Kharkov, Ukraine.
We study the N-step binary stationary ergodic Markov chain and analyze its differential entropy. Supposing that the correlations are weak we express the conditional probability function of the chain through the pair correlation function and represent the entropy as a functional of the pair correlator. Since the model uses the two-point correlators instead of the block probability, it makes it possible to calculate the entropy of strings at much longer distances than using standard methods.
View Article and Find Full Text PDFEntropy and long-range correlations in DNA sequences.
Comput Biol Chem
December 2014
A. Ya. Usikov Institute for Radiophysics and Electronics, Ukrainian Academy of Science, 12 Proskura Street, 61805 Kharkov, Ukraine. Electronic address:
We analyze the structure of DNA molecules of different organisms by using the additive Markov chain approach. Transforming nucleotide sequences into binary strings, we perform statistical analysis of the corresponding "texts". We develop the theory of N-step additive binary stationary ergodic Markov chains and analyze their differential entropy.
View Article and Find Full Text PDFKinetic lattice Monte Carlo simulation of viscoelastic subdiffusion.
J Chem Phys
August 2012
BIOMS Center for Modeling and Simulation in the Biosciences, D-69120 Heidelberg, Germany.
We propose a kinetic Monte Carlo method for the simulation of subdiffusive random walks on a cartesian lattice. The random walkers are subject to viscoelastic forces which we compute from their individual trajectories via the fractional Langevin equation. At every step the walkers move by one lattice unit, which makes them differ essentially from continuous time random walks, where the subdiffusive behavior is induced by random waiting.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!