.png){kind=icon}
.png){kind=icon}
Return
Efficient learning for decomposing and optimizing random networks
.png){kind=icon}
OA
AI
DOI：10.1016/j.fmre.2022.01.018.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 classes and select the best node in each ergodic class. We propose a dynamic sampling procedure, which gives a probability guarantee on correct decomposition and maximizes a weighted probability of correct selection of the best node in each ergodic class. Numerical experiment results demonstrate the efficiency of the proposed sampling procedure.
Keywords:
Bayesian learning
Random network
Markov chain
Dynamic decomposition
Ranking and selection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.3
Papers:
1.3K
Citations:
2.6K
Organization
View more organizations