Optimizing the Constrained Estimate of Random Walks

Optimizing the Constrained Estimate of Random Walks

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 no...

Full description

Bibliographic Details
Main Authors: Rong Zhou, Yong Zhang, Li Ning
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Network theory (graphs)
computational complexity
optimization
Online Access:https://ieeexplore.ieee.org/document/8478781/
id doaj-8d29bc735c7e49c0872b7d1dda8920ba
record_format Article
spelling doaj-8d29bc735c7e49c0872b7d1dda8920ba2021-03-29T21:40:26ZengIEEEIEEE Access2169-35362018-01-016586825868610.1109/ACCESS.2018.28733698478781Optimizing the Constrained Estimate of Random WalksRong Zhou0https://orcid.org/0000-0002-8527-0020Yong Zhang1Li Ning2Chinese Academy of Sciences, Shenzhen Institutes of Advanced Technology, Shenzhen, ChinaChinese Academy of Sciences, Shenzhen Institutes of Advanced Technology, Shenzhen, ChinaMaketran (Shenzhen) Techonology Ltd., Shenzhen, ChinaWe 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.https://ieeexplore.ieee.org/document/8478781/Network theory (graphs)computational complexityoptimization
collection DOAJ
language English
format Article
sources DOAJ
author Rong Zhou
Yong Zhang
Li Ning
spellingShingle Rong Zhou
Yong Zhang
Li Ning
Optimizing the Constrained Estimate of Random Walks
IEEE Access
Network theory (graphs)
computational complexity
optimization
author_facet Rong Zhou
Yong Zhang
Li Ning
author_sort Rong Zhou
title Optimizing the Constrained Estimate of Random Walks
title_short Optimizing the Constrained Estimate of Random Walks
title_full Optimizing the Constrained Estimate of Random Walks
title_fullStr Optimizing the Constrained Estimate of Random Walks
title_full_unstemmed Optimizing the Constrained Estimate of Random Walks
title_sort optimizing the constrained estimate of random walks
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2018-01-01
description 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.
topic Network theory (graphs)
computational complexity
optimization
url https://ieeexplore.ieee.org/document/8478781/
work_keys_str_mv AT rongzhou optimizingtheconstrainedestimateofrandomwalks
AT yongzhang optimizingtheconstrainedestimateofrandomwalks
AT lining optimizingtheconstrainedestimateofrandomwalks
_version_ 1724192530165137408

Similar Items