Finite Approximation of SinaiBowenRuelle Measures

for Anosov Systems in Two Dimensions

Gary Froyland

Department of Mathematics

The University of Western Australia

Nedlands WA AUSTRALIA

Abstract

We describ e a computational metho d of approximating the physical or SinaiBowenRuelle

measure of an Anosov system in two dimensions The approximation may either b e viewed as a

xed p oint of an approximate PerronFrob enius op erator or as an invariant measure of a randomly

p erturb ed system

Keywords invariant measure PerronFrob enius op erator small random p erturbation

Mathematics Subject Classication Primary F Secondary F D A

Intro duction

The existence and computation of imp ortant invariant measures of deterministic dynamical systems

are still ma jor concerns in ergo dic theory In this note we do not address the problem of existence

but provide a small step in the computation of imp ortant measures when they are known to exist

In one dimension absolutely continuous invariant measures are considered to b e imp ortant from a

computational p oint of view b ecause it is absolutely continuous measures that show up on computer

simulations for most starting p oints If is an ergo dic absolutely continuous invariant measure for



then by the Birkho Theorem we have any Borel measurable f



Z

n

X

i

lim g d g f x

n

n

i

for almost all x and any given continuous g R Since Leb we may as well say

that holds for Leb esgue almost all x is clearly the unique measure with this prop erty In

this sense it seems natural to call absolutely continuous measures physical measures and ignoring

roundo errors it is not so surprising that such measures commonly show up in computer simulations

There is an analogue of absolutely continuous measures for wellb ehaved higher dimensional systems

such as Anosov and maps This measure is known as a SinaiBowenRuelle SBR measure

denoted and has the prop erty that it is exhibited by Leb esgue almost all initial p oints

SBR

in the Anosov case and Leb esgue almost all p oints in a fundamental neighb ourho o d for Axiom A

maps More formally we have the following theorem



Theorem For f M a C Axiom A dieomorphism with fundamental neigh



T

i

b ourho o d U M satisfying f U U and invariant attracting set f U we have

i

Z

n

X

i

g d g f x lim

SBR

n

n

M

i

for Leb esgue almost all x U and any given continuous g M R In the case of Anosov dieomor

phisms U M

Throughout the pap er f satises the conditions of this theorem SBR measures have clear physical

signicance as they are exhibited by a large in the Leb esgue measure sense set of p oints Approx

imations of the SBR measure are generally dened by exp erimentalists to b e the LHS of with

g x evaluated up to some large n for a randomly chosen x Many statistical indicators such as

x

Lyapunov exp onents are estimated using this timeaverage A discussion of the shortcomings of time

averaging and an application of our invariant measure approximation to the evaluation of Lyapunov

exp onents may b e found in

In TienYien Li resolved a conjecture of Ulam by showing that a unique absolutely

continuous invariant measure of a onedimensional system could b e estimated using a nite approx

imation of the PerronFrob enius op erator The unit interval was partitioned into a nite numb er

m

of subintervals fI g and the length of overlap of inverse images of the subintervals pro duced the

i

i

matrix approximation

f I I

j i

P

ij

I

i

to the innitedimensional PerronFrob enius op erator is onedimensional Leb esgue measure The

invariant density of the Markov chain governed by P dened a piecewise constant approximation of

the absolutely continuous invariant measure As the maximum length of the subintervals went to

zero by rening the partition strong limit p oints of the invariant densities gave the unique absolutely

continuous invariant measure Our goal was to extend this construction to dimensions to provide

us with a nite approximation of the SBR measure of a given system when it exists The natural

S

r m

with M and Int Int thing to do is to partition the space M into r sets f g

i i j i

i i

for i j and use the obvious extension of namely

m f

j i

P

ij

m

i

where m is normalised Riemannian volume on M By rening our partition so that the maximum

diameter of the partition sets go es to zero we extract an invariant measure as a weak limit p oint of

the invariant densities of the sequence of Markov chains governed by P Our result is that if at each

stage of renement the partition is Markov then the limiting measure is the SBR measure More

formally the main result is



