Scale Invariance in Complex Systems Geoff Rodgers School of Information Systems, Computing and Mathematics.

Slides:



Advertisements
Similar presentations
Mean, Proportion, CLT Bootstrap
Advertisements

A Sampling Distribution
It’s a Small World by Jamie Luo. Introduction Small World Networks and their place in Network Theory An application of a 1D small world network to model.
Information Networks Generative processes for Power Laws and Scale-Free networks Lecture 4.
Synopsis of “Emergence of Scaling in Random Networks”* *Albert-Laszlo Barabasi and Reka Albert, Science, Vol 286, 15 October 1999 Presentation for ENGS.
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
1 A Random-Surfer Web-Graph Model (Joint work with Avrim Blum & Hubert Chan) Mugizi Rwebangira.
Alon Arad Alon Arad Hurst Exponent of Complex Networks.
Simple Linear Regression
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
Financial Networks with Static and dynamic thresholds Tian Qiu Nanchang Hangkong University.
Complex networks and random matrices. Geoff Rodgers School of Information Systems, Computing and Mathematics.
Power Laws Otherwise known as any semi- straight line on a log-log plot.
Advanced Topics in Data Mining Special focus: Social Networks.
Self Organized Criticality Benjamin Good March 21, 2008.
1 Simple Linear Regression Chapter Introduction In this chapter we examine the relationship among interval variables via a mathematical equation.
Complex Systems, Agent Cognition and Network Structure : Modeling with Low Cognition Agents Rich Colbaugh, Kristin Glass, Paul Ormerod and Bridget Rosewell.
How is this going to make us 100K Applications of Graph Theory.
QMS 6351 Statistics and Research Methods Probability and Probability distributions Chapter 4, page 161 Chapter 5 (5.1) Chapter 6 (6.2) Prof. Vera Adamchik.
Chap.3 A Tour through Critical Phenomena Youjin Deng
Computer Science 1 Web as a graph Anna Karpovsky.
Lecture 17 Interaction Plots Simple Linear Regression (Chapter ) Homework 4 due Friday. JMP instructions for question are actually for.
Chapter 7 Probability and Samples: The Distribution of Sample Means
Chapter 13 Statistics © 2008 Pearson Addison-Wesley. All rights reserved.
PHYS 3313 – Section 001 Lecture #17
The Erdös-Rényi models
Information Networks Power Laws and Network Models Lecture 3.
QA in Finance/ Ch 3 Probability in Finance Probability.
On project probabilistic cost analysis from LHC tender data Ph. Lebrun CERN, Geneva, Switzerland TILC’09, Tsukuba, Japan April 2009.
Models and Algorithms for Complex Networks Power laws and generative processes.
Percolation in self-similar networks Dmitri Krioukov CAIDA/UCSD M. Á. Serrano, M. Boguñá UNT, March 2011.
Numerical Experiments in Spin Network Dynamics Seth Major and Sean McGovern ‘07 Hamilton College Dept. of Physics Spin networks In one approach to quantum.
How and why things crackle We expect that there ought to be a simple, underlying reason that earthquakes occur on all different sizes. The very small earthquake.
Critical Phenomena in Random and Complex Systems Capri September 9-12, 2014 Spin Glass Dynamics at the Mesoscale Samaresh Guchhait* and Raymond L. Orbach**
Random-Graph Theory The Erdos-Renyi model. G={P,E}, PNP 1,P 2,...,P N E In mathematical terms a network is represented by a graph. A graph is a pair of.
1 Psych 5500/6500 Standard Deviations, Standard Scores, and Areas Under the Normal Curve Fall, 2008.
School of Information Sciences University of Pittsburgh TELCOM2125: Network Science and Analysis Konstantinos Pelechrinis Spring 2013 Figures are taken.
Chapter 6 USING PROBABILITY TO MAKE DECISIONS ABOUT DATA.
Gabor Fath Research Institute for Solid State Physics, HAS, Budapest Miklos Sarvary INSEAD, Fontainebleau Should prices be always lower on the Internet?
Janine Bolliger 1, Julien C. Sprott 2, David J. Mladenoff 1 1 Department of Forest Ecology & Management, University of Wisconsin-Madison 2 Department of.
Minority Game and Herding Model
Class 9: Barabasi-Albert Model-Part I
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Inference: Probabilities and Distributions Feb , 2012.
Chapter 8: Simple Linear Regression Yang Zhenlin.
Properties of Growing Networks Geoff Rodgers School of Information Systems, Computing and Mathematics.
ECE-7000: Nonlinear Dynamical Systems 2. Linear tools and general considerations 2.1 Stationarity and sampling - In principle, the more a scientific measurement.
Surveying II. Lecture 1.. Types of errors There are several types of error that can occur, with different characteristics. Mistakes Such as miscounting.
Kensuke Homma / Hiroshima Univ. from PHENIX collaboration
Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.
1 Dynamical Models for Herd Behavior in Financial Markets I. Introduction II. Model - Markets - Agents - Links III. Numerical results IV. Conclusions Sungmin.
Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.
Computational Physics (Lecture 10) PHY4370. Simulation Details To simulate Ising models First step is to choose a lattice. For example, we can us SC,
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Contagion in Networks Networked Life NETS 112 Fall 2015 Prof. Michael Kearns.
Lecture 23: Structure of Networks
Self-organized criticality of landscape patterning
Lecture 23: Structure of Networks
Networked Life NETS 112 Fall 2018 Prof. Michael Kearns
Models of Network Formation
Networked Life NETS 112 Fall 2017 Prof. Michael Kearns
Models of Network Formation
Networked Life NETS 112 Fall 2014 Prof. Michael Kearns
Networked Life NETS 112 Fall 2016 Prof. Michael Kearns
Warmup To check the accuracy of a scale, a weight is weighed repeatedly. The scale readings are normally distributed with a standard deviation of
Statistics of Extreme Fluctuations in Task Completion Landscapes
Lecture 23: Structure of Networks
Networked Life NETS 112 Fall 2019 Prof. Michael Kearns
Presentation transcript:

