arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.05103cs.SIcs.DMmath.CO
收藏

确定性层次网络

Deterministic hierarchical networks

L. Barrière, F. Comellas, C. Dalfó, M. A. Fiol

摘要:

研究表明,许多与复杂系统相关的网络都是小世界的(它们既有很大的局部聚集系数,又有很小的直径),而且它们也是无标度的(度是按照幂律分布的)。此外,这些网络通常是分层的,因为它们描述了所建模系统的模块化。复杂网络的研究大多基于随机方法。然而,一个确定性的方法,与一个准确的测定的主要相关参数的网络,已被证明是有用的。事实上,这种方法补充和增强了概率和模拟技术,因此,它提供了一个更好的理解系统建模。在本文中,我们发现的半径,直径,聚类系数和度分布的一般家庭的确定性分层小世界无标度网络,已被认为是模拟现实生活中的复杂系统。

英文摘要:

It has been shown that many networks associated with complex systems are small-world (they have both a large local clustering coefficient and a small diameter) and they are also scale-free (the degrees are distributed according to a power law). Moreover, these networks are very often hierarchical, as they describe the modularity of the systems that are modeled. Most of the studies for complex networks are based on stochastic methods. However, a deterministic method, with an exact determination of the main relevant parameters of the networks, has proven useful. Indeed, this approach complements and enhances the probabilistic and simulation techniques and, therefore, it provides a better understanding of the systems modeled. In this paper we find the radius, diameter, clustering coefficient and degree distribution of a generic family of deterministic hierarchical small-world scale-free networks that has been considered for modeling real-life complex systems.

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

↑