Efficient Learning for Decomposing and Optimizing Random Networks

• المؤلفون الرئيسيون: Li, Haidong, Peng, Yijie, Xu, Xiaoyun, Heidergott, Bernd F, Chen, Chun-Hung
• التنسيق: text
• منشور في: Archīum Ateneo 2022
• الموضوعات: Bayesian learning; Random network; Markov chain; Dynamic decomposition; Ranking and selection; Mathematics; Physical Sciences and Mathematics; Statistics and Probability
• الوصول للمادة أونلاين: https://archium.ateneo.edu/gsb-pubs/75; https://doi.org/10.1016/j.fmre.2022.01.018
• المؤسسة: Ateneo De Manila University

In this study, we consider the problem of node ranking in a random network. A Markov chain is defined for the network, and its transition probability matrix is unknown but can be learned by sampling random interactions among nodes. Our objective is to decompose the Markov chain into several ergodic...