IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v346y2005i1p139-146.html
   My bibliography  Save this article

Directed accelerated growth: application in citation network

Author

Listed:
  • Sen, Parongama

Abstract

In many real-world networks, the number of links increases non-linearly with the number of nodes. Models of such accelerated growth have been considered earlier with deterministic and stochastic number of links. Here we consider stochastic accelerated growth in a network where links are directed. With the number of outgoing links following a power-law distribution, the results are similar to the undirected case. As the accelerated growth is enhanced, the degree of distribution becomes independent of the “initial attractiveness”, a parameter which plays a key role in directed networks. As an example of a directed model with accelerated growth, the citation network is considered, in which the distribution of the number of outgoing link has an exponential tail. The role of accelerated growth is examined here with two different growth laws.

Suggested Citation

  • Sen, Parongama, 2005. "Directed accelerated growth: application in citation network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 346(1), pages 139-146.
    • Handle: RePEc:eee:phsmap:v:346:y:2005:i:1:p:139-146
    DOI: 10.1016/j.physa.2004.08.061
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437104011720
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2004.08.061?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ren, Fu-Xin & Shen, Hua-Wei & Cheng, Xue-Qi, 2012. "Modeling the clustering in citation networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(12), pages 3533-3539.
    2. Ikeda, Nobutoshi, 2017. "Topology of growing networks accelerated by intermediary process," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 484(C), pages 378-393.

    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:phsmap:v:346:y:2005:i:1:p:139-146. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.