Synthetic generation of social network data with endorsements
H Pérez-Rosés and
F Sebé
Journal of Simulation, 2015, vol. 9, issue 4, 279-286
Abstract:
In many simulation studies involving networks there is the need to rely on a sample network to perform the simulation experiments. In many cases, real network data is not available due to privacy concerns. In that case we can recourse to synthetic data sets with similar properties to the real data. In this paper we discuss the problem of generating synthetic data sets for a certain kind of online social network, for simulation purposes. Some popular online social networks, such as LinkedIn and ResearchGate, allow user endorsements for specific skills. For each particular skill, the endorsements give rise to a directed subgraph of the corresponding network, where the nodes correspond to network members or users, and the arcs represent endorsement relations. Modelling these endorsement digraphs can be done by formulating an optimization problem, which is amenable to different heuristics. Our construction method consists of two stages: The first one simulates the growth of the network, and the second one solves the aforementioned optimization problem to construct the endorsements.
Date: 2015
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1057/jos.2014.29 (text/html)
Access to full text is restricted to subscribers.
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:taf:tjsmxx:v:9:y:2015:i:4:p:279-286
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjsm20
DOI: 10.1057/jos.2014.29
Access Statistics for this article
Journal of Simulation is currently edited by Christine Currie
More articles in Journal of Simulation from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().