Advanced Search
MyIDEAS: Login

On a preferential attachment and generalized Pólya's urn model

Contents:

Author Info

  • Andrea Collevecchio

    ()
    (Department of Management, Università Ca' Foscari Venezia)

  • Codina Cotar

    ()
    (Lehrstuhl für Mathematische Statistik, Technische Universität München)

  • Marco LiCalzi

    ()
    (Department of Management, Università Ca' Foscari Venezia)

Abstract

We study a general preferential attachment and Pólya's urn model. At each step a new vertex is introduced, which can be connected to at most one existing vertex. If it is disconnected, it becomes a pioneer vertex. Given that it is not disconnected, it joins an existing pioneer vertex with probability proportional to a function of the degree of that vertex. This function is allowed to be vertex-dependent, and is called the reinforcement function. We prove that there can be at most three phases in this model, depending on the behavior of the reinforcement function. Consider the set whose elements are the vertices with cardinality tending a.s. to infinity. We prove that this set either is empty, or it has exactly one element, or it contains all the pioneer vertices. Moreover, we describe the phase transition in the case where the reinforcement function is the same for all vertices. Our results are general, and in particular we are not assuming monotonicity of the reinforcement function. Finally, consider the regime where exactly one vertex has a degree diverging to infinity. We give a lower bound for the probability that a given vertex ends up being the leading one, i.e. its degree diverges to infinity. Our proofs rely on a generalization of the Rubin construction given for edge-reinforced random walks, and on a Brownian motion embedding.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://virgo.unive.it/wpideas/storage/2011wp8.pdf
File Function: Revised version, 2012
Download Restriction: no

Bibliographic Info

Paper provided by Department of Management, Università Ca' Foscari Venezia in its series Working Papers with number 8.

as in new window
Length: 36 pages
Date of creation: Aug 2011
Date of revision: Oct 2012
Handle: RePEc:vnm:wpdman:8

Contact details of provider:
Web page: http://www.unive.it/dip.management
More information through EDIRC

Related research

Keywords: Preferential attachment; Reinforcement processes; Species sampling sequence; Pólya's urn process;

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Hansen, Ben & Pitman, Jim, 2000. "Prediction rules for exchangeable sequences related to species sampling," Statistics & Probability Letters, Elsevier, vol. 46(3), pages 251-256, February.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:vnm:wpdman:8. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Marco LiCalzi).

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.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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