c09_netw_mod

# c09_netw_mod - Network models Properties common to many...

This preview shows pages 1–10. Sign up to view the full content.

Network models Properties common to many large-scale networks, independently of their origin and function: 1. The degree and betweenness distribution are decreasing functions, usually power-laws. 2. The distances scale logarithmically with the network size scale - free k log N log l small world 3. The clustering coefficient does not seem to depend on the network size, and is larger than the clustering coefficient of omparable random graphs comparable random graphs There are two model families proposed to explain these properties: Small world network models and scale-free network models.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Benchmark 1: regular lattices One-dimensional lattice: const C const k N l = = , , 2 / 1 Two-dimensional lattice: N L l nodes inside for const. = = 6 k nodes inside for const. = = 15 6 C The average path-length varies as D N l / 1 D-dimensional lattice: Constant degree (coordination number), constant clustering coefficient.
Benchmark 2: random graph theory Erdös-Rényi algorithm - Publ. Math. Debrecen 6, 290 (1959) fixed node number N onnecting pairs of nodes • connecting pairs of nodes with probability p N log k 1 N k k 1 N rand ) p 1 ( p C ) k ( P Expected degree distribution: xpected clustering coefficient: Expected path length: k log l rand k Expected clustering coefficient: N p C rand = =

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Path length and order in real networks k log N log l rand = N k C rand = Real networks have short distances like random graphs yet show signs of local order.
Small-world networks Real networks resemble both regular lattices and random graphs – perhaps they are in between. Watts-Strogatz model - D. Watts, S. Strogatz, Nature 393, 440 (1998) lattice with K neighbors • rewire edges with robability probability p , K 2 N l = ) 1 K ( 4 ) 2 K ( 3 C = , K log N log l N K C Is there a regime with small l and large C?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Transition from a lattice to a small world lattice small world random There is a broad interval of p over which but ) 0 ( ) ( C p C ) 1 ( ) ( l p l
The onset of the small-world behavior depends on the system size ) pKN ( f K N ) p , N ( l d / 1 d is the dimension of the lattice nst < ttice e = ) u ( f 1 u const << if 1 u u / u ln >> if lattice - like random graph - like The transition point depends on the rewiring probability, the size of the network and the average degree. 3 ) p 1 )( 0 ( C ) p ( C = These results cannot be directly compared to most real networks ecause the rewiring probability not known. because the rewiring probability p is not known.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
egree distribution of a small- orld Degree distribution of a small world network Rewiring does not change the average degree, but modifies the degree distribution. P(k) depends on the rewiring parameter p, but is K k = always centered around <k>. Degree distribution similar to that of a random graph, with exponentially small probability for very highly connected nodes .
Ex. 1 A variant of the Watts-Strogatz model adds random edges to a regular lattice. Start with a 1D lattice where every node has degree K . For each existing edge of a node, add an edge with a probability

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This document was uploaded on 03/01/2011.

### Page1 / 35

c09_netw_mod - Network models Properties common to many...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online