Ranking Silent Nodes in Information Networks: A Quantitative Approach and Applications

This paper overviews recent research findings concerning a new challenging problem in information networks, namely identifying and ranking silent nodes. We present three case studies which show how silent nodes’ behavior maps to different situations in computer networks, online social networks, and...

Full description

Saved in:
Bibliographic Details
Published in:Physics procedia 2015, Vol.62, p.36-41
Main Authors: Interdonato, Roberto, Tagarelli, Andrea
Format: Article
Language:English
Subjects:
collaboration networks
computer networks
eigenvector centrality
ranking
silent-node behavior in information networks
social networks
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper overviews recent research findings concerning a new challenging problem in information networks, namely identifying and ranking silent nodes. We present three case studies which show how silent nodes’ behavior maps to different situations in computer networks, online social networks, and online collaboration networks, and we discuss major benefits in identifying and ranking silent nodes in such networks. We also provide an overview of our proposed approach, which relies on a new eigenvector- centrality graph-based ranking method built on a silent-oriented network model.
ISSN:1875-3892
1875-3892
DOI:10.1016/j.phpro.2015.02.008