نتایج جستجو برای: sierpinski fractals
تعداد نتایج: 3269 فیلتر نتایج به سال:
This paper explores methods of generating fractals from the mapping z→z −n +c and discusses the structure of the resulting images. Lyapunov exponents and cycle periodicity show details of these fractals that are obscured by prior escape-time techniques. The resulting fractals are shown to have a hypocycloid shape. The associated Julia sets can be classified into a variety of types.
This paper describes a method of generating fractals by composing two simple polynomial functions. Many common fractals, such as the Mandelbrot set, the tricorn, and the forced logistic map, as well as new fractals can be generated with this technique. In many cases, the symmetry of the resulting fractal can be easily proved.
The known properties of diffusion on fractals are reviewed in order to give a general outlook of these dynamic processes. After that, we propose a description developed in the context of the intrinsic metric of fractals, which leads us to a differential equation able to describe diffusion in real fractals in the asymptotic regime. We show that our approach has a stronger physical justification ...
Relatively general techniques for computing mean first-passage time (MFPT) of random walks on networks with a specific property are very useful since a universal method for calculating MFPT on general graphs is not available because of their complexity and diversity. In this paper, we present techniques for explicitly determining the partial mean first-passage time (PMFPT), i.e., the average of...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید