Approximate aggregation techniques consist of introducing certain approximations that allow one to reduce a complex system involving many coupled variables obtaining a simpler ʽʽaggregated systemʼʼ governed by a few variables. Moreover, they give results that allow one to extract information about the complex original system in terms of the behavior of the reduced one. Often, the feature that allows one to carry out such a reduction is the presence...

We consider the asymptotic behavior of some classes of sequences defined by a recurrent formula. The main result is the following: Let f: (0,∞)² → (0,∞) be a continuous function such that (a) 0 < f(x,y) < px + (1-p)y for some p ∈ (0,1) and for all x,y ∈ (0,α), where α > 0; (b) $f(x,y)=px+(1-p)y-{\sum }_{s=m}^{\infty }s(x,y)$ uniformly in a neighborhood of the origin, where m > 1, ${}_s(x,y)={\sum }_{i=0}^s{a}_{i,s}{x}^{s-i}{y}^i$; (c) $ₘ(1,1)={\sum }_{i=0}^m{a}_{i,m}>0$. Let x₀,x₁ ∈ (0,α) and $x_{n+1}=f(xₙ,x_{n-1})$, n ∈ ℕ. Then the sequence (xₙ) satisfies the following asymptotic formula: $xₙ\sim {((2-p)/\left((m-1){\sum }_{i=0}^m{a}_{i,m}\right))}^{1/(m-1)}1/\sqrt[m-1]{n}$.