加权网络的互易性
Reciprocity of weighted networks
摘要:
所有类型的网络都是由成对的顶点组成的二元构建块的复杂组合。在有向网络中,二元模式完全由相互作用决定,即形成或避免相互链接的趋势。互惠性对每个网络的动态过程以及诸如模体和社区等结构的出现具有显著的影响。二元互易性已经得到了广泛的研究:加权网络的互易性仍然知之甚少。我们介绍了一种通用的方法,通过定义捕获观察到的模式(从特定于二元组到特定于顶点和网络范围)的量,并引入分析解决的模型(指数随机图类型)。与直觉相反,以前的互惠措施的基础上的相互链接权重的相似性是没有信息的。相比之下,我们的措施可以分类不同的加权网络,跟踪网络的互惠性的时间演变,识别模式。我们表明,在某些网络的本地互惠结构可以推断出从全球之一。
英文摘要:
All types of networks arise as intricate combinations of dyadic building blocks formed by pairs of vertices. In directed networks, the dyadic patterns are entirely determined by reciprocity, i.e. the tendency to form, or to avoid, mutual links. Reciprocity has dramatic effects on every networks dynamical processes and the emergence of structures like motifs and communities. The binary reciprocity has been extensively studied: that of weighted networks is still poorly understood. We introduce a general approach to it, by defining quantities capturing the observed patterns (from dyad-specific to vertex-specific and network-wide) and introducing analytically solved models (Exponential Random Graphs-type). Counter-intuitively, the previous reciprocity measures based on the similarity of the mutual links-weights are uninformative. By contrast, our measures can classify different weighted networks, track the temporal evolution of a networks reciprocity, identify patterns. We show that in some networks the local reciprocity structure can be inferred from the global one.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。