{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:31:24Z","timestamp":1772119884536,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,4,6]],"date-time":"2016-04-06T00:00:00Z","timestamp":1459900800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["15-01-03530"],"award-info":[{"award-number":["15-01-03530"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s11590-016-1030-8","type":"journal-article","created":{"date-parts":[[2016,4,6]],"date-time":"2016-04-06T07:52:06Z","timestamp":1459929126000},"page":"279-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["General results on preferential attachment and clustering coefficient"],"prefix":"10.1007","volume":"11","author":[{"given":"Liudmila","family":"Ostroumova Prokhorenkova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,6]]},"reference":[{"key":"1030_CR1","doi-asserted-by":"crossref","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. Rev. Mod. Phys. 74, 47\u201397 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"1030_CR2","doi-asserted-by":"crossref","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 Bioinform. 10, 405 (2009)","journal-title":"BMC Bioinform."},{"key":"1030_CR3","doi-asserted-by":"crossref","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Sci. 286, 509\u2013512 (1999)","DOI":"10.1126\/science.286.5439.509"},{"key":"1030_CR4","doi-asserted-by":"crossref","unstructured":"Barab\u00e1si, A.-L., Albert, R., Jeong, H.: Mean-field theory for scale-free random networks. Phys. A. 272, 173\u2013187 (1999)","DOI":"10.1016\/S0378-4371(99)00291-5"},{"key":"1030_CR5","doi-asserted-by":"crossref","unstructured":"Barab\u00e1si, A.-L., Albert, R., Jeong, H.: The diameter of the world wide web. Nat. 401, 130\u2013131 (1999)","DOI":"10.1038\/43601"},{"key":"1030_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721434","volume-title":"Regular Variation","author":"NH Bingham","year":"1987","unstructured":"Bingham, N.H., Goldie, C.M., Teugels, J.L.: Regular Variation. Cambridge University Press, Cambridge (1987)"},{"issue":"45","key":"1030_CR7","doi-asserted-by":"crossref","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. Phys. Rep. 424(45), 175\u2013308 (2006)","journal-title":"Phys. Rep."},{"key":"1030_CR8","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\u201334 (2003)","DOI":"10.1002\/3527602755.ch1"},{"issue":"3","key":"1030_CR9","doi-asserted-by":"crossref","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 Struct. Algorithms 18(3), 279\u2013290 (2001)","journal-title":"Random Struct. Algorithms"},{"key":"1030_CR10","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Khanna, S., Lucier, B.: The power of local information in social networks. In: Internet and Network Economics. LNCS, vol. 7695, pp. 406\u2013419 (2012)","DOI":"10.1007\/978-3-642-35311-6_30"},{"issue":"5","key":"1030_CR11","doi-asserted-by":"crossref","first-page":"1611","DOI":"10.1007\/s11590-013-0698-2","volume":"8","author":"A Buchanan","year":"2014","unstructured":"Buchanan, A., Walteros, J.L., Butenko, S., Pardalos, P.M.: Solving maximum clique in sparse graphs: an $$O(nm+n2^{d\/4})$$ O ( n m + n 2 d \/ 4 ) algorithm for $$d$$ d -degenerate graphs. Optim. Lett. 8(5), 1611\u20131617 (2014)","journal-title":"Optim. Lett."},{"issue":"6","key":"1030_CR12","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1007\/s10955-006-9168-x","volume":"124","author":"T Britton","year":"2006","unstructured":"Britton, T., Deijfen, M., Martin-L\u00f6f, A.: Generating simple random graphs with prescribed degree distribution. J. Stat. Phys. 124(6), 1377\u20131397 (2006)","journal-title":"J. Stat. Phys."},{"issue":"16","key":"1030_CR13","doi-asserted-by":"crossref","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. Comput. Netw. 33(16), 309\u2013320 (2000)","journal-title":"Comput. Netw."},{"key":"1030_CR14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.disc.2003.10.020","volume":"282","author":"PG Buckley","year":"2004","unstructured":"Buckley, P.G., Osthus, D.: Popularity based random graph models leading to a scale-free degree sequence. Discret. Math. 282, 53\u201363 (2004)","journal-title":"Discret. Math."},{"key":"1030_CR15","doi-asserted-by":"crossref","unstructured":"Catanzaro, M., Caldarelli, G., Pietronero, L.: Assortative model for social networks. Phys. Rev. E. 70, 037101 (2004)","DOI":"10.1103\/PhysRevE.70.037101"},{"key":"1030_CR16","doi-asserted-by":"crossref","unstructured":"Costa, L. da F., Rodrigues, F.A., Travieso, G., Boas, P.R.U.: Characterization of complex networks: a survey of measurements. Adv. Phys. 56, 167\u2013242 (2007)","DOI":"10.1080\/00018730601170527"},{"key":"1030_CR17","doi-asserted-by":"crossref","first-page":"4633","DOI":"10.1103\/PhysRevLett.85.4633","volume":"85","author":"SN Dorogovtsev","year":"2000","unstructured":"Dorogovtsev, S.N., Mendes, J.F.F., Samukhin, A.N.: Assortative model for social networks. Phys. Rev. Lett. 85, 4633 (2000)","journal-title":"Phys. Rev. Lett."},{"key":"1030_CR18","unstructured":"Drinea, E., Enachescu, M., Mitzenmacher, M.: Variations on random graph models for the web, technical report. Harvard University, Department of Computer Science (2001)"},{"issue":"10","key":"1030_CR19","doi-asserted-by":"crossref","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. Discret. Appl. Math. 159(10), 953\u2013965 (2011)","journal-title":"Discret. Appl. Math."},{"key":"1030_CR20","first-page":"264","volume":"11","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Gallai, T.: Graphs with given degrees of vertices. Mat. Lapok 11, 264\u2013274 (1960)","journal-title":"Mat. Lapok"},{"key":"1030_CR21","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, Ch.: On power-law relationships of the Internet topology. In: Proc. SIGCOMM\u201999 (1999)","DOI":"10.1145\/316188.316229"},{"issue":"12","key":"1030_CR22","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad Sci."},{"issue":"2","key":"1030_CR23","first-page":"40","volume":"1","author":"EA 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. Mosc. J. Comb. Number Theory 1(2), 40\u201373 (2011)","journal-title":"Mosc. J. Comb. Number Theory"},{"key":"1030_CR24","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1080\/15427951.2011.646176","volume":"8","author":"EA Grechnikov","year":"2012","unstructured":"Grechnikov, E.A.: The degree distribution and the number of edges between vertices of given degrees in the Buckley\u2013Osthus model of a random web graph. J. Internet Math. 8, 257\u2013287 (2012)","journal-title":"J. Internet Math."},{"issue":"2","key":"1030_CR25","doi-asserted-by":"crossref","first-page":"026107","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 65(2), 026107 (2002)","journal-title":"Phys. Rev. E"},{"key":"1030_CR26","doi-asserted-by":"crossref","unstructured":"Krot, A., Ostroumova Prokhorenkova, L.: Local clustering coefficient in generalized preferential attachment models. In: Algorithms and Models for the Web Graph. LNCS, vol. 9479, pp. 15\u201328 (2015)","DOI":"10.1007\/978-3-319-26784-5_2"},{"key":"1030_CR27","unstructured":"Leskovec, J.: Dynamics of Large Networks, ProQuest (2008)"},{"key":"1030_CR28","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/rsa.3240060204","volume":"6","author":"M Molloy","year":"1995","unstructured":"Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. Random Struct. Algorithms 6, 161\u2013179 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"1030_CR29","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1017\/S0963548304006133","volume":"14","author":"TF M\u00f3ri","year":"2005","unstructured":"M\u00f3ri, T.F.: The maximum degree of the Barab\u00e1si\u2013Albert random tree. Comb. Probab. Comput. 14, 339\u2013348 (2005)","journal-title":"Comb. Probab. Comput."},{"key":"1030_CR30","doi-asserted-by":"crossref","unstructured":"M\u00f3ri, T.F.: On random trees. In: Studia Sci. Math. Hungar., vol. 39, p. 143155 (2003)","DOI":"10.1556\/sscmath.39.2002.1-2.9"},{"key":"1030_CR31","doi-asserted-by":"crossref","first-page":"208701","DOI":"10.1103\/PhysRevLett.89.208701","volume":"89","author":"MEJ Newman","year":"2002","unstructured":"Newman, M.E.J.: Assortative mixing in networks. Phys. Rev. Lett. 89, 208701 (2002)","journal-title":"Phys. Rev. Lett."},{"issue":"5","key":"1030_CR32","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1080\/00107510500052444","volume":"46","author":"MEJ Newman","year":"2005","unstructured":"Newman, M.E.J.: Power laws, Pareto distributions and Zipf\u2019s law. Contemp. Phys. 46(5), 323\u2013351 (2005)","journal-title":"Contemp. Phys."},{"issue":"2","key":"1030_CR33","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"issue":"2","key":"1030_CR34","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.socnet.2009.02.002","volume":"31","author":"T Opsahl","year":"2009","unstructured":"Opsahl, T., Panzarasa, P.: Clustering in weighted networks. Soc. Netw. 31(2), 155\u2013163 (2009)","journal-title":"Soc. Netw."},{"key":"1030_CR35","doi-asserted-by":"crossref","unstructured":"Ostroumova Prokhorenkova, L., Samosvat, E.: Global clustering coefficient in scale-free networks. In: Algorithms and Models for the Web Graph. LNCS, vol. 8882, pp. 47\u201358 (2014)","DOI":"10.1007\/978-3-319-13123-8_5"},{"key":"1030_CR36","doi-asserted-by":"crossref","unstructured":"Ostroumova Prokhorenkova, L.: Global clustering coefficient in scale-free weighted and unweighted networks. Internet. Math. 12(1\u20132), 54\u201367 (2016)","DOI":"10.1080\/15427951.2015.1092482"},{"key":"1030_CR37","doi-asserted-by":"crossref","unstructured":"Ostroumova, L., Ryabchenko, A., Samosvat, E.: Generalized preferential attachment: tunable power-law degree distribution and clustering coefficient. In: Algorithms and Models for the Web Graph. LNCS, vol. 8305, pp. 185\u2013202 (2013)","DOI":"10.1007\/978-3-319-03536-9_15"},{"key":"1030_CR38","doi-asserted-by":"crossref","unstructured":"Pastor-Satorras, R., V\u00e1zquez, A., Vespignani, A.: Dynamical and correlation properties of the Internet. Phys. Rev. Lett. 87, N25, 258701 (2001)","DOI":"10.1103\/PhysRevLett.87.258701"},{"key":"1030_CR39","doi-asserted-by":"crossref","unstructured":"Ravasz, E., Barab\u00e1si, A.-L.: Hierarchical organization in complex networks. Phys. Rev. E 67(2) (2003)","DOI":"10.1103\/PhysRevE.67.026112"},{"key":"1030_CR40","doi-asserted-by":"crossref","first-page":"056114","DOI":"10.1103\/PhysRevE.74.056114","volume":"74","author":"MA Serrano","year":"2006","unstructured":"Serrano, M.A., Bogu\u00f1\u00e1, M.: Clustering in complex networks. I. General formalism. Phys. Rev. E 74, 056114 (2006)","journal-title":"Phys. Rev. E"},{"key":"1030_CR41","doi-asserted-by":"crossref","first-page":"056115","DOI":"10.1103\/PhysRevE.74.056115","volume":"74","author":"MA Serrano","year":"2006","unstructured":"Serrano, M.A., Bogu\u00f1\u00e1, M.: Clustering in complex networks. II. Percolation properties. Phys. Rev. E 74, 056115 (2006)","journal-title":"Phys. Rev. E"},{"key":"1030_CR42","doi-asserted-by":"crossref","first-page":"066130","DOI":"10.1103\/PhysRevE.65.066130","volume":"65","author":"A V\u00e1zquez","year":"2002","unstructured":"V\u00e1zquez, A., Pastor-Satorras, R., Vespignani, A.: Large-scale topological and dynamical properties of the Internet. Phys. Rev. E 65, 066130 (2002)","journal-title":"Phys. Rev. E"},{"key":"1030_CR43","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"4","key":"1030_CR44","doi-asserted-by":"crossref","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 71(4), 46141 (2005)","journal-title":"Phys. Rev. E"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1030-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1030-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1030-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1030-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T05:03:32Z","timestamp":1655442212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1030-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,6]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["1030"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1030-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,6]]}}}