کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
397856 1438431 2016 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Random walks on graphs with interval weights and precise marginals
ترجمه فارسی عنوان
تصادفی بر روی نمودار با وزن های فاصله و حاشیه های دقیق حرکت می کند
کلمات کلیدی
نمودار وزن، پیاده روی تصادفی، زنجیره مارکوف، زنجیره مبهم مارکف، زنجیر مارکوف برگشت پذیر، بهینه سازی محلی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
چکیده انگلیسی


• Random walks on graphs with interval weights are studied.
• The model is connected to reversible imprecise Markov chains.
• A local optimization algorithm is proposed.
• The results of numerical tests of the local optimization algorithm are reported.

We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt to model reversible chains. In contrast with the existing theory, the probability models that have to be considered are now non-convex. This presents a difficulty in computational sense, since convexity is critical for the existence of efficient optimization algorithms used in the existing models. The second part of the paper therefore addresses the computational issues of the model. The goal is finding sets of weights which maximize or minimize expectations corresponding to multiple steps transition probabilities. In particular, we present a local optimization algorithm and numerically test its efficiency. We show that its application allows finding close approximations of the globally best solutions in reasonable time.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Approximate Reasoning - Volume 73, June 2016, Pages 76–86
نویسندگان
,