Labelled Graph Strategic Rewriting for Social Networks

Abstract : We propose an algebraic and logical approach to the study of social networks, where network components and processes are directly defined by labelled port graph strategic rewriting. Data structures attached to graph elements (nodes, ports and edges) model local and global knowledge in the network, rewrite rules express elementary and local transformations , and strategies control the global evolution of the network. We show how this approach can be used to generate random networks, simulate existing propagation and dissemination mechanisms, and design new, improved algorithms.
Liste complète des métadonnées

Cited literature [51 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01664593
Contributor : Bruno Pinaud <>
Submitted on : Friday, December 15, 2017 - 8:12:31 AM
Last modification on : Thursday, April 19, 2018 - 2:24:03 PM

File

jlamp.pdf
Files produced by the author(s)

Identifiers

Citation

Maribel Fernandez, Hélène Kirchner, Bruno Pinaud, Jason Vallet. Labelled Graph Strategic Rewriting for Social Networks. Journal of Logical and Algebraic Methods in Programming, Elsevier, 2018, 96 (C), pp.12--40. ⟨10.1016/j.jlamp.2017.12.005⟩. ⟨hal-01664593⟩

Share

Metrics

Record views

297

Files downloads

142