b e a C Anosov dieomorphism or expanding C Theorem Main Result Let f M



map of a smo oth compact dimensional ddimensional Riemannian manifold M and denote by

n n n

g n b e a sequence of Markov m normalised Riemannian volume Let P f

r n

n

n for all n and n as n Dene partitions of M with max diam

ir n

i

n n

m f

i j

n

P

ij

n

m

i

n n n n n

Let p b e the normalised left eigenvector of P of eigenvalue that is p P p and dene

r n

n

X

mE

n n

i

E p

i

n

m

i

i

n

The sequence f g has a unique weak limit p oint namely the SBR measure of f

An outline of our approach follows To show that the limiting measure is f invariant we rst cast the

deterministic system f M as a randomly p erturb ed system governed by the nite state Markov chain

n

P We show that as the diameters of the partition sets decrease so do the random p erturbations

and it is an easy matter to show f invariance of the limiting measure We then intro duce equilibrium

states sp ecial invariant measures of f with resp ect to weight functions It is known that

for a sp ecial weight function namely log lo cal expansion in unstable directions the equilibrium

state of f is the SBR measure We use the relative areas of intersection of the partition sets with

their inverse images to provide us with an approximation of the sp ecial weight function It then turns

out that the appropriate matrix equation to solve to obtain an approximate equilibrium state is none

other than

Invariance of limit measures

We show in this section that weak limit p oints of our construction are f invariant The rest of the

pap er will b e devoted to showing that this invariant measure is the SBR measure and the uniqueness

n

follows The sto chastic matrix P may b e thought of as a transition matrix of a nite state Markov

chain From this transition matrix we may dene a transition function P M BM R by

n

r n

n n n

X

m mf

x

j j

P x

n

n

n

m m

x

j

j

n n

where is the unique partition set containing x M The transition function P has as its

n

x

n n n

after moves into may b e thought of as the probability that a p oint in invariant density P

j i ij

one iteration of f Insp ection of shows that this is not an unreasonable interpretation The

construction of P allows us to discuss a concrete random p erturbation of the deterministic map f

n

with P x to b e thought of as the probability that the random image of x lies in the set M

n

The following denition is taken from

Denition The Markov chains governed by a family of transition functions P are called smal l

n



if for every continuous function g M R random perturbations of f M



Z

lim sup g y P x dy g f x

n

n

M

xM

The LHS of the dierence in represents the eect of random noise which is added after applying

the function f to the p oint x M The integral averages the value of g over the allowed noise neigh

b ourho o d The requirement for the Markov pro cess to b e a small random p erturbation of f is roughly

that the noise neighb ourho o d applied after a transition from x coalesces ab out the deterministic image

f x

Lemma Our family of transition functions P is a small random p erturbation of f

n

Proof Dene

sup fjg x g y j kx y k g

g

xy M

sup fkf x f y k kx y k g and

f

xy M

sup fkf x f y k kx y k g

1

f

xy M

Z Z r n

n n

n

X y

mf

x

j

j

g y dmy g f x P x dy g y g f x

n

n

n

m m

M M

x

j

j

r n Z

n n

X

mf

x

j

g y dmy g f x

n

n

m m

x

j

j

j

Z r n

n n

X

mf

x

j

jg y g f xj dmy

n

n

n

m m

x

j

j

j

r n

n n

X

mf

x

j

n n

1

g

f

f

n

m

x

j

n as n n

1

g

f

f

n n n n

intersect and the greatest distance a p oint in such an then and f If mf

x x

j j

n n n

which is less than diameter of plus the diameter of f can b e from f x is less than

x

j j

f

n 2

1

f f

We repro duce here the simple pro of of that weak limit p oints of invariant densities of small random

p erturbations are invariant measures of the unp erturb ed map

n

Prop osition Let f g b e a sequence of invariant densities obtained from the sequence of tran

n

sition functions fP g and supp ose that weakly If the family fP g is a small random

n n

p erturbation of f then is f invariant

Proof Let g C M

Z Z Z Z

n

g f x dx g f x d x g f x dx g x dx

