Simone,
in general it depends what you mean by "close".
Same structural properties? Which structural properties
in particular?
Here are two classic graph theory methods.
If vertices in the two networks stand for the same entities,
then you can take the Hamming distance of their adjacency matrices.
If this is not the case, then you can ask for the minimum number of
edge
removal/addition operations you need to get the second
network from the first. This is a quite difficult problem,
and there is no solution for it in igraph.
Gabor
On Fri, Apr 11, 2008 at 05:45:23PM +0200, Simone Gabbriellini wrote:
Hello,
is there a procedure in igraph that let's you compare two networks
(with the same nodes but different links distribution) to see how
much
they are close each other?
thank you,
Simone
_______________________________________________
igraph-help mailing list
address@hidden
http://lists.nongnu.org/mailman/listinfo/igraph-help
--
Csardi Gabor <address@hidden> UNIL DGM
_______________________________________________
igraph-help mailing list
address@hidden
http://lists.nongnu.org/mailman/listinfo/igraph-help