Scale Invariance in Complex Systems Geoff Rodgers School of Information Systems, Computing and Mathematics

Plan 1.Physics – equilibrium statistical mechanics. 2.Self-organised criticality. 3.Networks. 4.Financial systems. 5.Conclusions.

Physics Consider a classical system, like an Ising model of a magnet. This has a Hamiltonian H = - J  S i S j Consider it in equilibrium at temperature T in dimension d >2.

Consider the pair correlation function F(r) = ) (S j - ) >, where r = | i - j |. Simple matter to show that F(r) = r -(d-2+  ) g(r/  ) where the correlation length  behaves like  = | T - T c | - 

So at the critical temperature T=T c, the correlation length diverges to infinity, and the pair correlation function is power-law F(r) ~ r -(d-2+  ) i.e. scale invariant.

In equilibrium statistical mechanics – power laws only occur at the critical point. In non-equilibrium statistical mechanics power-laws are also quite rare.

Other physical quantities for this system have a scaling form, and are power-law at criticality. Also, because F(r) = r -(d-2+  ) g(r | T - T c |  ), plots of F(r)r d-2+  against r | T - T c | ,for different temperatures, lie on a universal curve g.

Other systems have the same scaling forms, with different scaling functions g(x) and different exponents. Systems with the same exponents have identical physics and are said to be in the same universality class. Scale free, scale invariant, power-law behaviour only occurs at criticality.

Self-organised criticality Simple models of avalanches Have a square lattice with grains of sand on each site. At each time step, add a grain to the central site. Then allow toppling and hence avalanches to occur.

Site (i,j) has z i j grains on it For all z i j  4 toppling occurs z i j  z i j – 4 z i  1 j  z i  1 j +1 z i j  1  z i j  1 +1 Lattice is finite, so grains falls off – this is the avalanche.

Three time steps; Avalanche sizes 0, 0 and 3. Time step 1Time step 2Time step 3 Time step

Measure the avalanches over a long period of time on a large lattice – the distribution of avalanches sizes is power-law N(x) ~ x – 3/2 Such models are called self-organised critical models – there is no tunable parameter such as temperature to make them critical.

