{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T14:52:50Z","timestamp":1772117570953,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,7,7]],"date-time":"2015-07-07T00:00:00Z","timestamp":1436227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s13278-015-0267-z","type":"journal-article","created":{"date-parts":[[2015,7,6]],"date-time":"2015-07-06T08:23:47Z","timestamp":1436171027000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Different flavors of randomness: comparing random graph models with fixed degree sequences"],"prefix":"10.1007","volume":"5","author":[{"given":"Wolfgang E.","family":"Schlauch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Em\u0151ke \u00c1gnes","family":"Horv\u00e1t","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katharina A.","family":"Zweig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,7]]},"reference":[{"key":"267_CR1","unstructured":"Aghbolagh RD, Zeilemaker N, Pouwelse J, Epema D (2013) A network science perspective of a distributed reputation mechanism. In: IFIP Networking 2013"},{"key":"267_CR2","doi-asserted-by":"crossref","DOI":"10.1201\/9781420011432","volume-title":"An introduction to systems biology\u2014design principles of biological circuits","author":"U Alon","year":"2006","unstructured":"Alon U (2006) An introduction to systems biology\u2014design principles of biological circuits. Chapman & Hall\/CRC, Boca Raton"},{"issue":"5439","key":"267_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"key":"267_CR4","doi-asserted-by":"crossref","unstructured":"Bogu\u00e1 M, Pastor-Satorras R, Vespignani A (2003) Epidemic spreading in complex networks with degree correlations. In: Pastor-Satorras R, Rubi M, Diaz-Guilera A (eds) Statistical mechanics of complex networks. Lecture notes in physics, vol 625. Springer, Berlin, pp 127\u2013147. doi: 10.1007\/978-3-540-44943-0_8","DOI":"10.1007\/978-3-540-44943-0_8"},{"issue":"1","key":"267_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00493-004-0002-2","volume":"24","author":"B Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s B, Riordan O (2004) The diameter of a scale-free random graph. Combinatorica 24(1):5\u201334","journal-title":"Combinatorica"},{"key":"267_CR6","doi-asserted-by":"crossref","first-page":"3054","DOI":"10.1016\/j.disc.2004.10.028","volume":"306","author":"RA Brualdi","year":"2006","unstructured":"Brualdi RA (2006) Algorithms for constructing (0,1)-matrices with prescribed row and column sum vectors. Discret Math 306:3054\u20133062","journal-title":"Discret Math"},{"issue":"25","key":"267_CR7","doi-asserted-by":"crossref","first-page":"15879","DOI":"10.1073\/pnas.252631999","volume":"99","author":"F Chung","year":"2002","unstructured":"Chung F, Lu L (2002) The average distances in random graphs with given expected degrees. Proc Natl Acad Sci 99(25):15879\u201315882. doi: 10.1073\/pnas.252631999","journal-title":"Proc Natl Acad Sci"},{"key":"267_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.2307\/3647877","volume":"110","author":"GW Cobb","year":"2003","unstructured":"Cobb GW, Chen YP (2003) An application of Markov Chain Monte Carlo to community ecology. Am Math Mon 110:265\u2013288","journal-title":"Am Math Mon"},{"issue":"032","key":"267_CR9","first-page":"812","volume":"90","author":"GF Arruda de","year":"2014","unstructured":"de Arruda GF, Barbieri AL, Rodr\u00edguez PM, Rodrigues FA, Moreno Y, da Fontoura Costa L (2014) Role of centrality for the identification of influential spreaders in complex networks. Phys Rev E 90(032):812. doi: 10.1103\/PhysRevE.90.032812","journal-title":"Phys Rev E"},{"key":"267_CR10","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P, R\u00e9nyi A (1959) On random graphs I. Publ Math Debrecen 6:290\u2013297","journal-title":"Publ Math Debrecen"},{"key":"267_CR11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based upon betweenness. Sociometry 40:35\u201341","journal-title":"Sociometry"},{"issue":"3","key":"267_CR12","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1132960.1132963","volume":"38","author":"L Geng","year":"2006","unstructured":"Geng L, Hamilton HJ (2006) Interestingness measures for data mining: a survey. ACM Comput Surv 38(3):9","journal-title":"ACM Comput Surv"},{"issue":"3","key":"267_CR13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/1297332.1297338","volume":"1","author":"A Gionis","year":"2007","unstructured":"Gionis A, Mannila H, Mielik\u00e4inen T, Tsaparas P (2007) Assessing data mining results via swap randomization. ACM Trans Knowl Discov Data 1(3):14","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"21","key":"267_CR14","doi-asserted-by":"crossref","first-page":"8685","DOI":"10.1073\/pnas.0701361104","volume":"104","author":"KII Goh","year":"2007","unstructured":"Goh KII, Cusick ME, Valle D, Childs B, Vidal M, Barab\u00e1si ALL (2007) The human disease network. Proc Natl Acad Sci USA 104(21):8685\u20138690. doi: 10.1073\/pnas.0701361104","journal-title":"Proc Natl Acad Sci USA"},{"key":"267_CR15","volume-title":"Null-models in ecology","author":"NJ Gotelli","year":"1996","unstructured":"Gotelli NJ, Graves GR (1996) Null-models in ecology. Smithsonian Institution Press, Washington"},{"issue":"4","key":"267_CR16","doi-asserted-by":"crossref","first-page":"403","DOI":"10.2307\/2785876","volume":"18","author":"L Katz","year":"1955","unstructured":"Katz L, Powell JH (1955) Measurement of the tendency toward reciprocation of choice. Sociometry 18(4):403\u2013409","journal-title":"Sociometry"},{"key":"267_CR17","unstructured":"Ledermann W (ed) (1980) Handbook of applicable mathematics. Wiley, Chichester"},{"issue":"2","key":"267_CR18","doi-asserted-by":"crossref","first-page":"026120","DOI":"10.1103\/PhysRevE.73.026120","volume":"73","author":"EA Leicht","year":"2006","unstructured":"Leicht EA, Holme P, Newman ME (2006) Vertex similarity in networks. Phys Rev E 73(2):026120","journal-title":"Phys Rev E"},{"key":"267_CR19","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1038\/msb.2012.2","volume":"8","author":"M Malumbres","year":"2012","unstructured":"Malumbres M (2012) miRNAs versus oncogenes: the power of social networking. Mol Syst Biol 8:569","journal-title":"Mol Syst Biol"},{"issue":"1","key":"267_CR20","doi-asserted-by":"crossref","first-page":"4:1","DOI":"10.1145\/2556612","volume":"8","author":"J Mcauley","year":"2014","unstructured":"Mcauley J, J Leskovec (2014) Discovering social circles in ego networks. ACM Trans Knowl Discov Data 8(1):4:1\u20134:28. doi: 10.1145\/2556612","journal-title":"ACM Trans Knowl Discov Data"},{"key":"267_CR21","doi-asserted-by":"crossref","first-page":"1538","DOI":"10.1126\/science.1089167","volume":"303","author":"R Milo","year":"2004","unstructured":"Milo R, Itzkovitz S, Kashtan N, Levitt R, Shen-Orr S, Ayzenshtat I, Sheffer M, Alon U (2004a) Superfamilies of evolved and designed networks. Science 303:1538\u20131542","journal-title":"Science"},{"issue":"058","key":"267_CR22","first-page":"102","volume":"70","author":"R Milo","year":"2004","unstructured":"Milo R, Kashtan N, Itzkovitz S, Newman MEJ, Alon U (2004b) Subgraphs in networks. Phys Rev E 70(058):102","journal-title":"Phys Rev E"},{"key":"267_CR23","doi-asserted-by":"crossref","unstructured":"Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298(5594):824\u2013827. doi: 10.1126\/science.298.5594.824 . http:\/\/www.sciencemag.org\/content\/298\/5594\/824.full.pdf","DOI":"10.1126\/science.298.5594.824"},{"issue":"2\u20133","key":"267_CR24","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/rsa.3240060204","volume":"6","author":"M Molloy","year":"1995","unstructured":"Molloy M, Reed B (1995) A critical point for random graphs with a given degree sequence. Random Struct Algorithms 6(2\u20133):161\u2013180. doi: 10.1002\/rsa.3240060204","journal-title":"Random Struct Algorithms"},{"key":"267_CR25","doi-asserted-by":"crossref","first-page":"2566","DOI":"10.1073\/pnas.012582999","volume":"99","author":"ME Newman","year":"2002","unstructured":"Newman ME, Watts DJ, Strogatz SH (2002) Random graph models of social networks. Proc Natl Acad Sci USA 99:2566\u20132572","journal-title":"Proc Natl Acad Sci USA"},{"issue":"2","key":"267_CR26","doi-asserted-by":"crossref","first-page":"026126","DOI":"10.1103\/PhysRevE.67.026126","volume":"67","author":"ME Newman","year":"2003","unstructured":"Newman ME (2003) Mixing patterns in networks. Phys Rev E 67(2):026126. doi: 10.1103\/physreve.67.026126","journal-title":"Phys Rev E"},{"key":"267_CR27","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman MEJ (2010) Networks: an introduction. Oxford University Press, New York"},{"issue":"2","key":"267_CR28","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113","journal-title":"Phys Rev E"},{"issue":"2","key":"267_CR29","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 (2009) Clustering in weighted networks. Soc Netw 31(2):155\u2013163. doi: 10.1016\/j.socnet.2009.02.002","journal-title":"Soc Netw"},{"issue":"1","key":"267_CR30","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1038\/ng881","volume":"31","author":"S Shen-Orr","year":"2002","unstructured":"Shen-Orr S, Milo R, Mangan S, Alon U (2002) Network motifs in the transcriptional regulation network of Escherichia coli. Nat Genet 31(1):64\u201368. doi: 10.1038\/ng881","journal-title":"Nat Genet"},{"issue":"3","key":"267_CR31","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1137\/080734315","volume":"53","author":"AL Traud","year":"2011","unstructured":"Traud AL, Kelsic ED, Mucha PJ, Porter MA (2011) Comparing community structure to characteristics in online collegiate social networks. SIAM Rev 53(3):526\u2013543. doi: 10.1137\/080734315","journal-title":"SIAM Rev"},{"key":"267_CR32","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1038\/msb.2011.100","volume":"8","author":"S Uhlmann","year":"2012","unstructured":"Uhlmann S, Mannsperger H, Zhang JD, Horvat E\u00c1, Schmidt C, K\u00fcblbeck M, Ward A, Tschulena U, Zweig K, Korf U, Wiemann S, Sahin \u00d6 (2012) Global miRNA regulation of a local protein network: case study with the EGFR-driven cell cycle network in breast cancer. Mol Syst Biol 8:570","journal-title":"Mol Syst Biol"},{"key":"267_CR33","unstructured":"van der Hofstad R (2012) Random graphs and complex networks. Department of Mathematics and Computer Science"},{"issue":"12","key":"267_CR34","doi-asserted-by":"crossref","first-page":"125209","DOI":"10.1063\/1.2982927","volume":"49","author":"R Hofstad van der","year":"2008","unstructured":"van der Hofstad R, Hooghiemstra G (2008) Universality for distances in power-law random graphs. J Math Phys 49(12):125209. doi: 10.1063\/1.2982927","journal-title":"J Math Phys"},{"key":"267_CR35","series-title":"Methods and applications","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Social network analysis., Methods and applicationsCambridge University Press, Cambridge"},{"key":"267_CR36","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2019small-world\u2019 networks. Nature 393:440\u2013442","journal-title":"Nature"},{"issue":"101","key":"267_CR37","doi-asserted-by":"crossref","first-page":"5934","DOI":"10.1073\/pnas.0306752101","volume":"101","author":"E Yeger-Lotem","year":"2004","unstructured":"Yeger-Lotem E, Sattath S, Kashtan N, Itzkovitz S, Milo R, Pinter RY, Alon U, Margalit H (2004) Network motifs in integrated cellular networks of transcription-regulation and protein-protein interaction. Proceedings of the National Academy of Sciences 101(101):5934\u20135939","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"267_CR38","doi-asserted-by":"crossref","unstructured":"Zweig KA (2010) How to forget the second side of the story: a new method for the one-mode projection of bipartite graphs. In: Proceedings of the 2010 international conference on advances in social networks analysis and mining (ASONAM 2010), pp 200\u2013207","DOI":"10.1109\/ASONAM.2010.24"},{"key":"267_CR39","doi-asserted-by":"crossref","unstructured":"Zweig KA (2014) Network representations of complex data. In: Encyclopedia of social network analysis and mining. Springer, Heidelberg","DOI":"10.1007\/978-1-4614-6170-8_12"},{"issue":"3","key":"267_CR40","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s13278-011-0021-0","volume":"1","author":"KA Zweig","year":"2011","unstructured":"Zweig KA, Kaufmann M (2011) A systematic approach to the one-mode projection of bipartite graphs. Soc Netw Anal Min 1(3):187\u2013218","journal-title":"Soc Netw Anal Min"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-015-0267-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-015-0267-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-015-0267-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,12]],"date-time":"2023-08-12T01:32:32Z","timestamp":1691803952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-015-0267-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,7]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["267"],"URL":"https:\/\/doi.org\/10.1007\/s13278-015-0267-z","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,7]]},"article-number":"36"}}