时序网络中孤立团的枚举
Enumerating Isolated Cliques in Temporal Networks
摘要:
孤立是一个来自集团枚举世界的概念,主要用于建模与外部世界没有太多联系的社区。在这里,如果一个团只有很少的边将其连接到图的其余部分,则该团被认为是孤立的。最近的工作枚举集团在时间网络的动机,我们解除隔离的概念,这种设置。我们发现,时间维度的增加导致六个不同的自然隔离概念。我们的主要贡献是开发的固定参数枚举算法,这六个集团类型采用参数“隔离度”。在实证方面,我们实现和测试这些算法(时间)的社交网络数据,获得令人鼓舞的初步结果。
英文摘要:
Isolation is a concept from the world of clique enumeration that is mostly used to model communities that do not have much contact to the outside world. Herein, a clique is considered isolated if it has few edges connecting it to the rest of the graph. Motivated by recent work on enumerating cliques in temporal networks, we lift the isolation concept to this setting. We discover that the addition of the time dimension leads to six distinct natural isolation concepts. Our main contribution is the development of fixed-parameter enumeration algorithms for five of these six clique types employing the parameter "degree of isolation". On the empirical side, we implement and test these algorithms on (temporal) social network data, obtaining encouraging preliminary results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。