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: | Li, Haidong, Xu, Xiaoyun, Peng, Yijie, Chen, Chun-Hung |
---|---|
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 |
Similar Items
-
Efficient Learning for Decomposing and Optimizing Random Networks
by: Li, Haidong, et al.
Published: (2022) -
Adaptive Control of Uncertain Constrained Nonlinear Systems
by: TEE KENG PENG
Published: (2010) -
Adaptive Region Reaching Control of Fully Actuated Ocean Surface Vessels
by: xiaoming sun, et al.
Published: (2021) -
Aircraft-on-ground path following control by dynamical adaptive backstepping
by: Chen, B., et al.
Published: (2014) -
Barrier Lyapunov Functions for the control of output-constrained nonlinear systems
by: Tee, K.P., et al.
Published: (2014)