| Author(s): |
Kurtz, Thomas G.
[1]
;
Lebensztayn, Elcio
[2]
;
Leichsenring, Alexandre R.
[2]
;
Machado, Fabio P.
[2]
Total Authors: 4
|
| Affiliation: | [1] Univ Wisconsin, Dept Math, Madison, WI 53706 - USA
[2] IME USP, Dept Estat, BR-05508090 Sao Paulo - Brazil
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | ALEA-LATIN AMERICAN JOURNAL OF PROBABILITY AND MATHEMATICAL STATISTICS; v. 4, p. 45-55, 2008. |
| Web of Science Citations: | 14 |
| Abstract | |
We study the following random walks system on the complete graph with n vertices. At time zero, there is a number of active and inactive particles living on the vertices. Active particles move as continuous-time, rate 1, random walks on the graph, and, any time a vertex with an inactive particle on it is visited, this particle turns into active and starts an independent random walk. However, for a fixed integer L >= 1, each active particle dies at the instant it reaches a total of L jumps without activating any particle. We prove a Law of Large Numbers and a Central Limit Theorem for the proportion of visited vertices at the end of the process. (AU) | |
| FAPESP's process: | 05/04001-5 - Models of random walks on graphs |
| Grantee: | Elcio Lebensztayn |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |