Top Banner
Chaos and Order (2) Chaos and Order (2)
45

Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Dec 22, 2015

Download

Documents

Asher Morgan
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Chaos and Order (2)Chaos and Order (2)

Page 2: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.
Page 3: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Rabbits

If there are xn rabbits in the n-th generation, then in the n+1-th generation, there will be

xn+1=(1+r)xn

(only works if xn > 2)

Page 4: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.
Page 5: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.
Page 6: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Rabbits and Foxes

If foxes increase when rabbits become plentiful, this equation becomes:

xn+1=(1+r)xn - rxn2

(still only works if xn > 2)

Page 7: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Rab

bits

Rab

bits

Time

Page 8: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Rab

bits

Rab

bits

Page 9: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.
Page 10: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.
Page 11: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.
Page 12: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.
Page 13: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.
Page 14: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.
Page 15: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Value of r

Fin

al P

opul

atio

n

Page 16: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Value of r

Fin

al P

opul

atio

n

1.8

Page 17: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Value of r

Fin

al P

opul

atio

n

1.8 2.3

Page 18: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Value of r

Fin

al P

opul

atio

n

1.8 2.3 2.5

Page 19: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Value of r

Fin

al P

opul

atio

n

1.8 2.3 2.5 3.0

Page 20: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Value of r

Fin

al P

opul

atio

n

Page 21: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Divergence of initially close points:

Definition:

dx(n)=2ndx(0)

where is theLyapunov exponent

dx(3)

dx(0)

Page 22: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Lyapunov exponentfor the Verhulstprocess

Page 23: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.
Page 24: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Characteristics of Chaos

Two ingredients-- non-linearity and feedback --can give rise to chaos.

Chaos is governed by deterministic rules, yetproduces results that can be very hard to predict.

Images of chaotic processes can display a highlevel of order, characterised by self-similarity.

Page 25: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Chaos can arise in turbulent fluid flow…

Page 26: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.
Page 27: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

…and in orbital dynamics…

Page 28: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

And in biological systems:

Page 29: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Brassica Romanesco

Page 30: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

When can chaos arise?

In the iterated flow of raindrops down a slope:

Page 31: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.
Page 32: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.
Page 33: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.
Page 34: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

The shapes making up eroded landscapes andcoastlines are known as `fractals’.

Page 35: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

If Log(Coastline_length) grows with (1-D)log(ruler_length) + b,then the coastline has fractal dimension D

Page 36: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

When can chaos arise?

In the motion of a double pendulum:

Page 37: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

When can chaos arise?

Trying to get two non-linear programs to converge:

x

y

Page 38: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Randomness, Chaos and Order

We saw in last Friday’s lecture that a random image has maximal information content.

If an image has less than maximal information content, it displays order.

Page 39: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

65,536 random binary digits.

Page 40: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Reflective and Rotational Symmetries Reduce Information Content

Page 41: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Rotational and Reflective Symmetries reduce information content

Page 42: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Six axes of Reflected Symmetry

Page 43: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

What is the Information Content of a Fractal Image?

Page 44: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Formula for the Mandelbrot Set

For each (x,y) in [(Xmin, Xmax), (Ymin, Ymax)],Define z0 = x + iyBegin loop with j = 1 to Maximum_Iterations

{zj = zj-1 * zj-1+ z0;if |zj|>2, leave loop

}

Colour the point (x,y) with colour(j)

Total information content: 120 characters, 256 possibilities for each; hence, 960 bits.

Page 45: Chaos and Order (2). Rabbits If there are x n rabbits in the n-th generation, then in the n+1-th generation, there will be x n+1= (1+r)x n (only works.

Conclusions

Any process involving non-linear feedback

may become chaotic.

The output of a chaotic process may appear random, but has a hidden order.