M M M M

Z Z

g f x P x dy g y d x

n n

M M

Z Z

g x d x g x dx

n

M M

The rst and third terms go to zero by weak convergence and the middle term go es to zero as fP g

n

is a small random p erturbation 2

So now we know that the measure that we extract from rep eated renements of our partition is

f invariant The rest of the pap er is devoted to demonstrating it is the SBR measure

Equilibrium states

We consider the pressure of f with resp ect to a weight function M R dened by

Z

d sup h f

f

M

M M

f

where h f is the measuretheoretic entropy of f and M M is the space of all f invariant Borel

f

u u

u

det D f xj probability measures For the weight function x log where E is the unstable

E

x

x

R

u

d is the SBR measure subspace at x the measure which maximises the quantity h f

M

We will use symb olic dynamics to compute an approximation to this maximal measure known as the

u

equilibrium state for the weight function For brevity of notation we drop the n dep endence of

the variables and consider a xed Markov partition P f g Dene

r

if Int f Int

i j

A

ij

otherwise

Z

A denes a subset fx A for all i Zg f r g of allowable

A n x x n

i i+1

sequences Given a biinnite sequence x x x there is a unique p oint in x M

A

i

with the prop erty that f x for all i Z We denote the mapping from a sequence x to

x A

i

its corresp onding p oint x M by We have the following commutative diagram M is

A

continuous and surjective

A A

y y

f

M M

If f is transitive resp then is transitive resp mixing see Prop osition If we

remove the b oundary p oints of the partition along with all of their foward and inverse images

is bijective on the remaining residual set see Theorem That is is bijective on M n

S S

n

j

f

i

j Z i

For M R Holder there is a unique equilibrium state Theorem and the equilibrium

state for is the pro jection of the equilibrium state for R under that is

A

Thus we may nd the equilibrium state for the smo oth M f with Holder weight

function by pro jecting down the equilibrium state from a suitably chosen subshift of nite typ e

the one derived from a Markov partition and weight function the one dened by In fact

what we are going to do is use the relative areas of intersection of the partition sets with their inverse

images to provide us with an estimate of the weight function M R which will approximate

n

u

and We then lift this to a R calculate the corresp onding equilibrium state

n n A

n

map this down to the equilibrium state for In the next section we see how to approximate

n

n

u

the weight function using only the Markov partition and its inverse images

Approximation of the weight function

For starters we deal with the much simpler case of expanding maps to give an idea of the direction

well take for the Anosov case

Lemma The Expanding Case

n n

mf

x x

u

0 1

log

n

n

m

x

1

uniformly as n

u

Proof In the expanding case x log j det D f xj as all directions are expanding We want

to estimate the Jacobian of f over the set f Let mE denote the Riemannian volume of

j i

a Borel subset E of our Riemannian manifold M Clearly

n

m

j

j det D f xj sup inf j det D f xj

n n

n n

1

n n

1 mf

xf

xf

i j j i

j i

n n n n n n

for all i j n since P f g is Int or f Int as either f

n

i j i j

a Markov partition From we have

n n

mf

i j

inf sup

n

n n

1

n n

j det D f xj m j det D f xj

1

xf

xf

j i j

j i

and since f is C as the diameter of the partition sets go es to zero

n n

mf

i j

n

n n

m j det D f xj j

1

f

j

j i

uniformly If we put

n n

mf

x x

1 0

x log

n

n

m

x

0

u u

then M R is an approximation of with uniformly as n since

n n n

f is C and is uniformly continuous on its domain of denition Note that x is a piecewise

n

constant approximation of j det D f xj constant on each of the sets in P f P 2

Remark Theorem holds if

n n

f

i j

n

P

ij

n

i

where is any probability measure equivalent to m m and m

In the pro ofs section we nd a similar estimate for twodimensional Anosov systems

Computing the approximate equilibrium state

u

For n large enough is a go o d approximation of Recall that the equilibrium state for is

n n

equal to the pro jection of the equilibrium state for under So lets nd the equilibrium state for

n

its a lo cally constant function dep ending only on the two symb ols to the right of centre and we

n

know how to do that

Theorem Let b e mixing so that A is irreducible and ap erio dic Supp ose that we

A

have a weight function R which dep ends only the on the two symb ols to the right of centre

A

that is x x x Dene

if A

ij

G

ij

x

e if A and x i x j

ij

Let u v b e the left and right eigenvectors resp ectively corresp onding to the maximal nonnegative

eigenvalue so that uG u and Gv v Further dene

G v

ij j

P

ij

v

i

The Markov measure generated by P is the equilibrium state for If pP p then fx

A

P P x a x a g a a a p

a a a a m m r a

r 2 r 1 0 1 0

Lemma The sto chastic matrix that generates the Markov measure that is the equilibrium state

for is given by

n

n n

mf

n

i j

P

ij

n

m

i

Proof By Theorem

n n

v G

j ij n

P

ij

n

n

v

i

where

n n

mf

i j n

ij

n

e G

ij

n

m

j

n n n

n n n n n n n

m and Q mf Now note that G L Q L where L m

ij

i i j i

ij ij ij

n

Since Q is sto chastic and irreducible we know that the unique up to scalar multiples right

n

eigenvector with nonnegative eigenvalue is the vector with eigenvalue and so v

n n n n

m m m and Thus

r n

n n n

m mf

j i j n

P

ij

n n

m m

j i

n n

mf

i j

n

m

i

by and 2

This means that the equilibrium state is given by the Markov measure

n

n n n

a a p P P

m

n a a a a a

0 0 1 m2 m1

n n

for we merely where p is the invariant density of P To obtain the equilibrium state

n

n

pro ject down via that is

n

n

Remark The same argument applies to Anosov maps This is done in the pro ofs section

Remark In practice for E BM we will most likely take

n

X

mE

i n

E p

n

i

m

i

i

for every i n has a uniform density on each of the partition sets and

i i

n n n

and distributing it uniformly What we are doing is taking the weight given to each partition set by

n

according to the natural volume measure over the entire partition set to obtain the measure

n

This extra error go es away as the size of the sets decreases since the distribution of mass within a

partition set do es not aect weak limits

Equation is a generalisation to higher dimensions of the approximation of the PerronFrob enius

op erator commonly used to estimate invariant densities of onedimensional systems with unique ab

solutely continuous invariant measures see Li for example What we have shown well were

nearly there is that this generalisation also provides us with an approximation of the absolutely con

tinous invariant measure of an ddimensional expanding map and the physical invariant measure

of an Anosov map later in two dimensions when the partition is Markov To show this we used

the relative volumes of inverse images of partition sets to estimate the Jacobian of the map in the

expanding directions The resulting piecewise constant approximation generated a sto chastic matrix

which in turn dened our estimate of the invariant measure This sto chastic matrix was nothing other

than the higher dimensional generalisation of Lis approximation So we can nd an approximate

n

equilibrium state of the Anosov dieomorphism simply by computing P and its left eigenvector

n

p To nish we see that we do indeed have an approximation in the sense that if is close to

n

u

in the uniform top ology C close then is close to in the weak top ology

(u)

n

u

Lemma weakly as uniformly

SBR n

n

u

Proof Let b e a sequence of approximations of obtained from shift systems so that k

n n

u

k The following argument is from the pro of of Lemma Cho ose some convergent

subsequence with f invariant We know that is Lipschitz with resp ect to the C

f

n

i

top ology for provided is nite see Theorem v or Theorem iv

f

u

lim by the Lipschitz prop erty

n

f f

n

h f lim

n n

n

n

u u

h f k k lim

n n

n

n

u

lim h f by weak convergence

n

n

u

h f

where the nal inequality follows from the upp er semicontinuity of the entropy map h f for

u

expansive f see Lemma or Theorem Now by we see that h f

(u)

u

In other words is the unique equilibrium state for and so we must have

(u)

SBR

2

u

So in our setup as we rene the partition the weight function converges to and we know

n

from p erturbation arguments that the approximations converge to an invariant measure What

n

u

