核心-外围结构需要网络中的其他东西
Core-periphery structure requires something else in the network
摘要:
一个具有核心-外围结构的网络由密集互连的核心节点组成。社区结构是一种不同的中尺度网络结构,与之相反,核心节点可以连接到外围节点,而外围节点并不密集互连。虽然核心外围结构听起来合理,我们认为,它只是占异构度分布,如果一个分区的网络分为一个单一的核心块和一个单一的外围块,著名的Borgatti-Everett算法和许多后续算法假设。换句话说,有一种强烈的趋势,即高度和低度节点被判断为核心和外围节点,分别。为了讨论超出节点度预期的核心-外围结构(如配置模型所描述的),我们建议需要假设至少一个远离焦点核心-外围结构的节点块,例如不同的核心-外围对,社区或不属于任何中尺度结构的节点。我们提出了一个可扩展的算法来检测网络中的核心和外围对,控制节点的程度的影响。我们使用各种经验网络来说明我们的算法。
英文摘要:
A network with core-periphery structure consists of core nodes that are densely interconnected. In contrast to community structure, which is a different meso-scale structure of networks, core nodes can be connected to peripheral nodes and peripheral nodes are not densely interconnected. Although core-periphery structure sounds reasonable, we argue that it is merely accounted for by heterogeneous degree distributions, if one partitions a network into a single core block and a single periphery block, which the famous Borgatti-Everett algorithm and many succeeding algorithms assume. In other words, there is a strong tendency that high-degree and low-degree nodes are judged to be core and peripheral nodes, respectively. To discuss core-periphery structure beyond the expectation of the node's degree (as described by the configuration model), we propose that one needs to assume at least one block of nodes apart from the focal core-periphery structure, such as a different core-periphery pair, community or nodes not belonging to any meso-scale structure. We propose a scalable algorithm to detect pairs of core and periphery in networks, controlling for the effect of the node's degree. We illustrate our algorithm using various empirical networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。