我很难理解这个图的数量:连通性

average_neighbor_degree返回一个节点id及其average_neighbor_degree:
D-一种字典,由具有平均邻域度值的节点组成.
然而,我不明白average_degree_connectivity是什么?它返回:
用k次表示的字典,它的平均值是连通度.
例如,对于三个图,average_degree_connectivity与average neighbors degree value.的关系如下所示。average neighbors degree value.是什么意思?

average_degree_connectivity代表什么?average_neighbor_degree与average_degree_connectivity的关系如何?发布于 2019-06-17 15:53:14
相反地回答你的问题是有意义的:
v是具有m邻居的顶点。average_neighbor_degree of v就是它的邻居的程度除以m的总和。average_degree_connectivity,这是定义的重要部分:
..。是k次节点的平均最近邻度。因此,对于图中发生的所有不同程度,它给出了所有具有相同度的节点的average_neighbor_degree平均值。它是对具有一定程度的连接节点的度量。
这是许多平均数,我希望这段话能澄清问题2:
import networkx as nx
from collections import defaultdict
G = nx.karate_club_graph()
avg_neigh_degrees = nx.algorithms.assortativity.average_neighbor_degree(G)
deg_to_avg_neighbor_degrees = defaultdict(list)
for node, degree in nx.degree(G):
deg_to_avg_neighbor_degrees[degree].append(avg_neigh_degrees[node])
# this is the same as nx.algorithms.assortativity.average_degree_connectivity(G)
avg_degree_connectivity = {degree: sum(vals)/len(vals) for degree, vals in
deg_to_avg_neighbor_degrees.items()}https://stackoverflow.com/questions/56624273
复制相似问题