Lemma tells us is that is in fact the equilibrium state for The measure that we obtain

as a weak limit of our approximations is the unique invariant measure that is exhibited by Leb esgue

almost all starting p oints in All that is used to estimate this measure are the areas of

intersections of Markov partitions with their inverse images

Using Lemmata and Remark Theorem is proven in the expanding case

Remark The preceding theory may b e extended to twodimensional Axiom A by

suitably dening a Markovian partition of M

Discussion

In this note we have shown that Lis formula may b e used to approximate the SBR measure in

twodimensional Anosov systems and expanding maps in ndimensions provided the partitions are

Markov The resulting estimate may b e viewed as either the xed p oint of an approximate nite

dimensional PerronFrob enius op erator or as an invariant measure of a small random p erturbation

of the original map Work on the former interpretation was done by Li for onedimensional piecewise

C expanding maps A Markov partition was not necessary using b ounded variation arguments Lis

work showed any nite partition would do Boyarsky and Lou extended Lis result to Jablonski

transformations a sp ecial class of piecewise expanding transformations in ndimensions Jablonski

transformations satisfy a typ e of separability condition and Boyarsky and Lou used Lis b ounded

variations arguments to obtain the result For more general transformations in higher dimensions the

problem b ecomes more dicult as the b ounded variation arguments are not able to b e used Baladi

and Young have shown for some mo del expanding maps and typ es of random p erturbations with

continuous densities that the PerronFrob enius op erators of the random systems approximate the

PerronFrob enius op erator of the unp erturb ed system suciently well to give convergence of densities

to the smo oth invariant measure as the noise go es to zero

Interpreting the approximation as an invariant measure of a randomly p erturb ed system results

have b een obtained by Kifer and Young Kifer has set out a numb er of technical hyp otheses

on the random p erturbations that guarantee convergence of the invariant measures of the p erturb ed

systems to the SBR measure of the unp erturb ed system Young has lo oked at random comp ositions

of p erturb ed maps and shown that as the p erturbations go to zero the invariant measures of the

random pro cess approach the SBR measure of the original map These two approaches are of little

computational use since the problem of computing the invariant measure of these random pro cesses

is just as dicult as the original problem of computing the SBR measure of the deterministic system

This is also the case for the work of where the invariant densities of a continuously p erturb ed

PerronFrob enius op erator are imp ossible to compute except in the simplest of cases For numerical

purp oses one really needs a nite dimensional approximation of the PerronFrob enius op erator or a

discontinuous random p erturbation

Our metho d allows a simple calculation of the invariant measure of the p erturb ed system as a left

eigenvector of a sto chastic matrix While this in principle provides a rigorous metho d of approximating

the SBR measure by computer the fact that Markov partitions need to b e constructed is a signicant

restriction for the practical application of the technique A matter for future work will b e to consider

the validity of the result if the Markov condition is relaxed Numerical results using nonMarkov

partitions are encouraging

Pro ofs

The Anosov case in two dimensions

We restrict ourselves to two dimensions as Markov partitions of Anosov dieomorphisms in dimension

three or ab ove are dicult to deal with see pages Each set in our partition has two

sides which are segments of stable foliations and two sides that are segments of unstable foliations see

App endix For any p oint on one of the stable b oundaries we have an unstable foliation running

through the p oint and across to an opp osing p oint on the other stable b oundary We have a similar

situation for the unstable b oundaries We intro duce some notation leaving out the n dep endence of

the partitions for convenience

u

b e the average unstable length of the partition set calculated by averaging the unstable Let

i

i

s

b e lengths integrating along one of the stable b oundaries of More precisely let

i

ileft

s u

R denote the length of a parametrisation of the left stable b oundary of and let

i

ix

ileft

s

the unstable foliation passing through x Then

ileft

Z

u u

dt

i

i t

Here length means the length of the curve representing a segment of the unstable foliation from one

s

stable b oundary to the other Similarly dene

i

umax

Dene to b e the maximal length of an unstable foliation traversing the partition set

i

i

umin

from one stable b oundary to the other and put as the minimal such length Similarly dene

