کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4640699 | 1341284 | 2010 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
A random walk can be used as a centrality measure of a directed graph. However, if the graph is reducible the random walk will be absorbed in some subset of nodes and will never visit the rest of the graph. In Google PageRank the problem was solved by the introduction of uniform random jumps with some probability. Up to the present, there is no final answer to the question about the choice of this probability. We propose to use a parameter-free centrality measure which is based on the notion of a quasi-stationary distribution. Specifically, we suggest four quasi-stationary based centrality measures, analyze them and conclude that they produce approximately the same ranking.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational and Applied Mathematics - Volume 234, Issue 11, 1 October 2010, Pages 3075–3090
Journal: Journal of Computational and Applied Mathematics - Volume 234, Issue 11, 1 October 2010, Pages 3075–3090
نویسندگان
Konstantin Avrachenkov, Vivek Borkar, Danil Nemirovsky,