Description :
| This toolbox measures some parameters for graphs representing
complex systems.
This version has the following parameters:
- degree distribution
- average clustering as a function of the node degree
- average neighboring degree as a function of degree
- shell index of nodes (related with 'k-core decomposition')
- We have also implemented a function to load a graph from an ASCII file:
each edge of the graf is represented by a line with the nodes, e.g. a
line "20 45" means that there is an edge between nodes 20 and 45.
This toolbox uses sparse matrices, allowing to work with big structures
without consuming too much memory, and to speed computation.
|