i

smax smin

and

i i

Throughout this pro of we will b e nding upp er and lower b ounds of lengths and areas Without

loss of generality we calculate everything in lo cal co ordinates as the upp er and lower b ounds will still

b e such for the average values when everything is transferred back to the manifold

i u s max

as At each p oint x we may calculate the sine of the angle b etween E and E Put sin

x x

i

min

the supremum of these values taken over all of and similarly dene sin

i

i

Finally dene

umax smax

max max

A sin

i i

i i

umin smin

min min

A sin

i i

i i

and denote by A the area of

i i

Clearly

umin umax

u

i

i i

smin smax

s

i

i i

min max

A A A

i

i i

The imp ortant thing is that as the diameter of the partition sets decreases to zero we have convergence

of the maximum and minimum values That is

umin umax

u

i

i i

smin smax

s

i

i i

min max

A A A

i

i i

as the partition is rened This is b ecause the b oundaries of our partition sets are C and the angle

function is Holder For a C dieomorphism of a C manifold with a closed hyp erb olic invariant set

u s

the transition functions x E and x E are Holder continuous see p

x x

Lemma With the previous notation

un n n

m f

x x x

u

0 1 0

log

n

un

n

m

x

1

x

0

uniformly as n

Proof We want to put some b ounds on the value of the Jacobian of f restricted to the unstable

u

subspace Dene M R by x jD f xjE j We denote by an average value of

i

x

the restriction of to This average is calculated by integrating x over using suitably

i i

normalised Riemannian volume We wish to estimate the value of this is the average value of

1

f j i

x restricted to f Upp er b ounds rst We have that

j i

umax

1

f j

1

f j i

umin

j

as the right hand side is greater than or equal to the average value of x restricted to any of the

unstable foliations passing through We claim that

j

umax

max max

umin umax

A A

1 1 1

f j i f j i f j i

i i

umin umin umin min min

A A

i i

j j j

The second inequality is obvious the rst is true if

max

A

1

f j i

umin umax

1

i

min f j i

A

i

umax smax

max

sin

1

1 1

f i

f j i f j i

umax umin

1

i

f j i umin smin

min

sin

i i i

smin smax

min max

sin sin

1

1

i

i f j i

f j i

and the nal inequality always holds Thus we have proved our claim For the lower b ound we have

that

umin

1

f j

1

umax

f j i

j

and we wish to show that

umin

min min

umin umax

A A

1 1 1

f j i f j i f j i

i i

umax umax umax

max max

A A

i i j j j

Again the rst inequality is obvious the second is true if

min

A

1

f j i

umax umin

1

i

max

f j i

A

i

umin smin

min

sin

1

1 1

f j i

f j i f j i

umax umin

1

umax smax

i

max

f j i

sin

i i i

smin smax

min max

sin sin

1

1

i

i

f j i

f j i

The nal inequality is always true so holds

By and and and we have

min max

umax umin

A A

1 1

f j i f j i

i i

1

umax

f j i

max

min umin

A

A

i j

i

j

and clearly also

max min

umax umin

u

A A

A

1 1 1

f j i f j i f j i

i

i i

umax

max u

min umin

A A

A

i

i j j

i

j

In fact as the diameters of the partition sets go to zero the left and right hand sides of the inequality

converge to the average centre value Thus as the diameters of the partition sets go to zero

u

A

1

f j i

i

1

f j i

u

A

i

j

By putting

u

A 1

f x x

x

1 0

0

x log

n

u

A

x

0 x

1

and

n n

S S

n

j u

f we see that uniformly f is C and is uniformly continuous on M n

i n

j Z i

the set on which is invertible as n Again is just a piecewise constant approximation of

n

u

constant on the sets P f P 2

Remarks There is a simple interpretation of the ab ove estimate for 1 We are essentially

f j i

u u

Since the sets in the Markov partition are almost paral by A 1 A approximating

1

i

f j i

i

f j i

lelograms if they are small enough and b ecause of the way inverse images of partition sets overlap

it is simple to see how this works draw a picture

