• DocumentCode
    2573901
  • Title

    Priority weighted BA random graph model

  • Author

    Chen, Xinyi

  • Author_Institution
    China Minorities Inf. Technol. Inst., Northwest Univ. for Nat., Lanzhou, China
  • fYear
    2011
  • fDate
    27-29 June 2011
  • Firstpage
    561
  • Lastpage
    563
  • Abstract
    Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a priority weighted scale-free power-law distribution. This feature was found to be a consequence of three generic mechanisms: (i) networks expand continuously by the addition of new vertices, (ii) new vertex by priority selected different edges to connected to the different vertices in the system, and (iii) new vertices attach preferentially to sites that are already well connected. A model based on these three ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
  • Keywords
    Internet; Web sites; complex networks; graph theory; network theory (graphs); complex topology; generic mechanism; genetic network; large network; observed stationary scale-free distribution; priority weighted BA random graph model; priority weighted scale free power law distribution; robust self organizing phenomena; stationary scale-free distribution; vertex connectivity; world wide Web; Barium; Biological system modeling; Complex networks; Complexity theory; Internet; Topology; BA model; degree distribution; weighted random networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Service System (CSSS), 2011 International Conference on
  • Conference_Location
    Nanjing
  • Print_ISBN
    978-1-4244-9762-1
  • Type

    conf

  • DOI
    10.1109/CSSS.2011.5972129
  • Filename
    5972129