A formalism for studying long-range correlations in many-alphabets sequences
We formulate a mean-field-like theory of long-range correlated L-alphabets sequences, which are actually systems with (L-1) 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 coarse-graining process) does not necessarily imply that long-range correlations found in the latter would correspond to those of the former.
Year of publication: |
2006
|
---|---|
Authors: | Narasimhan, S.L. ; Nathan, Joseph A. ; Krishna, P.S.R. ; Murthy, K.P.N. |
Published in: |
Physica A: Statistical Mechanics and its Applications. - Elsevier, ISSN 0378-4371. - Vol. 367.2006, C, p. 252-260
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Is kinetic growth walk equivalent to canonical self-avoiding walk?
Ponmurugan, M., (2006)
-
Interacting growth walk on a honeycomb lattice
Narasimhan, S.L., (2003)
-
flatIGW — An inverse algorithm to compute the density of states of lattice self avoiding walks
Ponmurugan, M., (2011)
- More ...