کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5130038 | 1378654 | 2017 | 25 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Strong-majority bootstrap percolation on regular graphs with low dissemination threshold
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Consider the following model of strong-majority bootstrap percolation on a graph. Let râ¥1 be some integer, and pâ[0,1]. Initially, every vertex is active with probability p, independently from all other vertices. Then, at every step of the process, each vertex v of degree deg(v) becomes active if at least (deg(v)+r)/2 of its neighbours are active. Given any arbitrarily small p>0 and any integer r, we construct a family of d=d(p,r)-regular graphs such that with high probability all vertices become active in the end. In particular, the case r=1 answers a question and disproves a conjecture of Rapaport et al. (2011).
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Stochastic Processes and their Applications - Volume 127, Issue 9, September 2017, Pages 3110-3134
Journal: Stochastic Processes and their Applications - Volume 127, Issue 9, September 2017, Pages 3110-3134
نویسندگان
Dieter Mitsche, Xavier Pérez-Giménez, PaweÅ PraÅat,