有向网络中信号流的组织
Organisation of signal flow in directed networks
摘要:
回答网络结构是否以及如何决定网络元素的一致性操作是我们工作的主题。我们映射的结构,在有向网络中的信号流通过分析边缘收敛的程度和边缘的输入和输出集之间的重叠。收敛度和重叠度的定义基于最短路径,因此它们封装了全局网络属性。利用收敛度和重叠集的定义概念,我们阐明了网络因果关系的含义,并证明了无弦圈的关键作用。在现实网络中,流表示根据节点的信号传输、处理和控制属性来区分节点。根据网络节点的已知功能特性,对真实网络进行流表示分析。结果表明,具有不同信号处理、传输和控制特性的节点在全局范围内是随机连接的,而局部连接模式则偏离随机性。根据网络节点的信号流性质来划分网络节点与网络的社团结构无关。我们提出的证据表明,信号流特性的小世界,真实世界的网络不能重建的算法来生成小世界网络。计算了规则定向树的收敛度值,以及优先连接机制下网络的概率密度函数。对于Erdens-Rényi图,我们计算了收敛度和重叠度的概率密度函数。
英文摘要:
Confining an answer to the question whether and how the coherent operation of network elements is determined by the the network structure is the topic of our work. We map the structure of signal flow in directed networks by analysing the degree of edge convergence and the overlap between the in- and output sets of an edge. Definitions of convergence degree and overlap are based on the shortest paths, thus they encapsulate global network properties. Using the defining notions of convergence degree and overlapping set we clarify the meaning of network causality and demonstrate the crucial role of chordless circles. In real-world networks the flow representation distinguishes nodes according to their signal transmitting, processing and control properties. The analysis of real-world networks in terms of flow representation was in accordance with the known functional properties of the network nodes. It is shown that nodes with different signal processing, transmitting and control properties are randomly connected at the global scale, while local connectivity patterns depart from randomness. Grouping network nodes according to their signal flow properties was unrelated to the network's community structure. We present evidence that signal flow properties of small-world-like, real-world networks can not be reconstructed by algorithms used to generate small-world networks. Convergence degree values were calculated for regular oriented trees, and its probability density function for networks grown with the preferential attachment mechanism. For Erdős-Rényi graphs we calculated both the probability density function of convergence degrees and of overlaps.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。