[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[igraph] average neighbors' degree on bipartite networks
From: |
Simone Gabbriellini |
Subject: |
[igraph] average neighbors' degree on bipartite networks |
Date: |
Thu, 31 Jan 2013 17:14:29 +0100 |
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
u151 u8 u3 u130 u147 u149 u152
u161 u136 u41
4.875000 4.400000 9.000000 6.666667 5.333333 9.000000 5.666667
4.000000 4.500000 3.500000
u5 u30 u6 u223
5.000000 6.000000 3.000000 3.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] average neighbors' degree on bipartite networks,
Simone Gabbriellini <=