Limit Theorems for Reinforced Jump Processes on Regular Trees

Andrea Collevecchio

No 184, Working Papers from Department of Applied Mathematics, Università Ca' Foscari Venezia

Abstract: Consider a vertex-reinforced jump process defined on a regular tree, where each vertex has exactly b children, with b >= 3. We prove the strong law of large numbers and the central limit theorem for the distance of the process from the root. Notice that it is still unknown if vertex-reinforced jump process is transient on the binary tree.

Keywords: Reinforced random walks; stochastic processes; strong law of large numbers; central limit theorem (search for similar items in EconPapers)
JEL-codes: C00 C02 (search for similar items in EconPapers)
Pages: 24 pages
Date: 2008-11
New Economics Papers: this item is included in nep-ore
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://virgo.unive.it/wpideas/storage/2008wp184.pdf First version, 2008 (application/pdf)
Our link check indicates that this URL is bad, the error code is: 500 Can't connect to virgo.unive.it:80 (A connection attempt failed because the connected party did not properly respond after a period of time, or established connection failed because connected host has failed to respond.)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:vnm:wpaper:184

Access Statistics for this paper

More papers in Working Papers from Department of Applied Mathematics, Università Ca' Foscari Venezia Contact information at EDIRC.
Bibliographic data for series maintained by Daria Arkhipova ().