skip to main content
10.1145/1167253.1167260acmconferencesArticle/Chapter ViewAbstractPublication Pagesacm-seConference Proceedingsconference-collections
Article

A birth-death dynamic model of scale-free networks

Published: 18 March 2005 Publication History

Abstract

We study a dynamic model of scale-free networks which incorporates not only the birth of vertices and edges but also their death. We analyze the degree distribution of this model by employing a mean-field approach and numerical simulations.

References

[1]
Barabási, A.-L., Albert, R., and Jeong, H. Mean-field theory for scale-free random networks. Physica A, 272, 1999, 173--187.
[2]
Bollobás, B., Riordan, O., Spencer, J., and Tusnády, G. E. The degree sequence of a scale-free random graph process. Random Struct. and Alg., 18(3), 2001, 279--290.
[3]
Deo, N., Litow, B., and Gupta, P. Modeling the web: Linking discrete and continuous. In Proc. of 2000 Summer Computer Simul. Conf. Vancouver, Canada, 2000, 395--400.
[4]
Erdős, P., and Rényi, A. On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutato Int. Kozl., 1960, 16--61.
[5]
Krapivsky, P. L., and Redner, S. Rate equation approach for growing networks, In XVIII Sitges Conf. on Statistical Mechanics of Complex Networks, 2002.
[6]
Kumar, R., Raghavan, P., Rajagopalan, S., and Tomkins, A. Stochastic models for the web graph. In Proc. 41st Ann. Symp. on FOCS, 2000, 57--65.
[7]
Maheshwari, S. The Web as a dynamic graph. In Sahni, S., and Mehta, D. (eds.) Handbook of data structures and algorithms. CRC Press. 2004, Chapter 51.
[8]
Newman, M. E. J., The structure and function of complex networks. SIAM Review, 45, 2003, 167--256.

Index Terms

  1. A birth-death dynamic model of scale-free networks

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        ACMSE '05 vol 2: Proceedings of the 43rd annual ACM Southeast Conference - Volume 2
        March 2005
        430 pages
        ISBN:1595930590
        DOI:10.1145/1167253
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 18 March 2005

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. birth/death
        2. preferential attachment
        3. scale-free networks

        Qualifiers

        • Article

        Conference

        ACM SE05
        Sponsor:
        ACM SE05: ACM Southeast Regional Conference 2005
        March 18 - 20, 2005
        Georgia, Kennesaw

        Acceptance Rates

        Overall Acceptance Rate 502 of 1,023 submissions, 49%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • 0
          Total Citations
        • 211
          Total Downloads
        • Downloads (Last 12 months)1
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 15 Jan 2025

        Other Metrics

        Citations

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media