تقرير
A random walk on the Rado graph
| العنوان: | A random walk on the Rado graph |
|---|---|
| المؤلفون: | Chatterjee, Sourav, Diaconis, Persi, Miclo, Laurent |
| سنة النشر: | 2022 |
| المجموعة: | Mathematics |
| مصطلحات موضوعية: | Mathematics - Probability, Mathematics - Combinatorics, Mathematics - Logic |
| الوصف: | The Rado graph, also known as the random graph $G(\infty, p)$, is a classical limit object for finite graphs. We study natural ball walks as a way of understanding the geometry of this graph. For the walk started at $i$, we show that order $\log_2^*i$ steps are sufficient, and for infinitely many $i$, necessary for convergence to stationarity. The proof involves an application of Hardy's inequality for trees. Comment: 43 pages |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2205.06894 |
| رقم الأكسشن: | edsarx.2205.06894 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |