Dynamically Weighted Clique Evolution Model in Clique Networks

Zhang-Wei Li, Xu-Hua Yang, Feng-Ling Jiang, Guang Chen, Guo-Qing Weng and Mei Zhu

Mathematical Problems in Engineering, 2013, vol. 2013, 1-6

Abstract:

This paper proposes a weighted clique evolution model based on clique (maximal complete subgraph) growth and edge-weight driven for complex networks. The model simulates the scheme of real-world networks that the evolution of networks is likely to be driven by the flow, such as traffic or information flow needs, as well as considers that real-world networks commonly consist of communities. At each time step of a network’s evolution progress, an edge is randomly selected according to a preferential scheme. Then a new clique which contains the edge is added into the network while the weight of the edge is adjusted to simulate the flow change brought by the new clique addition. We give the theoretical analysis based on the mean field theory, as well as some numerical simulation for this model. The result shows that the model can generate networks with scale-free distributions, such as edge weight distribution and node strength distribution, which can be found in many real-world networks. It indicates that the evolution rule of the model may attribute to the formation of real-world networks.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2013/182638.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2013/182638.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:182638

DOI: 10.1155/2013/182638

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().