# degree_assortativity_coefficient¶

degree_assortativity_coefficient(G, x='out', y='in', weight=None, nodes=None)[source]

Compute degree assortativity of graph.

Assortativity measures the similarity of connections in the graph with respect to the node degree.

Parameters: G (NetworkX graph) x (string (‘in’,’out’)) – The degree type for source node (directed graphs only). y (string (‘in’,’out’)) – The degree type for target node (directed graphs only). weight (string or None, optional (default=None)) – The edge attribute that holds the numerical value used as a weight. If None, then each edge has weight 1. The degree is the sum of the edge weights adjacent to the node. nodes (list or iterable (optional)) – Compute degree assortativity only for nodes in container. The default is all nodes. r – Assortativity of graph by degree. float

Examples

>>> G=nx.path_graph(4)
>>> r=nx.degree_assortativity_coefficient(G)
>>> print("%3.1f"%r)
-0.5