Optimizing the Constrained Estimate of Random Walks
Rong Zhou, Yong Zhang, Li Ning
IEEE Access · 2018
doi:10.1109/access.2018.2873369 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
We introduce the problem of optimizing the constrained estimate of random walks on the probability networks (which are formally defined as the weighted directed graphs in which the total outgoing weight of any node is at most 1). In this problem, it is required to find the size-constrained set of nodes, which maximized the hitting probability (before the time limit) of the randomly initialized random walk. The problem is proved NP-Hard, and we propose an algorithm with polynomial time complexity and constant approximation ratio.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.