Random walks systems on complete graphs |
| |
Authors: | Oswaldo S M Alves Elcio Lebensztayn Fábio P Machado Mauricio Z Martinez |
| |
Institution: | 1. Universidade Federal de Goiás, Goiás, BRASIL 2. Universidade de S?o Paulo, S?o Paulo, BRASIL 3. Universidade de S?o Paulo, S?o Paulo, BRASIL 4. Universidade de S?o Paulo, S?o Paulo, BRASIL
|
| |
Abstract: | We study two versions of random walks systems on complete graphs. In the first one, the random walks have geometrically distributed
lifetimes so we define and identify a non-trivial critical parameter related to the proportion of visited vertices before
the process dies out. In the second version, the lifetimes depend on the past of the process in a non-Markovian setup. For
that version, we present results obtained from computational analysis, simulations and a mean field approximation. These three
approaches match. |
| |
Keywords: | random walks complete graphs mean field approximation |
本文献已被 SpringerLink 等数据库收录! |
|