Efficient Sampling for Selecting Important Nodes in Random Network

11 Jan 2019 Li Haidong Xu Xiaoyun Peng Yijie Chen Chun-Hung

We consider the problem of selecting important nodes in a random network, where the nodes connect to each other randomly with certain transition probabilities. The node importance is characterized by the stationary probabilities of the corresponding nodes in a Markov chain defined over the network, as in Google's PageRank... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • METHODOLOGY
  • SOCIAL AND INFORMATION NETWORKS