反映超边内成对关系的聚类系数
Clustering Coefficient Reflecting Pairwise Relationships within Hyperedges
AI总结:
本文提出一种新的超图聚类系数,通过将超图转换为加权图来捕捉超边内部的成对关系,解决了现有方法将超边视为独立单元而遗漏节点间聚类模式的问题,并在理论和真实数据集上验证了其有效性。
摘要:
超图是简单图的推广,能够表示超越成对关系的复杂群体交互。聚类系数量化网络中的局部链接密度,已在简单图和超图中得到广泛研究。然而,现有的超图聚类系数将每条超边视为一个独立单元,而不是一组可能相关的节点对的集合,未能捕捉超边内部的成对关系,并错误地为具有有意义聚类模式的节点赋予零值。我们提出了一种新的聚类系数,通过将超图转换为加权图来解决这一根本局限,其中边权根据超边连接反映节点之间的关系强度。我们的定义满足三个关键条件:取值在$[0,1]$范围内、与简单图聚类系数一致、以及有效捕捉超边内部的成对关系——这是现有方法所不具备的能力。在高阶模体上的理论评估表明,我们的定义能正确地为现有定义失效的模体(3阶模体III、IV-a、IV-b)赋值,而在三个真实世界数据集上的实证评估显示出相似的整体聚类趋势,并提供了更细致的测量结果,尤其是对于具有较大超边的超图。所提出的聚类系数能够准确量化复杂网络中的局部密度,揭示现有定义在群体成员关系意味着成员之间存在连接的系统中(如社交社区和合著网络)所遗漏的结构特征。
英文摘要:
Hypergraphs are generalizations of simple graphs that allow for the representation of complex group interactions beyond pairwise relationships. Clustering coefficients quantify local link density in networks and have been widely studied for both simple graphs and hypergraphs. However, existing clustering coefficients for hypergraphs treat each hyperedge as a distinct unit rather than a collection of potentially related node pairs, failing to capture intra-hyperedge pairwise relationships and incorrectly assigning zero values to nodes with meaningful clustering patterns. We propose a novel clustering coefficient that addresses this fundamental limitation by transforming hypergraphs into weighted graphs, where edge weights reflect relationship strength between nodes based on hyperedge connections. Our definition satisfies three key conditions: values in the range $[0,1]$, consistency with simple graph clustering coefficients, and effective capture of intra-hyperedge pairwise relationships -- a capability absent from existing approaches. Theoretical evaluation on higher-order motifs demonstrates that our definition correctly assigns values to motifs where existing definitions fail (motifs III, IV-a, IV-b of order 3), while empirical evaluation on three real-world datasets shows similar overall clustering tendencies with more detailed measurements, especially for hypergraphs with larger hyperedges. The proposed clustering coefficient enables accurate quantification of local density in complex networks, revealing structural characteristics missed by existing definitions in systems where group membership implies connections between members, such as social communities and co-authorship networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。