= 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."> = 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."> = 3. We prove the strong law of large numbers and the central limit theorem for t">
[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/p/vnm/wpaper/184.html
   My bibliography  Save this paper

Limit Theorems for Reinforced Jump Processes on Regular Trees

Author

Listed:
  • Andrea Collevecchio

    (Department of Applied Mathematics, University of Venice)

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.

Suggested Citation

  • Andrea Collevecchio, 2008. "Limit Theorems for Reinforced Jump Processes on Regular Trees," Working Papers 184, Department of Applied Mathematics, Università Ca' Foscari Venezia.
    • Handle: RePEc:vnm:wpaper:184
    as

    Download full text from publisher

    File URL: http://virgo.unive.it/wpideas/storage/2008wp184.pdf
    File Function: First version, 2008
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Reinforced random walks; stochastic processes; strong law of large numbers; central limit theorem;
    All these keywords.

    JEL classification:

    • C02 - Mathematical and Quantitative Methods - - General - - - Mathematical Economics
    • C00 - Mathematical and Quantitative Methods - - General - - - General

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:vnm:wpaper:184. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Daria Arkhipova (email available below). General contact details of provider: https://edirc.repec.org/data/dmvenit.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.