Evolving complex networks with conserved clique distributions

Hybrid evolving clique-networks and their communicability

Aiming to understand real-world hierarchical networks whose degree distributions are neither power law nor exponential, we construct a hybrid clique network that includes both homogeneous and inhomogeneous parts, and introduce an inhomogeneity parameter to tune the ratio between the homogeneous part and the inhomogeneous one. We perform Monte-Carlo simulations to study various properties of such a network, including the degree distribution, the average shortest-path-length, the clustering coefficient, the clustering spectrum, and the communicability.

Evolving small-world scale-free networks consist of cliques

We present a family of scale-free network model consisting of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and numerically. The obtained analytical solutions show that the networks follow a power-law degree distribution, with degree exponent continuously tuned between 2 and 3. The exact expression of clustering coefficient is also provided for the networks. Furthermore, the investigation of the average path length reveals that the networks possess small-world feature. Interestingly, we find that a special case of our model can be …

Evolving networks by merging cliques

We propose a model for evolving networks by merging building blocks represented as complete graphs, reminiscent of modules in biological system or communities in sociology. The model shows power-law degree distributions, power-law clustering spectra and high average clustering coefficients independent of network size. The analytical solutions indicate that a degree exponent is determined by the ratio of the number of merging nodes to that of all nodes in the blocks, demonstrating that the exponent is tunable, and are also applicable when the blocks are classical networks such as Erdős-Rényi or…

演化团簇网络精确解：基于年龄分辨消息传递的增删模型

Exact solutions for models of evolving clustered networks with addition and deletion via age-resolved message passing

本文提出基于块图的网络演化模型，通过添加m-团和删除顶点，推导出联合度分布主方程的精确闭式解，并利用年龄分辨消息传递获得巨连通分量和渗流阈值，推广了现有模型至任意更替率。

Structure dynamics of evolving scientific networks

Co-authorship networks have been extensively studied in network science as they pose as a perfect example of how single elements of a system give rise to collective phenomena on an intricate, non-trivial structure of interactions. However, co-authorship networks are, in fact, one-mode projections of original bipartite networks, which we call here scientific networks, where authors are agents connected to artifacts - the papers they have published. Nonetheless, few studies take into account the structure of the original bipartite network to understand and explain the topological properties of t…