A formalism for studying long-range correlations in many-alphabets sequences
Abstract
We formulate a mean-field-like theory of long-range correlated -alphabets sequences, which are actually systems with independent parameters. Depending on the values of these parameters, the variance on the average number of any given symbol in the sequence shows a linear or a superlinear dependence on the total length of the sequence. We present exact solution to the four-alphabets and three-alphabets sequences. We also demonstrate that a mapping of the given sequence into a smaller alphabets sequence (namely, a {\it coarse-graining} process) does not necessarily imply that long-range correlations found in the latter would correspond to those of the former.
Cite
@article{arxiv.cond-mat/0409053,
title = {A formalism for studying long-range correlations in many-alphabets sequences},
author = {S. L. Narasimhan and Joseph A. Nathan and P. S. R. Krishna and K. P. N. Murthy},
journal= {arXiv preprint arXiv:cond-mat/0409053},
year = {2007}
}
Comments
A clarifying note added in the introduction and in the summary; 13 pages including 3 figure