{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T06:19:23Z","timestamp":1773814763080,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319035352","type":"print"},{"value":"9783319035369","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03536-9_15","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T01:59:42Z","timestamp":1386554382000},"page":"185-202","source":"Crossref","is-referenced-by-count":29,"title":["Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient"],"prefix":"10.1007","author":[{"given":"Liudmila","family":"Ostroumova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Ryabchenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Egor","family":"Samosvat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.-L.: Statistical mechanics of complex networks. Reviews of Modern Physics\u00a074, 47\u201397 (2002)","journal-title":"Reviews of Modern Physics"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1186\/1471-2105-10-405","volume":"10","author":"S. Bansal","year":"2009","unstructured":"Bansal, S., Khandelwal, S., Meyers, L.A.: Exploring biological network structure with clustered random networks. BMC Bioinformatics\u00a010, 405 (2009)","journal-title":"BMC Bioinformatics"},{"key":"#cr-split#-15_CR3.1","doi-asserted-by":"crossref","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Science\u00a0286, 509 (1999)","DOI":"10.1126\/science.286.5439.509"},{"key":"#cr-split#-15_CR3.2","doi-asserted-by":"crossref","unstructured":"Barab\u00e1si, A.-L., Albert, R., Jeong, H.: Physica A\u00a0272, 173 (1999)","DOI":"10.1016\/S0378-4371(99)00291-5"},{"key":"#cr-split#-15_CR3.3","doi-asserted-by":"crossref","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.-L.: Nature\u00a0401, 130 (1999)","DOI":"10.1038\/43601"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"36113","DOI":"10.1103\/PhysRevE.71.036113","volume":"71","author":"V. Batagelj","year":"2005","unstructured":"Batagelj, V., Brandes, U.: Efficient generation of large random networks. Phys. Rev. E\u00a071, 036113 (2005)","journal-title":"Phys. Rev. E"},{"issue":"45","key":"15_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","volume":"424","author":"S. Boccaletti","year":"2006","unstructured":"Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.-U.: Complex networks: Structure and dynamics. Physics Reports\u00a0424(45), 175\u2013308 (2006)","journal-title":"Physics Reports"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Riordan, O.M.: Mathematical results on scale-free random graphs. In: Handbook of Graphs and Networks: From the Genome to the Internet, pp. 1\u20133 (2003)","DOI":"10.1002\/3527602755.ch1"},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/rsa.1009","volume":"18","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B., Riordan, O.M., Spencer, J., Tusn\u00e1dy, G.: The degree sequence of a scale-free random graph process. Random Structures and Algorithms\u00a018(3), 279\u2013290 (2001)","journal-title":"Random Structures and Algorithms"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Khanna, S., Lucier, B.: The power of local information in social networks (2012) (preprint)","DOI":"10.1007\/978-3-642-35311-6_30"},{"issue":"16","key":"15_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A. Broder","year":"2000","unstructured":"Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the web. Computer Networks\u00a033(16), 309\u2013320 (2000)","journal-title":"Computer Networks"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.disc.2003.10.020","volume":"282","author":"P.G. Buckley","year":"2004","unstructured":"Buckley, P.G., Osthus, D.: Popularity based random graph models leading to a scale-free degree sequence. Discrete Mathematics\u00a0282, 53\u201363 (2004)","journal-title":"Discrete Mathematics"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1017\/S096354830600753X","volume":"15","author":"C. Cooper","year":"2006","unstructured":"Cooper, C.: Distribution of Vertex Degree in Web-Graphs. Combinatorics, Probability and Computing\u00a015, 637\u2013661 (2006)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/rsa.10084","volume":"22","author":"C. Cooper","year":"2003","unstructured":"Cooper, C., Frieze, A.: A General Model of Web Graphs. Random Structures and Algorithms\u00a022(3), 311\u2013335 (2003)","journal-title":"Random Structures and Algorithms"},{"issue":"4","key":"15_CR13","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1002\/rsa.20318","volume":"38","author":"C. Cooper","year":"2011","unstructured":"Cooper, C., Pra\u0142, P.: at, Scale-free graphs of increasing degree. Random Structures and Algorithms\u00a038(4), 396\u2013421 (2011)","journal-title":"Random Structures and Algorithms"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11512-007-0067-4","volume":"47","author":"M. Deijfen","year":"2009","unstructured":"Deijfen, M., van den Esker, H., van der Hofstad, R., Hooghiemstra, G.: A preferential attachment model with random initial degrees. Ark. Mat.\u00a047, 41\u201372 (2009)","journal-title":"Ark. Mat."},{"issue":"10","key":"15_CR15","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/j.dam.2011.02.003","volume":"159","author":"N. Eggemann","year":"2011","unstructured":"Eggemann, N., Noble, S.D.: The clustering coefficient of a scale-free random graph. Discrete Applied Mathematics\u00a0159(10), 953\u2013965 (2011)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. In: Proc. SIGCOMM 1999 (1999)","DOI":"10.1145\/316188.316229"},{"issue":"2","key":"15_CR17","first-page":"40","volume":"1","author":"E.A. Grechnikov","year":"2011","unstructured":"Grechnikov, E.A.: An estimate for the number of edges between vertices of given degrees in random graphs in the Bollob\u00e1s\u2013Riordan model. Moscow Journal of Combinatorics and Number Theory\u00a01(2), 40\u201373 (2011)","journal-title":"Moscow Journal of Combinatorics and Number Theory"},{"issue":"2","key":"15_CR18","doi-asserted-by":"publisher","first-page":"26107","DOI":"10.1103\/PhysRevE.65.026107","volume":"65","author":"P. Holme","year":"2002","unstructured":"Holme, P., Kim, B.J.: Growing scale-free networks with tunable clustering. Phys. Rev. E\u00a065(2), 026107 (2002)","journal-title":"Phys. Rev. E"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1017\/S0963548304006133","volume":"14","author":"T.F. M\u00f3ri","year":"2005","unstructured":"M\u00f3ri, T.F.: The maximum degree of the Barab\u00e1si-Albert random tree. Combinatorics, Probability and Computing\u00a014, 339\u2013348 (2005)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"3","key":"15_CR20","doi-asserted-by":"publisher","first-page":"36133","DOI":"10.1103\/PhysRevE.72.036133","volume":"72","author":"M.\u00c1. Serrano","year":"2005","unstructured":"Serrano, M.\u00c1., Bogu\u00f1\u00e1, M.: Tuning clustering in random networks with arbitrary degree distributions. Phys. Rev. E\u00a072(3), 036133 (2005)","journal-title":"Phys. Rev. E"},{"issue":"5","key":"15_CR21","doi-asserted-by":"publisher","first-page":"56115","DOI":"10.1103\/PhysRevE.70.056115","volume":"70","author":"E. Volz","year":"2004","unstructured":"Volz, E.: Random Networks with Tunable Degree Distribution and Clustering. Phys. Rev. E\u00a070(5), 056115 (2004)","journal-title":"Phys. Rev. E"},{"issue":"4","key":"15_CR22","doi-asserted-by":"publisher","first-page":"46141","DOI":"10.1103\/PhysRevE.71.046141","volume":"71","author":"T. Zhou","year":"2005","unstructured":"Zhou, T., Yan, G., Wang, B.-H.: Maximal planar networks with large clustering coefficient and power-law degree distribution journal. Phys. Rev. E\u00a071(4), 46141 (2005)","journal-title":"Phys. Rev. E"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03536-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T17:17:08Z","timestamp":1676654228000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03536-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035352","9783319035369"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03536-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}