Page 1 Next

Displaying 1 – 20 of 32

Showing per page

Central limit theorem for sampled sums of dependent random variables

Nadine Guillotin-Plantard, Clémentine Prieur (2010)

ESAIM: Probability and Statistics

We prove a central limit theorem for linear triangular arrays under weak dependence conditions. Our result is then applied to dependent random variables sampled by a -valued transient random walk. This extends the results obtained by [N. Guillotin-Plantard and D. Schneider, Stoch. Dynamics3 (2003) 477–497]. An application to parametric estimation by random sampling is also provided.

Centralisateurs des difféomorphismes de la demi-droite

Hélène Eynard-Bontemps (2008/2009)

Séminaire de théorie spectrale et géométrie

Soit f un difféomorphisme lisse de + fixant seulement l’origine, et 𝒵 r son centralisateur dans le groupe des difféomorphismes 𝒞 r . Des résultat classiques de Kopell et Szekeres montrent que 𝒵 1 est toujours un groupe à un paramètre. En revanche, Sergeraert a construit un f dont le centralisateur 𝒵 est réduit au groupe des itérés de f . On présente ici le résultat principal de [3] : 𝒵 peut en fait être un sous-groupe propre et non-dénombrable (donc dense) de 𝒵 1 .

Characterization of ω -limit sets of continuous maps of the circle

David Pokluda (2002)

Commentationes Mathematicae Universitatis Carolinae

In this paper we extend results of Blokh, Bruckner, Humke and Sm’ıtal [Trans. Amer. Math. Soc. 348 (1996), 1357–1372] about characterization of ω -limit sets from the class 𝒞 ( I , I ) of continuous maps of the interval to the class 𝒞 ( 𝕊 , 𝕊 ) of continuous maps of the circle. Among others we give geometric characterization of ω -limit sets and then we prove that the family of ω -limit sets is closed with respect to the Hausdorff metric.

Classification des difféomorphismes de Smale des surfaces : types géométriques réalisables

François Béguin (2002)

Annales de l’institut Fourier

La notion de type géométrique d’une partition de Markov est au centre de la classification des difféomorphismes de Smale i.e. des difféomorphismes C 1 - structurellement stables des surfaces. On résout ici le problème de réalisabilité : on donne un critère effectif pour décider si une combinatoire abstraite est, ou n’est pas, le type géométrique d’une partition de Markov de pièce basique de difféomorphisme de Smale de surface compacte.

Codages de rotations et phénomènes d'autosimilarité

Boris Adamczewski (2002)

Journal de théorie des nombres de Bordeaux

Nous étudions une classe de suites symboliques, les codages de rotations, intervenant dans des problèmes de répartition des suites ( n α ) n et représentant une généralisation géométrique des suites sturmiennes. Nous montrons que ces suites peuvent être obtenues par itération de quatre substitutions définies sur un alphabet à trois lettres, puis en appliquant un morphisme de projection. L’ordre d’itération de ces applications est gouverné par un développement bi-dimensionnel de type “fraction continue”...

Combinatorial mapping-torus, branched surfaces and free group automorphisms

François Gautero (2007)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

We give a characterization of the geometric automorphisms in a certain class of (not necessarily irreducible) free group automorphisms. When the automorphism is geometric, then it is induced by a pseudo-Anosov homeomorphism without interior singularities. An outer free group automorphism is given by a 1 -cocycle of a 2 -complex (a standard dynamical branched surface, see [7] and [9]) the fundamental group of which is the mapping-torus group of the automorphism. A combinatorial construction elucidates...

Combinatorics of distance doubling maps

Karsten Keller, Steffen Winter (2005)

Fundamenta Mathematicae

We study the combinatorics of distance doubling maps on the circle ℝ/ℤ with prototypes h(β) = 2β mod 1 and h̅(β) = -2β mod 1, representing the orientation preserving and orientation reversing case, respectively. In particular, we identify parts of the circle where the iterates f n of a distance doubling map f exhibit “distance doubling behavior”. The results include well known statements for h related to the structure of the Mandelbrot set M. For h̅ they suggest some analogies to the structure of...

Commutativity and non-commutativity of topological sequence entropy

Francisco Balibrea, Jose Salvador Cánovas Peña, Víctor Jiménez López (1999)

Annales de l'institut Fourier

In this paper we study the commutativity property for topological sequence entropy. We prove that if X is a compact metric space and f , g : X X are continuous maps then h A ( f g ) = h A ( g f ) for every increasing sequence A if X = [ 0 , 1 ] , and construct a counterexample for the general case. In the interim, we also show that the equality h A ( f ) = h A ( f | n 0 f n ( X ) ) is true if X = [ 0 , 1 ] but does not necessarily hold if X is an arbitrary compact metric space.

Compacts connexes invariants par une application univalente

Emmanuel Risler (1999)

Fundamenta Mathematicae

Let K be a compact connected subset of cc, not reduced to a point, and F a univalent map in a neighborhood of K such that F(K) = K. This work presents a study and a classification of the dynamics of F in a neighborhood of K. When ℂ K has one or two connected components, it is proved that there is a natural rotation number associated with the dynamics. If this rotation number is irrational, the situation is close to that of “degenerate Siegel disks” or “degenerate Herman rings” studied by R. Pérez-Marco...

Computing explicitly topological sequence entropy: the unimodal case

Victor Jiménez López, Jose Salvador Cánovas Peña (2002)

Annales de l’institut Fourier

Let W ( I ) denote the family of continuous maps f from an interval I = [ a , b ] into itself such that (1) f ( a ) = f ( b ) { a , b } ; (2) they consist of two monotone pieces; and (3) they have periodic points of periods exactly all powers of 2 . The main aim of this paper is to compute explicitly the topological sequence entropy h D ( f ) of any map f W ( I ) respect to the sequence D = ( 2 m - 1 ) m = 1 .

Currently displaying 1 – 20 of 32

Page 1 Next