{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:37Z","timestamp":1740160297896,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,10,22]],"date-time":"2016-10-22T00:00:00Z","timestamp":1477094400000},"content-version":"unspecified","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":[[2016,12]]},"DOI":"10.1007\/s13278-016-0407-0","type":"journal-article","created":{"date-parts":[[2016,10,22]],"date-time":"2016-10-22T06:07:18Z","timestamp":1477116438000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Increasing sampling efficiency for the fixed degree sequence model with phase transitions"],"prefix":"10.1007","volume":"6","author":[{"given":"Christian","family":"Brugger","sequence":"first","affiliation":[]},{"given":"Andr\u00e9 Lucas","family":"Chinazzo","sequence":"additional","affiliation":[]},{"given":"Alexandre Flores","family":"John","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5911-5289","authenticated-orcid":false,"given":"Christian","family":"De Schryver","sequence":"additional","affiliation":[]},{"given":"Norbert","family":"Wehn","sequence":"additional","affiliation":[]},{"given":"Wolfgang","family":"Schlauch","sequence":"additional","affiliation":[]},{"given":"Katharina Anna","family":"Zweig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,22]]},"reference":[{"key":"407_CR1","doi-asserted-by":"crossref","unstructured":"Berger A, M\u00fcller-Hannemann M (2010) Uniform sampling of digraphs with a fixed degree sequence. In: Thilikos DM (ed) Graph theoretic concepts in computer science, vol 6410. Springer, Heidelberg, pp 220\u2013231","DOI":"10.1007\/978-3-642-16926-7_21"},{"key":"407_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0024-3795(80)90105-6","volume":"33","author":"RA Brualdi","year":"1980","unstructured":"Brualdi RA (1980) Matrices of zeros and ones with fixed row and column sum vectors. Linear Algebra Appl 33:159\u2013231","journal-title":"Linear Algebra Appl"},{"key":"407_CR3","doi-asserted-by":"crossref","unstructured":"Brugger C, Chinazzo AL, John AF, De Schryver C, Wehn N, Spitz A, Zweig KA (2015) Exploiting phase transitions for the efficient sampling of the fixed degree sequence model. In: Proceedings of the 2015 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM), ASONAM\u201915. IEEE, ACM, New York, NY, pp 308\u2013313, August 2015","DOI":"10.1145\/2808797.2809388"},{"key":"407_CR4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.2307\/3647877","volume":"110","author":"GW Cobb","year":"2003","unstructured":"Cobb GW, Chen Y-P (2003) An application of Markov Chain Monte Carlo to community ecology. Am Math Mon 110:265\u2013288","journal-title":"Am Math Mon"},{"issue":"4","key":"407_CR5","doi-asserted-by":"crossref","first-page":"e10012","DOI":"10.1371\/journal.pone.0010012","volume":"5","author":"CI Genio Del","year":"2010","unstructured":"Del Genio CI, Kim H, Toroczkai Z, Bassler KE (2010) Efficient and exact sampling of simple graphs with given arbitrary degree sequence. PloS one 5(4):e10012","journal-title":"PloS one"},{"key":"407_CR6","doi-asserted-by":"crossref","unstructured":"Gionis A et al (2007) Assessing data mining results via swap randomization. ACM Trans Knowl Discov Data 1(3), Article No 14","DOI":"10.1145\/1297332.1297338"},{"key":"407_CR7","doi-asserted-by":"crossref","unstructured":"Gionis A, Mannila H, Mielik\u00e4inen T, Tsaparas P (2006) Assessing data mining results via swap randomization. In: Proceedings of the twelfth ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201906)","DOI":"10.1145\/1150402.1150424"},{"key":"407_CR10","first-page":"164","volume":"4","author":"E-\u00c1 Horv\u00e1t","year":"2013","unstructured":"Horv\u00e1t E-\u00c1, Zweig KA (2013) A fixed degree sequence model for the one-mode projection of multiplex bipartite graphs. Soc Netw Anal Min 4:164","journal-title":"Soc Netw Anal Min"},{"issue":"4","key":"407_CR11","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M Jerrum","year":"2004","unstructured":"Jerrum M, Sinclair A, Vigoda E (2004) A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. JACM 51(4):671\u2013697","journal-title":"JACM"},{"issue":"4","key":"407_CR12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/(SICI)1098-2418(199907)14:4<293::AID-RSA1>3.0.CO;2-G","volume":"14","author":"R Kannan","year":"1999","unstructured":"Kannan R, Tetali P, Vempala S (1999) Simple markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct Algorithms 14(4):293\u2013308","journal-title":"Random Struct Algorithms"},{"issue":"7","key":"407_CR13","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inform Sci Technol 58(7):1019\u20131031. doi: 10.1002\/asi.20591","journal-title":"J Am Soc Inform Sci Technol"},{"key":"407_CR14","doi-asserted-by":"crossref","first-page":"1107d","DOI":"10.1126\/science.1100519","volume":"305","author":"R Milo","year":"2004","unstructured":"Milo R, Itzkovitz S, Kashtan N, Levitt R, Alon U (2004) Response to comment on \u201cNetwork motifs: simple building blocks of complex networks\u201d and \u201cSuperfamilies of evolved and designed networks\u201d. Science 305:1107d","journal-title":"Science"},{"key":"407_CR15","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":"407_CR16","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":"407_CR17","first-page":"137","volume":"1","author":"KA Zweig","year":"2011","unstructured":"Zweig KA (2011) Good versus optimal: why network analytic methods need more systematic evaluation. Central Eur J Comput Sci 1:137\u2013153","journal-title":"Central Eur J Comput Sci"},{"issue":"3","key":"407_CR18","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-016-0407-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-016-0407-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-016-0407-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T21:52:25Z","timestamp":1498341145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-016-0407-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,22]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["407"],"URL":"https:\/\/doi.org\/10.1007\/s13278-016-0407-0","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2016,10,22]]},"article-number":"100"}}