Influence, originality and similarity in directed acyclic graphs
arXiv:1108.3691 · doi:10.1209/0295-5075/96/18004
Abstract
We introduce a framework for network analysis based on random walks on directed acyclic graphs where the probability of passing through a given node is the key ingredient. We illustrate its use in evaluating the mutual influence of nodes and discovering seminal papers in a citation network. We further introduce a new similarity metric and test it in a simple personalized recommendation process. This metric's performance is comparable to that of classical similarity metrics, thus further supporting the validity of our framework.
arXiv comment6 pages, 4 figures
References in corpus (8)
- The structure and function of complex networks
- Link Prediction in Complex Networks: A Survey
- Critical phenomena in complex networks
- Solving the apparent diversity-accuracy dilemma of recommender systems
- Finding Scientific Gems with Google
- Ranking Scientific Publications Using a Simple Model of Network Traffic
- Random graph models for directed acyclic networks
- Random acyclic networks