Also note the similarity b etween the expressions for the estimates of for the expanding and

1

f j i

hyp erb olic cases Recall that for f expanding we had

A

1

f j i

1

f j i

A

j

Our estimate of 1 in the Anosov case reduces to the ab ove estimate for expanding maps as here

f j i

u

coincides with A all directions are expanding and so

i

i

Lemma The sto chastic matrix that generates the Markov measure for our equilibrium state of

is

n

n n

mf

i j n

P

ij

n

m

i

Proof Set

n

un

A

1

f j i n

ij

i

n

G e

un

ij

n

A

i j

n n n

un

n n n

and Q L Q L where L As in the expanding case note that G

ij

ij ij i ij

n n n

Since Q is sto chastic and irreducible we know that the unique up to scalar multiples A A

1

i

f j i

right eigenvector with nonnegative eigenvalue is the vector with eigenvalue and so

un un

n un n

v and Thus

n

un

un

n

A

1

i

j f j i n

P

un un

ij

n

A

i j i

n

A

1

f j i

n

A

i

by and 2

By Lemmata and Remark we have proven Theorem in the Anosov case

Acknowledgements

The author would like to thank Anthony Quas Mark Pollicott and LaiSang Young for helpful dis

cussions

Note Added in Pro of A similar convergence result has b een proven by Ding and Zhou for

higher dimensional expanding maps using piecewise linear and piecewise quadratic approximations on

general partitions The author is grateful to a referee for bringing this work to his attention

References

Viviane Baladi and LaiSang Young On the sp ectra of randomly p erturb ed expanding maps Commu

nications in Mathematical Physics Erratum Comm Math Phys

Equilibrium States and the of Anosov Dieomorphisms volume of

Lecture Notes in Mathematics SpringerVerlag Berlin

Rufus Bowen and The ergo dic theory of axiom A ows Inventiones Mathematicae

Abraham Boyarsky and Y S Lou Approximating measures invariant under higherdimensional chaotic

transformations Journal of Approximation Theory

Jiu Ding and Ai Hui Zhou The pro jection metho d for computing multidimensional absolutely continuous

invariant measures Journal of Statistical Physics

Gary Froyland Kevin Judd and Alistair I Mees Estimation of Lyapunov exp onents of dynamical systems

using a spatial average Physical Review E

Gary Froyland Kevin Judd Alistair I Mees Kenji Murao and David Watson Constructing invariant

measures from data International Journal of Bifurcation and Chaos

Michael S Keane Ergo dic theory and subshifts of nite typ e In Tim Bedford Michael Keane and Caroline

Series editors Ergodic Theory Symbolic Dynamics and Hyperbolic Spaces chapter pages Oxford

University Press Oxford

RZ Khasminskii Principle of averaging for parab olic and elliptic dierential equations and for Markov

pro cesses with small diusion Theory of Probability and its Applications

Yuri Kifer General random p erturbations of hyp erb olic and expanding transformations Journal DAnalyse

Mathematique

Yuri Kifer Random Perturbations of Dynamical Systems volume of Progress in Probability and Statis

tics Birkhauser Boston

TienYien Li Finite approximation for the Frob eniusPerron op erator A solution to Ulams conjecture

Journal of Approximation Theory

Ricardo Man e Ergodic Theory and Dierentiable Dynamics SpringerVerlag Berlin

and Floris Takens Hyperbolicity and Sensitive Chaotic Dynamics at Homoclinic Bifurcations

volume of Cambridge Studies in Advanced Mathematics Cambridge University Press Cambridge

David Ruelle A measure asso ciated with axiomA attractors American Journal of Mathematics

Michael Shub Global Stability of Dynamical Systems SpringerVerlag New York

S M Ulam Problems in Modern Mathematics Interscience

Peter Walters A variational principle for the pressure of continuous transformations American Journal

of Mathematics

Peter Walters An Introduction to Ergodic Theory volume of Graduate Texts in Mathematics Springer

Verlag New York

LaiSang Young Sto chastic stability of hyp erb olic attractors Ergodic Theory and Dynamical Systems