|
From: | Gábor Csárdi |
Subject: | Re: [igraph] average neighbors' degree on bipartite networks |
Date: | Thu, 31 Jan 2013 13:50:32 -0500 |
Hello List,
I have a question regarding graph.knn() if applied on bipartite
networks. When I calculate this:
graph.knn(g, V(g)[type==FALSE])
$knn
u43 u62 u9 u17 u19 u102 u127
u142 u64 u137
3.750000 4.250000 4.181818 4.571429 5.600000 5.200000 6.000000
5.333333 5.166667 6.000000
what these numbers represents? for each node of set1, I have the
average degree of the nodes in set2?
if yes, is it possible to extend
this concept to check for the average degree of dist-2 neighbors -
i.e. nodes still belonging to set1?
Many thanks,
Simone
--
Simone Gabbriellini, PhD
address@hidden, University of Bologna
mobile: +39 340 39 75 626
email: address@hidden
home: www.digitaldust.it
DigitalBrains srl
Amministratore
mobile: +39 340 39 75 626
email: address@hidden
home: www.digitalbrains.it
_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help
[Prev in Thread] | Current Thread | [Next in Thread] |