Ghislain Romaric MELEU ; Paulin MELATAGIA YONTA - Growth model for collaboration networks

arima:1447 - Revue Africaine de Recherche en Informatique et Mathématiques Appliquées, February 16, 2017, Volume 24 - 2017 - Special issue CRI 2015 -
Growth model for collaboration networksArticle

Authors: Ghislain Romaric MELEU ; Paulin MELATAGIA YONTA

    We propose a model of growing networks based on cliques formations. A clique is used to illustrate for example co-authorship in co-publication networks, co-occurence of words or collaboration between actors of the same movie. Our model is iterative and at each step, a clique of λη existing vertices and (1 − λ)η new vertices is created and added in the network; η is the mean number of vertices per clique and λ is the proportion of old vertices per clique. The old vertices are selected according to preferential attachment. We show that the degree distribution of the generated networks follows the Power Law of parameter 1 + 1/ λ and thus they are ultra small-world networks with high clustering coefficient and low density. Moreover, the networks generated by the proposed model match with some real co-publication networks such as CARI, EGC and HepTh.

    Volume: Volume 24 - 2017 - Special issue CRI 2015
    Published on: February 16, 2017
    Accepted on: January 31, 2017
    Submitted on: February 15, 2017
    Keywords: Structural property, Preferential Attachment, Random graph, Collaborative Network,Social Network Analysis,Analyse des réseaux sociaux, Réseau de collaboration, Graphe aléatoire, Attachement préféntiel, Propriété structurelle,[INFO.INFO-SI] Computer Science [cs]/Social and Information Networks [cs.SI],[INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation

    1 Document citing this article

    Consultation statistics

    This page has been seen 641 times.
    This article's PDF has been downloaded 683 times.