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

Abstract

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.