# assortativity_degree igraph

Hi,

Please I would like some help.
Could you explain me or indicate an example of how function assortativity_degree() compute the assortativity for directed graphs? In this cases ( graphs are directed) what kind node connections are been considered ( ‘in’ to node / ‘out’ from node )? Is there a correct way use the function in R? I could not found examples for directed graphs.

Tks.

Marcelo

Take each u \rightarrow v directed edge, and write down the out-degree d^\text{out}_u in a first column and in-degree d^\text{in}_v in a second. Then compute the Pearson correlation of the two columns you got. This is the directed degree assortativity.

For more details, see igraph Reference Manual and the references within.

Thank you very much!!!