A formalism for studying long-range correlations in many-alphabets sequences
| dc.creator | Narasimhan, S. L. | |
| dc.creator | Nathan, Joseph A. | |
| dc.creator | Krishna, P. S. R. | |
| dc.creator | Murthy, K. P. N. | |
| dc.date | 2004-09-02 | |
| dc.date | 2005-09-13 | |
| dc.date.accessioned | 2026-07-07T03:00:13Z | |
| dc.date.available | 2026-07-07T03:00:13Z | |
| dc.description | 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 {\it coarse-graining} process) does not necessarily imply that long-range correlations found in the latter would correspond to those of the former. | |
| dc.description | A clarifying note added in the introduction and in the summary; 13 pages including 3 figure | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0409053 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0409053 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/24770 | |
| dc.subject | Statistical Mechanics | |
| dc.title | A formalism for studying long-range correlations in many-alphabets sequences | |
| dc.type | text |