IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v81y2011i6p673-677.html
   My bibliography  Save this article

On the degree evolution of a fixed vertex in some growing networks

Author

Listed:
  • Lindholm, Mathias
  • Vallier, Thomas

Abstract

Two preferential attachment-type graph models which allow for dynamic addition/deletion of edges/vertices are considered. The focus of this paper is on the limiting expected degree of a fixed vertex. For both models a phase transition is seen to occur, i.e. if the probability with which edges are deleted is below a model-specific threshold value, the limiting expected degree is infinite, but if the probability is higher than the threshold value, the limiting expected degree is finite. In the regime above the critical threshold probability, however, the behaviour of the two models may differ. For one of the models a non-zero (as well as zero) limiting expected degree can be obtained whilst the other only has a zero limit. Furthermore, this phase transition is seen to occur for the same critical threshold probability of removing edges as the one which determines whether the degree sequence is of power-law type or if the tails decays exponentially fast.

Suggested Citation

  • Lindholm, Mathias & Vallier, Thomas, 2011. "On the degree evolution of a fixed vertex in some growing networks," Statistics & Probability Letters, Elsevier, vol. 81(6), pages 673-677, June.
    • Handle: RePEc:eee:stapro:v:81:y:2011:i:6:p:673-677
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-7152(11)00061-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Deijfen, Maria & Lindholm, Mathias, 2009. "Growing networks with preferential deletion and addition of edges," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(19), pages 4297-4303.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Johansson, Tobias, 2017. "Gossip spread in social network Models," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 126-134.
    2. Li, Bo & Sun, Duoyong & Bai, Guanghan, 2017. "Empirical research on evolutionary behavior of covert network with preference measurement," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 33-43.

    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:eee:stapro:v:81:y:2011:i:6:p:673-677. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    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.