Re: [igraph] degree correlation matrix that relies on (arbitrary) node values

[Hermann Norpois]

I want a matrix (like the degree correlation matrix) with the  probabilities of finding
a node with y-value i and j at the two ends of a randomly selected link. I guessed that this is somehow similar to a degree correlation matrix but instead of the node degrees I use the y-values of gg.

I called it 'degree correlation matrix' because the node values do not rely on the degrees of the node.

Thanks Hermann

2015-10-07 10:37 GMT+02:00 Gábor Csárdi <address@hidden>:

What is a "degree correlation matrix"?

Gabor

On Wed, Oct 7, 2015 at 9:33 AM, Hermann Norpois <address@hidden> wrote:
> Hello,
>
> I want to generate a 'degree correlation matrix' according to node values y
> that do not rely on the degree of the nodes.
> My toy example:
>
> gg <- erdos.renyi.game (10,0.7)
> V(gg)$y <- sample (5,10, replace=TRUE)
>
> I started with ...
> edges.gg <- get.edgelist (gg)
> mat.y <- matrix (V(gg)$y[edges.gg[,1]], V(gg)$y[edges.gg[,2]], nrow=length
> (V(gg)$y[edges.gg[,1]]), ncol=2)
>
> ... to get the combinations of y values that exist in gg but I dont know how
> to measure the frequencies. And I did not find a tool in igraph to construct
> such a 'degree correlation matrix'.
>
> Has anybody an idea?
> Thanks
> Hermann
>

> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>

_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help