Search results for "tractor"
showing 10 items of 219 documents
Transitions in consumption behaviors in a peer-driven stochastic consumer network
2019
Abstract We study transition phenomena between attractors occurring in a stochastic network of two consumers. The consumption of each individual is strongly influenced by the past consumption of the other individual, while own consumption experience only plays a marginal role. From a formal point of view we are dealing with a special case of a nonlinear stochastic consumption model taking the form of a 2-dimensional non-invertible map augmented by additive and/or parametric noise. In our investigation of the stochastic transitions we rely on a mixture of analytical and numerical techniques with a central role given to the concept of the stochastic sensitivity function and the related techni…
A new approximation procedure for fractals
2003
AbstractThis paper is based upon Hutchinson's theory of generating fractals as fixed points of a finite set of contractions, when considering this finite set of contractions as a contractive set-valued map.We approximate the fractal using some preselected parameters and we obtain formulae describing the “distance” between the “exact fractal” and the “approximate fractal” in terms of the preselected parameters. Some examples and also computation programs are given, showing how our procedure works.
Looking More Closely at the Rabinovich-Fabrikant System
2016
Recently, we looked more closely into the Rabinovich–Fabrikant system, after a decade of study [Danca & Chen, 2004], discovering some new characteristics such as cycling chaos, transient chaos, chaotic hidden attractors and a new kind of saddle-like attractor. In addition to extensive and accurate numerical analysis, on the assumptive existence of heteroclinic orbits, we provide a few of their approximations.
A constructive theory of shape
2021
We formulate a theory of shape valid for objects of arbitrary dimension whose contours are path connected. We apply this theory to the design and modeling of viable trajectories of complex dynamical systems. Infinite families of qualitatively similar shapes are constructed giving as input a finite ordered set of characteristic points (landmarks) and the value of a continuous parameter $\kappa \in (0,\infty)$. We prove that all shapes belonging to the same family are located within the convex hull of the landmarks. The theory is constructive in the sense that it provides a systematic means to build a mathematical model for any shape taken from the physical world. We illustrate this with a va…
Connectivity Influences on Nonlinear Dynamics in Weakly-Synchronized Networks: Insights from Rössler Systems, Electronic Chaotic Oscillators, Model a…
2019
Natural and engineered networks, such as interconnected neurons, ecological and social networks, coupled oscillators, wireless terminals and power loads, are characterized by an appreciable heterogeneity in the local connectivity around each node. For instance, in both elementary structures such as stars and complex graphs having scale-free topology, a minority of elements are linked to the rest of the network disproportionately strongly. While the effect of the arrangement of structural connections on the emergent synchronization pattern has been studied extensively, considerably less is known about its influence on the temporal dynamics unfolding within each node. Here, we present a compr…
On the connectedness of the attainability set for lattice dynamical systems
2012
We prove the Kneser property (i.e. the connectedness and compactness of the attainability set at any time) for lattice dynamical systems in which we do not know whether the property of uniqueness of the Cauchy problem holds or not. Using this property, we can check that the global attractor of the multivalued semiflow generated by such system is connected.
The fractal interpolation for countable systems of data
2003
In this paper we will extend the fractal interpolation from the finite case to the case of countable sets of data. The main result is that, given an countable system of data in [a, b] ? Y, where [a, b] is a real interval and Y a compact and arcwise connected metric space, there exists a countable iterated function system whose attractor is the graph of a fractal interpolation function.
A fractal set from the binary reflected Gray code
2005
The permutation associated with the decimal expression of the binary reflected Gray code with $N$ bits is considered. Its cycle structure is studied. Considered as a set of points, its self-similarity is pointed out. As a fractal, it is shown to be the attractor of a IFS. For large values of $N$ the set is examined from the point of view of time series analysis
INTERVAL-BASED TRACING OF STRANGE ATTRACTORS
2006
The method described here relies on interval arithmetic and graph theory to compute guaranteed coverings of strange attractors like Hénon attractor. It copes with infinite intervals, using either a geometric method or a new directed projective interval arithmetic.
Periodic and quasi-periodic orbits of the dissipative standard map
2011
We present analytical and numerical investigations of the dynamics of the dissipative standard map. We first study the existence of periodic orbits by using a constructive version of the implicit function theorem; then, we introduce a parametric representation, which provides the interval of the drift parameter ensuring the existence of a periodic orbit with a given period. The determination of quasi--periodic attractors is efficiently obtained using the parametric representation combined with a Newton's procedure, aimed to reduce the error of the approximate solution provided by the parametric representation. These methods allow us to relate the drift parameter of the periodic orbits to th…