No Arabic abstract
It was recently shown by Gaidashev and Yampolsky that appropriately defined renormalizations of a sufficiently dissipative golden-mean semi-Siegel Henon map converge super-exponentially fast to a one-dimensional renormalization fixed point. In this paper, we show that the asymptotic two-dimensional form of these renormalizations is universal, and is parameterized by the average Jacobian. This is similar to the limit behavior of period-doubling renormalization in the Henon family considered by de Carvalho, Lyubich and Martens. As an application of our result, we prove that the boundary of the golden-mean Siegel disk of a dissipative Henon map is non-rigid.
For quadratic polynomials of one complex variable, the boundary of the golden-mean Siegel disk must be a quasicircle. We show that the analogous statement is not true for quadratic Henon maps of two complex variables.
As was recently shown by the first author and others, golden-mean Siegel disks of sufficiently dissipative complex quadratic Henon maps are bounded by topological circles. In this paper we investigate the geometric properties of such curves, and demonstrate that they cannot be $C^1$-smooth.
We show that the dynamics of sufficiently dissipative semi-Siegel complex Henon maps with golden-mean rotation number is not $J$-stable in a very strong sense. By the work of Dujardin and Lyubich, this implies that the Newhouse phenomenon occurs for a dense $G_delta$ set of parameters in this family. Another consequence is that the Julia sets of such maps are disconnected for a dense set of parameters.
It is shown that critical phenomena associated with Siegel disk, intrinsic to 1D complex analytical maps, survives in 2D complex invertible dissipative H{e}non map. Special numerical method of estimation of the Siegel disk scaling center position (for 1D maps it corresponds to extremum) for multi-dimensional invertible maps are developed.
In usual scale-free networks of Barabasi-Albert type, a newly added node selects randomly m neighbors from the already existing network nodes, proportionally to the number of links these had before. Then the number N(k) of nodes with k links each decays as 1/k^gamma where gamma=3 is universal, i.e. independent of m. Now we use a limited directedness in the construction of the network, as a result of which the exponent gamma decreases from 3 to 2 for increasing m.