Generation of hierarchically correlated multivariate symbolic sequences

Simple item page
dc.creatorTumminello, Mi.
dc.creatorLillo, F.
dc.creatorMantegna, R. N.
dc.date2008-02-12
dc.date.accessioned2026-07-07T10:07:56Z
dc.date.available2026-07-07T10:07:56Z
dc.descriptionWe introduce an algorithm to generate multivariate series of symbols from a finite alphabet with a given hierarchical structure of similarities. The target hierarchical structure of similarities is arbitrary, for instance the one obtained by some hierarchical clustering procedure as applied to an empirical matrix of Hamming distances. The algorithm can be interpreted as the finite alphabet equivalent of the recently introduced hierarchically nested factor model (M. Tumminello et al. EPL 78 (3) 30006 (2007)). The algorithm is based on a generating mechanism that is different from the one used in the mutation rate approach. We apply the proposed methodology for investigating the relationship between the bootstrap value associated with a node of a phylogeny and the probability of finding that node in the true phylogeny.
dc.description7 pages, 6 figures, 1 table
dc.identifierhttps://arxiv.org/abs/0802.1600
dc.identifierhttp://arxiv.org/abs/0802.1600
dc.identifierEur. Phys. J. B 65 (3): 333-340 (2008)
dc.identifierdoi:10.1140/epjb/e2008-00225-7
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/170820
dc.subjectComputational Physics
dc.titleGeneration of hierarchically correlated multivariate symbolic sequences
dc.typetext

Files

Collections

arXiv