网络中串扰敏感度的量化与最小化
Quantification and Minimization of Crosstalk Sensitivity in Networks
摘要:
串扰被定义为网络的不同实体之间的一组不必要的交互。在每个系统中,串扰都以不同程度存在,其中信息通过网络的所有单个单元都可以访问的方式传输。使用图论的概念,我们引入了一个可量化的措施,串扰的敏感性,并分析得出的网络结构,它是最小化。结果表明,网络的非均匀度分布是更强大的串扰比相应的均匀网络。我们提供了一种方法来构建的图形与串扰的最小可能的灵敏度,给定其顺序和大小。最后,对于具有固定度序列的网络,我们给出了一个算法,以寻找其顶点之间的最佳互连结构。
英文摘要:
Crosstalk is defined as the set of unwanted interactions among the different entities of a network. Crosstalk is present in various degrees in every system where information is transmitted through a means that is accessible by all the individual units of the network. Using concepts from graph theory, we introduce a quantifiable measure for sensitivity to crosstalk, and analytically derive the structure of the networks in which it is minimized. It is shown that networks with an inhomogeneous degree distribution are more robust to crosstalk than corresponding homogeneous networks. We provide a method to construct the graph with the minimum possible sensitivity to crosstalk, given its order and size. Finally, for networks with a fixed degree sequence, we present an algorithm to find the optimal interconnection structure among their vertices.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。