At first models such as this were believed to be robust – with powerful toppling kinetics that made the details of the lattice, toppling rule etc.. irrelevant, and drove the model to a large attractor state with power-law distributions. Later became apparent that introducing physical characteristics to the kinetics – for instance, friction, randomness in the toppling, anisotropy, momentum, inhomogeneous grains – destroyed the power-laws.

However, a lot of experimental evidence suggests that spatial and temporal correlations in avalanche systems are power-law. But these real experimental systems obviously have anisotropies, inertia, friction etc…

Networks A lot of networks in economic, technological and social systems have been found to have a power-law degree distribution. That is, the number of vertices N(m) with m edges is given by N(m) ~ m - 

Examples include Web graph Telephone call graph graph Citation graph Co-authorship graph and many others

Web-graph Vertices are web pages Edges are html links Degree distribution is power law

These graphs are all grown, i.e. vertices and edges added over time. Imagine a model system in which we add a new vertex at each time step. Connect the new vertex to an existing vertex of degree k with rate proportional to k.

Total degree of network = 18, 10 vertices Connect new vertex number 11 to vertex 1 with probability 5/18 vertex 2 with probability 3/18 vertex 7 with probability 3/18 all others, probability 1/18 each

This network is completely solvable analytically – the number of vertices of degree k at time t, n k (t), obeys the differential equation where M(t) =  kn k (t) is the total degree of the network.

Simple to show that as t   n k (t) ~ k -3 t and the behavior is power-law. However, adding other ingredients – for Instance aging, heterogeneities and probabilistic attachment - destroys the power-law.

Financial Systems Intra-day Returns Empirical analyses of financial price data show that the price of different assets deviate from Gaussian, which would be expected if the agents were acting independently.

Anomalously large oscillations are observed, which are distributed according to an exponentially truncated power law x -  exp { -x/x 0 } where  takes a value between 1.4 and 1.6 for a number of market indices and stocks.

If the price at time t, is p(t), then normally measure the return at time t defined by Z(t) = p(t+  t)-p(t) for small  t.

S&P 500 price changes, with Gaussian and Levy stable distribution for comparison.

Physically motivated models assume that this behaviour is caused by co-operative behaviour of the agents, and in particular by a phenomenon called herding or crowding. This is the traditional explanation provided by economists.

Models used to explain this phenomena are based on either (i)Kinetics of group aggregation and dissolution (ii)Processes on social networks (iii)The kinetics of the order book (iv)Multiplicative random exchange processes. All these models give rise to power laws with varying degrees of generality.

e.g. Kinetics of the order book A limit order to sell (or buy) is an instruction to sell (or buy) a share if its price rises above (falls below) the execution price of the limit order. A market order is an instruction to immediately sell or buy at the currently available price.

Simple model At each time step, with equal probability, place a limit order to buy a limit order to sell a market order to buy a market order to sell Each new order is placed randomly within ±  of the current price.

Kinetics of the Order Book

The probability of a price fluctuation of size x, is given by x -  with   2.0.

How to make sense of it all? Traditionally physicists search for the necessary and sufficient ingredients for a phenomena to occur. Then seek to define universality classes – classes of behaviour as a function of the ingredients.

Of course, systems considered in this talk may be too diverse to make this possible. Have a go anyway.

Power laws seem to be ubiquitous in a wide range of physical, technological, social and financial systems. Traditional models, be they either equilibrium or non equilibrium, only give rise to power laws in rather special circumstances, such as at a critical point.

The models considered in this talk were designed to understand empirical measurements of power-law distributions. The models themselves were kinetic. They can be characterised or modeled by a kinetic process. growing or driven; at each time step something is added. random – not deterministic. Thus a growing or driven random kinetic process might be regarded as necessary for power-laws distribution.

Although these models exhibit power laws for a wide range of some parameters, the power- laws are destroyed by the addition of some ingredients. Unfortunately, these ingredients, such as (i)Inertia in sand piles (ii)Randomness in the www or collaboration graph (iii)Strategy scoring in the stock market are all present in the real systems.

Hence the question of why scale free behaviour is observed is such a wide range of systems still remains open.

Seminar next week Networks: Structure and Transport. Bosa Tadic, Institute Josef Stefan, Ljubljana. Wednesday 4pm, Maths 128.