کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5773120 | 1631075 | 2017 | 29 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Minimising the largest mean first passage time of a Markov chain: The influence of directed graphs
ترجمه فارسی عنوان
به حداقل رساندن بزرگترین میانگین زمان گذشت اول زنجیره مارکوف: تأثیر گراف های هدایت شده
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
چکیده انگلیسی
For a Markov chain described by an irreducible stochastic matrix A of order n, the mean first passage time mi,j measures the expected time for the Markov chain to reach state j for the first time given that the system begins in state i, thus quantifying the short-term behaviour of the chain. In this article, a lower bound for the maximum mean first passage time is found in terms of the stationary distribution vector of A, and some matrices for which equality is attained are produced. The main objective of this article is to characterise the directed graphs for which any stochastic matrix A respecting this directed graph attains equality in this lower bound, producing a class of Markov chains with optimal short-term behaviour.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 520, 1 May 2017, Pages 306-334
Journal: Linear Algebra and its Applications - Volume 520, 1 May 2017, Pages 306-334
نویسندگان
Jane Breen, Steve Kirkland,