Shortest Path Discovery in the Multi-layered Social Network
arXiv:1210.5180 · doi:10.1109/ASONAM.2011.67
Abstract
Multi-layered social networks consist of the fixed set of nodes linked by multiple connections. These connections may be derived from different types of user activities logged in the IT system. To calculate any structural measures for multi-layered networks this multitude of relations should be coped with in the parameterized way. Two separate algorithms for evaluation of shortest paths in the multi-layered social network are proposed in the paper. The first one is based on pre-processing - aggregation of multiple links into single multi-layered edges, whereas in the second approach, many edges are processed 'on the fly' in the middle of path discovery. Experimental studies carried out on the DBLP database converted into the multi-layered social network are presented as well.
This is an extended version of the paper ASONAM 2011, IEEE Computer Society, pp. 497-501 DOI 10.1109/ASONAM.2011.67
References in corpus (6)
- Fast unfolding of communities in large networks
- Community structure in social and biological networks
- The structure of scientific collaboration networks
- Classes of behavior of small-world networks
- Multidimensional Social Network in the Social Recommender System
- Email as Spectroscopy: Automated Discovery of Community Structure within Organizations
Cited by in corpus (7)
- Multilayer Networks
- The structure and dynamics of multilayer networks
- Analysis of Neighbourhoods in Multi-layered Dynamic Social Networks
- A Method for Group Extraction and Analysis in Multilayer Social Networks
- Multi-layered Social Networks
- Exploiting all phone media? A multidimensional network analysis of phone users' sociality
- A Method for Geodesic Distance on Subdivision of Trees with Arbitrary Orders and Their Applications