| | |
Summary: Network models random graphs
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 logarithmicall ith the net ork si e2. The distances scale logarithmically with the network size
klog
Nlog
l
3. The clustering coefficient does not seem to depend on the
network size
As though all these networks were part of the same family/class.
kC
g p y
Random networks
The average distance and clustering coefficient only depend on the
number of nodes and edges in the network.
This suggests that general models based only on the number of
nodes and edges in the network could be successful in describing
the properties of an "expected" (characteristic) networkthe properties of an expected (characteristic) network.
|
