Théorèmes limites pour une classe de chaînes de Markov et applications aux difféomorphismes d'Anosov
We propose stochastic versions of some theorems of W. J. Thron [14] on the speed of convergence of iterates for random-valued functions on cones in Banach spaces.
The purpose of the present article is to compare different phase-space sampling methods, such as purely stochastic methods (Rejection method, Metropolized independence sampler, Importance Sampling), stochastically perturbed Molecular Dynamics methods (Hybrid Monte Carlo, Langevin Dynamics, Biased Random Walk), and purely deterministic methods (Nosé-Hoover chains, Nosé-Poincaré and Recursive Multiple Thermostats (RMT) methods). After recalling some theoretical convergence properties for the...
We show that for critically non-recurrent rational functions all the definitions of topological pressure proposed in [12] coincide for all t ≥ 0. Then we study in detail the Gibbs states corresponding to the potentials -tlog|f'| and their σ-finite invariant versions. In particular we provide a sufficient condition for their finiteness. We determine the escape rates of critically non-recurrent rational functions. In the presence of parabolic points we also establish a polynomial rate of appropriately...
A smooth mapping of a smooth n-dimensional manifold L into a smooth 2n-dimensional symplectic manifold (M,ω) is called isotropic if f*ω vanishes. In the last ten years, the local theory of singularities of isotropic mappings has been rapidly developed by Arnol’d, Givental’ and several authors, while it seems that the global theory of their singularities has not been well studied except for the work of Givental’ [G1] in the case of dimension 2 (cf. [A], [Au], [I2], [I-O]). In the present paper,...
For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual language complexity function counting the finite words, the minimal and maximal complexity functions we get by replacing finite words by finite patterns, or words with holes.
For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual language complexity function counting the finite words, the minimal and maximal complexity functions we get by replacing finite words by finite patterns, or words with holes.
For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual language complexity function counting the finite words, the minimal and maximal complexity functions we get by replacing finite words by finite patterns, or words with holes.