I have a quick question about how the scalar assortativity is calculated.
You reference "M. E. J. Newman, “Mixing patterns in networks”, Phys. Rev. E
67, 026126 (2003)" as source for the equation. In the paper the equation
seems to consider edges connecting nodes of indegree x to those of outdegree
y (or rather "j" and "k"). In your implementation I am able to choose
in-degree, out-degree or total as degree type. What does this do to the
equation? If I choose, say, "in", will that mean the algorithm will look at
edges connecting nodes of indegree x to those of indegree y? If so, is there
a way for me to find the assortativity as per the definition in the paper?
Could I follow up on this again for clarification? I have also come across
this paper "Assortative mixing in directed biological networks", M.
Piraveenan et al., DOI: 10.1109/TCBB.2010.80 which describes an
assortativity coefficient which would perhaps match the description in the
manual.
I am quite happy with the current implementation though can file a feature
request if you would like me to. What I am mostly after is the definition of
the actual equation used so I can cite it as the paper cited in the manual
doesn't contain the equation that seems to be used as far as I can tell.
Hence my question if it comes from dx.doi.org/10.1109/TCBB.2010.80 which
seems to use an equation that does what you are describing.