The iterative evolution of complex systems

T. Erber and D. Gavelek

Physica A: Statistical Mechanics and its Applications, 1991, vol. 177, issue 1, 394-400

Abstract: The iterative properties of two classes of functions that map a finite set of N distinct elements into itself are essentially equivalent: (1) functions whose iterates form sequences that imitate random behavior; and (2) functions chosen “at random” from the set of all functions that map N into itself. The orbit structures of these functions are highly constrained. For instance, the expected size of the largest orbit is ∼ 0.8N; the expected size of the largest tree is ∼ 0.5N; the average length of a terminal cycle is (πN/8)12; and the average number of elements without pre-images is N/e. These constraints influence the dynamical behavior of “chaotic” systems whose evolution can be modeled by functional iteration. One practical consequence is the macroscopic stabilization of hysteresis loops in magnetic and mechanical systems.

Date: 1991
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/037843719190178F
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:177:y:1991:i:1:p:394-400

DOI: 10.1016/0378-4371(91)90178-F

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().