Dynamic Sampling Procedure for Decomposable Random Networks
This research studies the problem of node ranking in a random network. Specifically, we consider a Markov chain with several ergodic classes and unknown transition probabilities which can be estimated by sampling. The objective is to select all of the best nodes in each ergodic class. A sampling pro...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2019
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/gsb-pubs/65 https://ieeexplore.ieee.org/abstract/document/9004795 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |