1. NETWORKS

2. Note
This lecture is indebted to M.E.J. Newman Networks; an introduction Managing global finance as a system: speech given by Andrew G Haldane, Chief Economist, Bank of England, at the Maxwell Fry Annual Global Finance Lecture, Birmingham University 29 October 2014 Connections with fractals is discussed in my lecture Globalisation and extreme events

7. Haldane (2009)

8. Haldane (2009)

9. Haldane (2009)

10. Networks: default state Small world: highly clustered, short path lengths
Degree of a node is the number of edges (k) connecting it to other nodes.
High degree nodes have many connections (high k); low degree nodes have few (low k)
P(k) probability of degree k follows a power law
P(k) ≈ k – α..
P(k) ≈ Ck – α..
04/05/2019
robindcmatthews

11. k = degree of a node; the number of connected edges
P(k) ≈ Ck – α
The internet
k = degree of a node; the number of connected edges
04/05/2019
robindcmatthews

12. Fractal images source http://www.google.com/images/sdsc.edu
04/05/2019
robindcmatthews