arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.09602physics.soc-phcs.SI
收藏

复杂网络的延展性

Malleability of complex networks

Filipi N. Silva, Cesar H. Comin, Luciano da F. Costa

摘要:

大多数复杂网络不是静态的,而是随着时间的推移而发展。给定一个这样的变化网络的特定配置,量化其拓扑结构可能展开的多样性就成为一个特别有趣的问题。在这项工作中,我们提出了网络延展性的概念,它被定义为相对于给定配置的每个可能的展开的概率的熵的指数。我们计算的延展性相对于所涉及的拓扑结构的具体测量。更具体地说,我们确定了从给定配置导出的可能拓扑,并计算了它们的一些拓扑度量(例如,聚类系数,最短路径长度,重复性等),导致相应的概率与每个可能的测量值相关联。虽然这种方法意味着从拓扑到测量空间的映射中存在一定程度的退化,但它仍然为推断特定网络类型相对于给定拓扑测量的延展性铺平了道路。我们报告说,延展性,在一般情况下,取决于每个特定的测量,平均最短路径长度和程度的延展性通常会导致大的延展性值。维基百科网络的延展性最大,Watts-Strogatz模型的延展性最小。

英文摘要:

Most complex networks are not static, but evolve along time. Given a specific configuration of one such changing network, it becomes a particularly interesting issue to quantify the diversity of possible unfoldings of its topology. In this work, we suggest the concept of malleability of a network, which is defined as the exponential of the entropy of the probabilities of each possible unfolding with respect to a given configuration. We calculate the malleability with respect to specific measurements of the involved topologies. More specifically, we identify the possible topologies derivable from a given configuration and calculate some topological measurement of them (e.g. clustering coefficient, shortest path length, assortativity, etc.), leading to respective probabilities being associated to each possible measurement value. Though this approach implies some level of degeneracy in the mapping from topology to measurement space, it still paves the way to inferring the malleability of specific network types with respect to given topological measurements. We report that the malleability, in general, depends on each specific measurement, with the average shortest path length and degree assortativity typically leading to large malleability values. The maximum malleability was observed for the Wikipedia network and the minimum for the Watts-Strogatz model.

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

↑