Hello Tiago, 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?
Best, Philipp -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/Scalar-Assortativity-Definition-tp4026930.html Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com. _______________________________________________ graph-tool mailing list [email protected] https://lists.skewed.de/mailman/listinfo/graph-tool
