Labelled Graph Strategic Rewriting for Social Networks
Résumé
We develop an algebraic approach, based on labelled-graph strategic rewriting , for the study of social networks, specifically network generation and propagation mechanisms. This approach sheds a new light on these problems, and leads to new or improved generation and propagation algorithms. We argue that relevant concepts are provided by three ingredients: labelled graphs to represent networks of data or users, rewrite rules to describe concurrent local transformations, and strategies to express control. We show how these techniques can be used to generate random networks that are suitable for social network analysis, simulate different propagation mechanisms, and analyse and compare propagation models by extracting common rules and differences, thus leading to improved algorithms. We illustrate with examples the flexibility of the approach.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...