IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v14y2003i09ns0129183103005315.html
   My bibliography  Save this article

Average Distance In Growing Trees

Author

Listed:
  • K. MALARZ

    (Department of Applied Computer Science, Faculty of Physics and Nuclear Techniques, AGH University of Science and Technology, al. Mickiewicza 30, PL-30059 Kraków, Poland)

  • J. CZAPLICKI

    (Department of Applied Computer Science, Faculty of Physics and Nuclear Techniques, AGH University of Science and Technology, al. Mickiewicza 30, PL-30059 Kraków, Poland)

  • B. KAWECKA-MAGIERA

    (Department of Applied Computer Science, Faculty of Physics and Nuclear Techniques, AGH University of Science and Technology, al. Mickiewicza 30, PL-30059 Kraków, Poland)

  • K. KUŁAKOWSKI

    (Department of Applied Computer Science, Faculty of Physics and Nuclear Techniques, AGH University of Science and Technology, al. Mickiewicza 30, PL-30059 Kraków, Poland)

Abstract

Two kinds of evolving trees are considered here: the exponential trees, where subsequent nodes are linked to old nodes without any preference, and the Barabási–Albert scale-free networks, where the probability of linking to a node is proportional to the number of its pre-existing links. In both cases, new nodes are linked tom=1nodes. The average node–node distancedis calculated numerically in evolving trees as dependent on the number of nodesN. The results forNnot less than a thousand are averaged over a thousand of growing trees. The results on the mean node–node distancedfor largeNcan be approximated byd=2ln(N)+c1for the exponential trees, andd=ln(N)+c2for the scale-free trees, whereciare constant. We also derive iterative equations fordand its dispersion for the exponential trees. The simulation and the analytical approach give the same results.

Suggested Citation

  • K. Malarz & J. Czaplicki & B. Kawecka-Magiera & K. Kułakowski, 2003. "Average Distance In Growing Trees," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 14(09), pages 1201-1206.
    • Handle: RePEc:wsi:ijmpcx:v:14:y:2003:i:09:n:s0129183103005315
    DOI: 10.1142/S0129183103005315
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183103005315
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183103005315?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.

    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:wsi:ijmpcx:v:14:y:2003:i:09:n:s0129183103005315. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.