arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.07525cs.SIcs.LGphysics.soc-phstat.ML
收藏

网络中层次社区的可检测性

Detectability of hierarchical communities in networks

Department of Data Analytics and Digitalisation, School of Business and Economics, Maastricht University(数据分析与数字化学院,经济学院,马斯特里赫特大学);Department of Computer Science, RWTH Aachen University(计算机科学系,亚琛工业大学)

Leto Peel, Michael T. Schaub

AI总结:

该研究聚焦网络层次划分结构的恢复问题,发现层次场景下存在额外相变阶段,多个一致划分可促进或阻碍检测,非层次划分的可检测极限不足以反映完整层次结构的可检测性,并用构造示例验证了该结论。

摘要:

我们研究了恢复网络中植入的层次划分结构的问题。此前研究已详细分析了单个植入划分的可检测性,并确定了一个相变点:当处于该相变点以下时,划分无法被检测到。本文表明,在层次场景下存在额外的相变阶段,在这些阶段中,多个一致划分的存在可能会促进或阻碍检测。因此,非层次划分的可检测极限通常无法提供完整层次结构可检测性的足够信息,我们通过多个构造性示例阐明了这一点。

英文摘要:

We study the problem of recovering a planted hierarchy of partitions in a network. The detectability of a single planted partition has previously been analysed in detail and a phase transition has been identified below which the partition cannot be detected. Here we show that, in the hierarchical setting, there exist additional phases in which the presence of multiple consistent partitions can either help or hinder detection. Accordingly, the detectability limit for non-hierarchical partitions typically provides insufficient information about the detectability of the complete hierarchical structure, as we highlight with several constructive examples.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