Efficient Learning for Selecting Important Nodes in Random Network
In this article, 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 o...
Saved in:
Main Authors: | , , , |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2020
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/gsb-pubs/67 https://ieeexplore.ieee.org/document/9076790 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |
Be the first to leave a comment!