Re: [igraph] hierarchical degree

[Gábor Csárdi]

Hi,

after some brief skimming over the paper, to me it seems that the
hierarchical degree of order (h) is just the number of edges in the
(h) order neighborhood of the vertex. Then the brute force way of
calculating it is

hierarchical.degree <- function(graph, order, nodes=V(graph)) {
  sapply(as.vector(nodes), function(x)
ecount(graph.neighborhood(graph, order=order, x)[[1]]))
}

Best,
Gabor

2009/3/26 MATSUDA, Noriyuki <address@hidden>:
> Hello:
>
>  Has anyone tried Costa's algorithm called hierarchical degree which seems
> to be of interest?
>     http://adsabs.harvard.edu/abs/2005cond.mat..4346P
>
>
> MATSUDA, Noriyuki  <Kanji> 松田紀之
>
>
>
>
>
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM