Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
62 views31 pages

Teorija Malog Sveta: Primer Evolucije Matematičkog Modelovanja Realnosti

Uploaded by

PeraKojot

This document discusses random graph theory and small world networks. It describes Paul Erdos and his work on random graphs with Alfred Renyi in the 1950s. It then discusses the properties of random graphs like the clustering coefficient and phase transitions. It introduces the theory of small world networks proposed by Duncan Watts and Steven Strogatz in 1998. It describes measures used to analyze networks like degree, path length, clustering coefficient. It presents models of networks including random graphs, scale-free networks, and the Watts-Strogatz and Barabasi-Albert models. Finally, it mentions examples of biological networks like metabolic networks that are directly relevant to network medicine.

Copyright:

© All Rights Reserved
Download as PPTX, PDF, TXT or read online from Scribd
Download as pptx, pdf, or txt

Teorija Malog Sveta: Primer Evolucije Matematičkog Modelovanja Realnosti

Uploaded by

PeraKojot
62 views31 pages
This document discusses random graph theory and small world networks. It describes Paul Erdos and his work on random graphs with Alfred Renyi in the 1950s. It then discusses the properties of random graphs like the clustering coefficient and phase transitions. It introduces the theory of small world networks proposed by Duncan Watts and Steven Strogatz in 1998. It describes measures used to analyze networks like degree, path length, clustering coefficient. It presents models of networks including random graphs, scale-free networks, and the Watts-Strogatz and Barabasi-Albert models. Finally, it mentions examples of biological networks like metabolic networks that are directly relevant to network medicine.

Original Description:

Metodologija

Original Title

TEORIJA MALOG SVETA

Copyright

© © All Rights Reserved

Available Formats

PPTX, PDF, TXT or read online from Scribd

Did you find this document useful?

Is this content inappropriate?

This document discusses random graph theory and small world networks. It describes Paul Erdos and his work on random graphs with Alfred Renyi in the 1950s. It then discusses the properties of random graphs like the clustering coefficient and phase transitions. It introduces the theory of small world networks proposed by Duncan Watts and Steven Strogatz in 1998. It describes measures used to analyze networks like degree, path length, clustering coefficient. It presents models of networks including random graphs, scale-free networks, and the Watts-Strogatz and Barabasi-Albert models. Finally, it mentions examples of biological networks like metabolic networks that are directly relevant to network medicine.

Copyright:

© All Rights Reserved
Download as PPTX, PDF, TXT or read online from Scribd
Download as pptx, pdf, or txt
62 views31 pages

Teorija Malog Sveta: Primer Evolucije Matematičkog Modelovanja Realnosti

Uploaded by

PeraKojot
This document discusses random graph theory and small world networks. It describes Paul Erdos and his work on random graphs with Alfred Renyi in the 1950s. It then discusses the properties of random graphs like the clustering coefficient and phase transitions. It introduces the theory of small world networks proposed by Duncan Watts and Steven Strogatz in 1998. It describes measures used to analyze networks like degree, path length, clustering coefficient. It presents models of networks including random graphs, scale-free networks, and the Watts-Strogatz and Barabasi-Albert models. Finally, it mentions examples of biological networks like metabolic networks that are directly relevant to network medicine.

Copyright:

© All Rights Reserved
Download as PPTX, PDF, TXT or read online from Scribd
Download as pptx, pdf, or txt
You are on page 1/ 31

TEORIJA MALOG SVETA

PRIMER EVOLUCIJE MATEMATIČKOG


MODELOVANJA REALNOSTI

Milan Milosavljević
Univerzitet Singidunum, Beograd
SLUČAJNI GRAFOVI
• Paul Erdős (1913 – 1996)
• Matematika je pretvaranje kafe u teoreme
• Posle Ojlera jedan od najplodnijih
matematičara – preko 1500 radova
• Osam radova sa Alfredom Renijem o slučajnim
grafovima
• Erdošev broj, najverovatnije uveden prvi put
od Casper Goffmana
SLUČAJNI GRAFOVI
• Erdošev broj 0 – sam Erdoš
• Erdošev broj 1 – svi oni koji su bili koautori na
njegovim radovima
• Erdošev broj 2 – svi oni koji su pisali sa
Erdoševim koautorima i td...
• Preko 200 000 matematičara ima Erdošev broj
• Oko 90% aktivnih matematičara danas ima
Erdošev broj manji od 8
SLUČAJNI GRAFOVI

Paul Erdős (1913 – 1996) Alfréd Rényi (1921-1970)


SLUČAJNI GRAFOVI
SLUČAJNI GRAFOVI
• Tranzijentna svojstva (phase trasition):
• Za z >= 1 , dolazi do pojave globalno
konektovanog grafa
• Za z < 1, graf je nepovezan
• Koeficijent klasterovanja : prosečna
verovatnoća da dva susedna čvora
posmatranog čvora su istovremeno i
medjusobno susedni
SLUČAJNI GRAFOVI
• Za slučajne grafove koeficijent klasterovanja je
• C=p, odnosno C=z/n
• Odavde sledi da slučajni grafovi nemaju
izraženo svojstvo grupisanja, budući da je u
njima C tipično vrlo malo.
SLUČAJNI GRAFOVI
TEORIJA MALOG SVETA

Objavljeno u časopisu
Nature 393, 440-442, 1998. godine
TEORIJA MALOG SVETA

Duncan Watts Steven Strogatz


MERE NAD MREŽAMA
Degree (or connectivity k):
1. How many links the node has to other nodes
2. Average degree k = 2L/N in an undirected network with N nodes
and L links

Degree distribution p(k):


1. Probability that a selected node has exactly k links
2. In a random network, there are no highly connected nodes(hub).
In a power-law degree distribution, a few hubs hold together
numerous small nodes
Scale-free networks:
1. The degree distribution approximates a power law, P(k) ~ k^(-r)
where r is the degree exponent
2. The smaller the value of r, the more important the role of the
hubs is in the network. For r>3 the hub are not relevant and for
2>r>3 there is a hierarchy of hubs.
MERE NAD MREŽAMA
Path length:
1. How many links we need to pass through to travel between two
nodes
2. Mean path length l: the average over the shortest paths between
all pairs of nodes and a measure of a network's overall
navigability.

Clustering coefficient (C):

1. C_i = 2n_i / k(k-1): the number of triangles that go through node i


2. 2. For the many real networks C(k) ~ k^(-1): a network's hierarchical
character

k, l, and C depend on the number of nodes (N) and links


(L). P(k) and C(k) functions are independent of the
network's size and they capture a network's generic
features.
MERE NAD MREŽAMA

Network measures
MODELI MREŽA

• Random networks: Poisson distribution in the node


degrees

• Scale-free networks: power-law degree distribution

• Hierarchical networks: local clustering and scale-free


topology
TEORIJA MALOG SVETA
Watts-Strogatz (WS) Model
Watts-Strogatz (WS) Model

Small world model : M. E. J. Newman, "The Structure and Function of Complex


Networks," SIAM Review, Vol. 45, No. 2, pp. 209.
Watts-Strogatz (WS) Model
Watts-Strogatz (WS) Model
Barabasi-Albert (BA) Model

- Scale-free power-law distribution


- Growth: new vertices are added over time
- Preferential attachment : the highly connected
vertices likely receive new links
- Self-organization of system
Barabasi-Albert (BA) Model

Barabási Albert-László
Barabasi-Albert (BA) Model
Barabasi-Albert (BA) Model
PRIMERI BIOLOŠKIH MREŽA
METABOLIČKE MREŽE
Mreže od
direktne
važnosti za
mrežnu
medicinu

You might also like