{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:28:56Z","timestamp":1773275336691,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":2456,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2006,12]]},"DOI":"10.1016\/j.tcs.2006.08.045","type":"journal-article","created":{"date-parts":[[2006,9,24]],"date-time":"2006-09-24T11:15:32Z","timestamp":1159096532000},"page":"239-249","source":"Crossref","is-referenced-by-count":46,"title":["The degree distribution of the generalized duplication model"],"prefix":"10.1016","volume":"369","author":[{"given":"G.","family":"Bebek","sequence":"first","affiliation":[]},{"given":"P.","family":"Berenbrink","sequence":"additional","affiliation":[]},{"given":"C.","family":"Cooper","sequence":"additional","affiliation":[]},{"given":"T.","family":"Friedetzky","sequence":"additional","affiliation":[]},{"given":"J.","family":"Nadeau","sequence":"additional","affiliation":[]},{"given":"S.C.","family":"Sahinalp","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2006.08.045_bib1","doi-asserted-by":"crossref","unstructured":"W. Aiello, F. Chung, L. Lu, A random graph model for power law graphs, Proc. ACM STOC, 2000, pp. 171\u2013180.","DOI":"10.1145\/335305.335326"},{"key":"10.1016\/j.tcs.2006.08.045_bib2","doi-asserted-by":"crossref","unstructured":"W. Aiello, F. Chung, L. Lu, Random evolution in massive graphs, Proc. FOCS, 2001, pp. 510\u2013519.","DOI":"10.1109\/SFCS.2001.959927"},{"key":"10.1016\/j.tcs.2006.08.045_bib3","doi-asserted-by":"crossref","first-page":"5234","DOI":"10.1103\/PhysRevLett.85.5234","article-title":"Topology of evolving networks: local events and universality","volume":"85","author":"Albert","year":"2000","journal-title":"Phys. Rev. Lett."},{"key":"10.1016\/j.tcs.2006.08.045_bib4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","article-title":"Statistical mechanics of complex networks","volume":"74","author":"Albert","year":"2002","journal-title":"Rev. Modern Phys."},{"key":"10.1016\/j.tcs.2006.08.045_bib5","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barab\u00e1si","year":"1999","journal-title":"Science"},{"key":"10.1016\/j.tcs.2006.08.045_bib6","doi-asserted-by":"crossref","first-page":"1486","DOI":"10.1093\/bioinformatics\/18.11.1486","article-title":"A duplication growth model of gene expression networks","volume":"18","author":"Bhan","year":"2002","journal-title":"Bioinformatics"},{"key":"10.1016\/j.tcs.2006.08.045_bib7","series-title":"Modern Graph Theory","author":"Bollob\u00e1s","year":"1998"},{"key":"10.1016\/j.tcs.2006.08.045_bib8","unstructured":"B. Bollob\u00e1s, C. Borgs, J. Chayes, O. Riordan, Directed scale-free graphs, Proc. ACM-SIAM SODA, 2003, pp. 132\u2013139."},{"key":"10.1016\/j.tcs.2006.08.045_bib9","series-title":"Handbook of Graphs and Networks","author":"Bollob\u00e1s","year":"2002"},{"key":"10.1016\/j.tcs.2006.08.045_bib10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00493-004-0002-2","article-title":"The diameter of a scale-free random graph","volume":"24","author":"Bollob\u00e1s","year":"2004","journal-title":"Combinatorica"},{"key":"10.1016\/j.tcs.2006.08.045_bib11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/rsa.1009","article-title":"The degree sequence of a scale-free random graph process","volume":"18","author":"Bollob\u00e1s","year":"2001","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/j.tcs.2006.08.045_bib12","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1089\/106652703322539024","article-title":"Duplication models for biological networks","volume":"10","author":"Chung","year":"2003","journal-title":"J. Comput. Biol."},{"issue":"3","key":"10.1016\/j.tcs.2006.08.045_bib13","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1002\/rsa.10084","article-title":"A general model of webgraphs","volume":"22","author":"Cooper","year":"2003","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/j.tcs.2006.08.045_bib14","doi-asserted-by":"crossref","first-page":"1842","DOI":"10.1103\/PhysRevE.62.1842","article-title":"Evolution of networks with aging of sites","volume":"62","author":"Dorogovstev","year":"2000","journal-title":"Phys. Rev. E"},{"key":"10.1016\/j.tcs.2006.08.045_bib15","doi-asserted-by":"crossref","first-page":"4633","DOI":"10.1103\/PhysRevLett.85.4633","article-title":"Structure of growing networks with preferential linking","volume":"85","author":"Dorogovstev","year":"2000","journal-title":"Phys. Rev. Lett."},{"key":"10.1016\/j.tcs.2006.08.045_bib16","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs I","volume":"6","author":"Erd\u00f6s","year":"1959","journal-title":"Publ. Math. Debrecen"},{"key":"10.1016\/j.tcs.2006.08.045_bib17","doi-asserted-by":"crossref","unstructured":"M. Faloutsos, P. Faloutsos, C. Faloutsos, On power-law relationships of the internet topology, SIGCOMM, 1999.","DOI":"10.1145\/316188.316229"},{"key":"10.1016\/j.tcs.2006.08.045_bib18","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1511\/2000.2.104","article-title":"Graph theory in practice: Part II","volume":"88","author":"Hayes","year":"2000","journal-title":"Amer. Sci."},{"key":"10.1016\/j.tcs.2006.08.045_bib19","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1038\/35075138","article-title":"Lethality and centrality in protein networks","volume":"411","author":"Jeong","year":"2001","journal-title":"Nature"},{"key":"10.1016\/j.tcs.2006.08.045_bib20","doi-asserted-by":"crossref","first-page":"055101(R)","DOI":"10.1103\/PhysRevE.66.055101","article-title":"Infinite-order percolation and giant fluctuations in a protein interaction network","volume":"66","author":"Kim","year":"2002","journal-title":"Phys. Rev. E"},{"key":"10.1016\/j.tcs.2006.08.045_bib21","doi-asserted-by":"crossref","unstructured":"J. Kleinberg, R. Kumar, P.P. Raphavan, S. Rajagopalan, A. Tomkins, The Web as a graph: measurements, models and methods, Proc. COCOON, Tokyo, Japan, 1999, pp. 1\u201317.","DOI":"10.1007\/3-540-48686-0_1"},{"key":"10.1016\/j.tcs.2006.08.045_bib22","doi-asserted-by":"crossref","unstructured":"R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, E. Upfal, Stochastic models for the web graph, FOCS, 2000, pp. 57\u201365.","DOI":"10.1109\/SFCS.2000.892065"},{"key":"10.1016\/j.tcs.2006.08.045_bib23","series-title":"Proc. 39th Annu. Allerton Conf. on Communication, Control, and Computing","first-page":"182","article-title":"A brief history of generative models for power law and lognormal distributions","author":"Mitzenmacher","year":"2001"},{"key":"10.1016\/j.tcs.2006.08.045_bib24","series-title":"Evolution by Gene Duplication","author":"Ohno","year":"1970"},{"key":"10.1016\/j.tcs.2006.08.045_bib25","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0022-5193(03)00028-6","article-title":"Evolving protein interaction networks through gene duplication","volume":"222","author":"Pastor-Satorras","year":"2003","journal-title":"J. Theor. Biol."},{"issue":"18","key":"10.1016\/j.tcs.2006.08.045_bib26","doi-asserted-by":"crossref","first-page":"3508","DOI":"10.1093\/bioinformatics\/bth436","article-title":"Modeling interactome: scale-free or geometric?","volume":"20","author":"Przulj","year":"2004","journal-title":"Bioinformatics"},{"key":"10.1016\/j.tcs.2006.08.045_bib27","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1093\/biomet\/42.3-4.425","article-title":"On a class of skew distribution functions","volume":"42","author":"Simon","year":"1955","journal-title":"Biometrika"},{"key":"10.1016\/j.tcs.2006.08.045_bib28","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1038\/35001009","article-title":"A comprehensive analysis of protein\u2013protein interactions in S. Cerevisiae","volume":"403","author":"Uetz","year":"2000","journal-title":"Nature"},{"key":"10.1016\/j.tcs.2006.08.045_bib29","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1159\/000067642","article-title":"Modelling of protein interaction networks","volume":"1","author":"V\u00e1zquez","year":"2003","journal-title":"Complexus"},{"key":"10.1016\/j.tcs.2006.08.045_bib30","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1093\/oxfordjournals.molbev.a003913","article-title":"The yeast protein interaction network evolves rapidly and contains few redundant duplicate genes","volume":"18","author":"Wagner","year":"2001","journal-title":"Mol. Biol. Evol."},{"key":"10.1016\/j.tcs.2006.08.045_bib31","series-title":"Small Worlds: The Dynamics of Networks between Order and Randomness","author":"Watts","year":"1999"},{"key":"10.1016\/j.tcs.2006.08.045_bib32","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of small-world networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"10.1016\/j.tcs.2006.08.045_bib33","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1093\/nar\/30.1.303","article-title":"DIP, the database of interacting proteins: a research tool for studying cellular networks of protein interactions","volume":"30","author":"Xenarios","year":"2002","journal-title":"Nucleic Acids Res."},{"key":"10.1016\/j.tcs.2006.08.045_bib34","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1098\/rstb.1925.0002","article-title":"A mathematical theory of evolution based on the conclusions of Dr. J.C. Willis","volume":"213","author":"Yule","year":"1925","journal-title":"Philos. Trans. Roy. Soc. London (Ser. B)"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397506005822?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397506005822?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T23:24:26Z","timestamp":1683588266000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397506005822"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":34,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["S0304397506005822"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2006.08.045","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}