Redes Complexas Aula 3

Auladehoje Aulapassada Caracterizandoredes Caractersticasde redesreais grandes Centralidadede Grau vrtices Distncias Betweeness,Closeness Clusterizao
Figueiredo 2011

Trs Importantes Caractersticas

Observed in various real networks
beginning of modern empirical studies (98, 99)

Small world effect

My friends are also friends effect

Down with democracy effect

Figueiredo 2011

Small World
It's a small world, after all Average distance is very small, diameter is also small Even for very large networks Web 2x108 nodes Collaboration network 106 nodes Global social network - 109 nodes six degrees of separation and many, many others networks! 7.5 4.9 6

Orders of magnitude smaller, seems logarithmic

Figueiredo 2011

My Friends are Also Friends

If A is related to B and C, then B and C are much more likely to be related Triangles tend to form in networks high clustering coefficient Density: # edges / # nodes = chance of two nodes being related AS Graph: density 0.00056 Neural net C. Elegans: density 0.05 Biology coauthorship: density 0.00001 0.39 0.28 0.67
Figueiredo 2011

Orders of magnitude larger!

Down with Democracy Node degree is very unequal

Many have small degree, few have very large degree Similar to wealth distribution! AS Graph 104 nodes
avg degree: 5.9 Max degree: ~2100 Citations 106 nodes Avg degree: 8.6 Max degree: ~9000

Degree distribution is heavy tail Spans several orders of magnitude Well modeled by power laws in some cases
Figueiredo 2011

Curiosity and Knowledge

Fact I: Many networks have peculiar structural properties (characteristics not expected) Degree, distances, clustering, etc Fact II: Many different networks have similar structural properties Web, Facebook, AS Graph, Neural network, etc.

Million dollar question

Why?
Some answers, but in large we are still trying to understand it
Figueiredo 2011

Why this Network Structure? formation Structure as a result of network

Evolution in biological networks (eg. your brain) Optimizations in man made network (eg. Internet)

But what are is being optimized?

Desirable network functions, desirable network properties (implicitly or explicitly)

Network function

determines influences

Network structure

Co-evolution of function and structure!

Figueiredo 2011

Centralidade
Como medir a importncia de um vrtice?
Utilizando apenas a estrutura
Grau do vrtice Betweeness Closeness Autovetor Random walks etc. Mtricas locais dependem apenas da vizinhana do vrtice (Ex. grau) Mtrica globais Dependem do grafo inteiro (Ex. Closeness)

Figueiredo 2011

Centralidade de Grau
Grau do vrtice Grau do vrtice normalizado
valor entre 0 e 1

dv C v= n1

Grafo direcionado, grau de entrada/sada

Duas centralidades em grau por vrtice

Figueiredo 2011

Centralidade de Betweeness
Considerar todos os caminhos mnimos do grafo Nmero de caminhos mnimos que passam pelo vrtice Exemplo
1 2 3

Grafo completo, Kn? Grafo estrela, com n folhas?

Figueiredo 2011

Centralidade de Betweeness
Problema: Como definir mtrica quando mais de um caminho mnimo existe entre um par origem/destino? empate no custo do caminho mnimo Exemplo
1 2

Caminho mnimo entre 2 e 4? 2,1,4 ou 2,3,4? Centralidade do vrtice 1 e 3?

Figueiredo 2011

Centralidade de Betweeness
Duas abordagens Cada caminho mnimo conta 1 vez Carga dividida pelos caminhos mnimos (cada caminho mnimo conta 1/k para a mtrica, para k caminhos) Exemplo
B1 = 1 B1 = 0.5 1 2

Para muitas redes, diferena pequena Mas nem sempre!

Figueiredo 2011

Calculando Betweeness
Mais precisamente
C v=

s , t V ; s , t v

v s , t s , t

Nmero de caminhos mais curtos entre s e t que passam por v

ou
C v=
s , t V

v s ,t

Nmero de caminhos mais curtos entre s e t

Pode ser normalizada pelo nmero total de pares origem/destino (sem contar v)
mtrica entre 0 e 1
Figueiredo 2011

Exemplo
Cores indicam betweeness Vermelho = 0, azul = mximo Ilustra vrtices mais centrais

Figueiredo 2011

Centralidade de Closeness
Utiliza noes de distancia
com ou sem pesos

Distancia mdia entre vrtice e o resto do grafo

capturar o quo central o vrtice

C v=

t V {v}

d v , t n1

Velocidade com a qual informao se propara de um vrtice para o resto da rede

Figueiredo 2011

Centralidade de Closeness
Outras definies Maior distancia a qualquer outro vrtice do grafo
ecentricidade (eccentricity) do vrtice

C v =maxt V {v } d v , t

Figueiredo 2011