Generating Networks with Sur- plus Complexity p. 1/17 Complexity, - - PowerPoint PPT Presentation

generating networks with sur plus complexity
SMART_READER_LITE
LIVE PREVIEW

Generating Networks with Sur- plus Complexity p. 1/17 Complexity, - - PowerPoint PPT Presentation

Generating Networks with Sur- plus Complexity p. 1/17 Complexity, or amount of infor- mation Note: Information = data + meaning Meaning B Meaning A Semantic Space B is more complex than A


slide-1
SLIDE 1

Generating Networks with Sur- plus Complexity

– p. 1/17

slide-2
SLIDE 2

Complexity, or amount of infor- mation

Note: Information = data + meaning

  • B

Meaning B

A

Meaning A

Syntactic Space N letters in alphabet descriptions of length ℓ Semantic Space “B is more complex than A

– p. 2/17

slide-3
SLIDE 3

Complexity as Information

We need two things to determine the complexity of something:

An encoding over a finite alphabet (eg a

bitstring)

A classifier function (aka observer) of the

strings that can determine whether two encodings refer to the same object

– p. 3/17

slide-4
SLIDE 4

Kolmogorov complexity of a bit- string

Classifier is a Turing machine Encodings are programs of the Turing machine

that output the thing (a bitstring)

In the limit as n → ∞, complexity is dominated

by the length of the shortest program (compiler theorem).

Random strings are maximally complex

– p. 4/17

slide-5
SLIDE 5

Effective complexity of English literature

Encoding is the latin script encoding words of

English

Classifier is a human being deciding whether

two strings of latin script mean the same thing.

The vast majority of strings are meaningless

(gibberish), hence have vanishing complexity. Random strings have low complexity.

Repetitive, (algorithmic) strings are also fairly

low complexity.

– p. 5/17

slide-6
SLIDE 6

Encoding of Digraphs

n nodes, ℓ links, rank encoded linklist r log2 n + 1 log2 n log2 n(n − 1) n(n − 1)

  • 111 . . . 10
  • n
  • r

Empty and full digraphs have minimal

complexity of ≈ 4 log2 n bits

Digraph has same complexity as its

complement

Complexity peaks at intermediate link counts

– p. 6/17

slide-7
SLIDE 7

Classification of Digraphs

Nodes are unlabelled Node position is irrelevant Two digraphs are equivalent if automorphic

– p. 7/17

slide-8
SLIDE 8

Automorphism problem

Determine if two (di)graphs are automorphic Count the number of automorphisms Suspected as being NP Practical algorithms exist: Nauty, Saucy,

SuperNOVA

– p. 8/17

slide-9
SLIDE 9

Weighted Links

Want a graph that is “in between” two graph structures to have “in between” complexity. For network N × L with weights wi, ∀i ∈ L

C(N × L) =

1

0 C(N × {i ∈ L : wi < w})dw

– p. 9/17

slide-10
SLIDE 10

Food Web Data

Dataset nodes links

C

eln CER ∆ = C − eln CER

| ln C−ln CER|

σER

celegansneural 297 2345 442.7 251.6 191.1 29 celegansmetabolic 453 4050 25421.8 25387.2 34.6 ∞ lesmis 77 508 199.7 114.2 85.4 24 adjnoun 112 850 3891 3890 0.98 ∞ yeast 2112 4406 33500.6 30218.2 3282.4 113.0 Chesapeake 39 177 66.8 45.7 21.1 10.4 Everglades 69 912 54.5 32.7 21.8 11.8 Florida 128 2107 128.4 51.0 77.3 20.1 Maspalomas 24 83 70.3 61.7 8.6 5.3 Michigan 39 219 47.6 33.7 14.0 9.5 Mondego 46 393 45.2 32.2 13.0 10.0 Narragan 35 219 58.2 39.6 18.6 11.0 Rhode 19 54 36.3 30.3 6.0 5.3 StMarks 54 354 110.8 73.6 37.2 16.0

– p. 10/17

slide-11
SLIDE 11

Shuffled model

5 10 15 20 25 30 35 40 40 45 50 55 60 Complexity − → |

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

39.8 0.0351403x exp

  • −0.5
  • log(x)−3.67978

0.0351403

2

39.8 1.40794 exp

  • −0.5

x−39.6623

1.40794

2

– p. 11/17

slide-12
SLIDE 12

Networks exhibiting complexity surplus

Most real-world networks Not Erdös-Renyi networks (obviously) Not networks generated by preferential

attachment

Some evolutionary systems: Eco

Lab, Tierra, but not Webworld

Networks induced by dynamical chaos Networks induced by cellular automata

– p. 12/17

slide-13
SLIDE 13

Inducing a network from a dis- crete timeseries

A timeseries X = x0, x1, . . . , xN, where

xi ∈ X ⊂ Z

Construct a network with |N| nodes. Link weights wij are given by the number of

transitions between xi and xj in X.

– p. 13/17

slide-14
SLIDE 14

Example: Lorenz system

˙ x = σ(y − x) ˙ y = x(ρ − z) − y ˙ z = xy − βz

– p. 14/17

slide-15
SLIDE 15

Dynamical Chaos results

Dataset nodes links

C

eln CER

C − eln CER

| ln C−ln CER|

σER

celegansneural 297 2345 442.7 251.6 191.1 29 PA1 100 99 98.9 85.4 13.5 2.5 Lorenz 8000 62 560.2 56.0 504.2 58.3 Hénon-Heiles 10000 31 342.0 57.3 284.7 55.6

– p. 15/17

slide-16
SLIDE 16

1D cellula automata

– p. 16/17

slide-17
SLIDE 17

1D CA results

100 200 300 400 500 600 700 800 900 1000 0.2 0.4 0.6 0.8 1 bits λ C

r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s r s

eln CER

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

– p. 17/17