Abstract
The complexity measure of the infinite set of self-similar hierarchically constrained ensembles is determined in the framework of the generalized combinatory approach. It is shown that, as the hierarchical coupling increases, the complexity increases to a value that decreases with increasing the dispersion of this coupling and with decreasing the branching degree of the hierarchical tree.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Rammal, G. Toulouse, and M. A. Virasoro, Rev. Mod. Phys. 58, 765 (1986).
V. S. Dotsenko, Usp. Fiz. Nauk 163(6), 1 (1993) [Phys. Usp. 36, 455 (1993)].
A. I. Olemskoi, in Physics Reviews, Ed. by I. M. Khalatnikov (Gordon and Breach, London, 1996), Vol. 18, Part 1.
P. Holme, M. Huss, and H. Jeong, Bioinformatics 19, 532 (2003).
R. N. Mantegna and H. H. Stanley, An Introduction to Econophysics, Correlations and Complexity in Finance (Cambridge Univ. Press, Cambridge, 2000).
A. I. Olemskoĭ, Pis’ma Zh. Éksp. Teor. Fiz. 71, 412 (2000) [JETP Lett. 71, 285 (2000)].
M. Gellmann and C. Tsallis, Nonextensive Entropy: Interdisciplinary Applications (Oxford Univ. Press, Oxford, 2004).
H. Suyari, Physica A (Amsterdam) 368, 63 (2006).
H. Suyari and T. Wada, cond-mat/0608007.
A. I. Olemskoi and A. D. Kiselev, Phys. Lett. A 247, 221 (1998).
Author information
Authors and Affiliations
Additional information
Original Russian Text © A.I. Olemskoĭ, 2007, published in Pis’ma v Zhurnal Éksperimental’noĭ i Teoreticheskoĭ Fiziki, 2007, Vol. 85, No. 2, pp. 137–140.