{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:58:23Z","timestamp":1742918303881,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642305405"},{"type":"electronic","value":"9783642305412"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30541-2_12","type":"book-chapter","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T15:48:16Z","timestamp":1340034496000},"page":"153-164","source":"Crossref","is-referenced-by-count":17,"title":["Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs"],"prefix":"10.1007","author":[{"given":"Jaideep","family":"Ray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Pinar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Seshadhri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5349","key":"12_CR1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science\u00a0286(5349), 509\u2013512 (1999)","journal-title":"Science"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"208701","DOI":"10.1103\/PhysRevLett.89.208701","volume":"89","author":"M.E.J. Newman","year":"2002","unstructured":"Newman, M.E.J.: Assortative mixing in networks. Phys. Rev. Lett.\u00a089, 208701 (2002)","journal-title":"Phys. Rev. Lett."},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"046111","DOI":"10.1103\/PhysRevE.75.046111","volume":"75","author":"P. Holme","year":"2007","unstructured":"Holme, P., Zhao, J.: Exploring the assortativity-clustering space of a network\u2019s degree sequence. Phys. Rev. E\u00a075, 046111 (2007)","journal-title":"Phys. Rev. E"},{"issue":"4","key":"12_CR4","doi-asserted-by":"publisher","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.: Simple markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct. Algorithms\u00a014(4), 293\u2013308 (1999)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0304-3975(90)90164-D","volume":"73","author":"M. Jerrum","year":"1990","unstructured":"Jerrum, M., Sinclair, A.: Fast uniform generation of regular graphs. Theor. Comput. Sci.\u00a073(1), 91\u2013100 (1990)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M. Jerrum","year":"2004","unstructured":"Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM\u00a051(4), 671\u2013697 (2004)","journal-title":"J. ACM"},{"key":"12_CR7","unstructured":"Gkantsidis, C., Mihail, M., Zegura, E.W.: The Markov chain simulation method for generating connected power law random graphs. In: ALENEX, pp. 16\u201325 (2003)"},{"key":"12_CR8","unstructured":"Stanton, I., Pinar, A.: Constructing and sampling graphs with a prescribed joint degree distribution using Markov chains. ACM Journal of Experimental Algorithmics (to appear)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1038\/ng881","volume":"31","author":"S.S. Shen-Orr","year":"2002","unstructured":"Shen-Orr, S.S., Milo, R., Mangan, S., Alon, U.: Network motifs in the transcriptional regulation network of escherichia coli. Nature Genetics\u00a031, 64\u201368 (2002)","journal-title":"Nature Genetics"},{"issue":"5569","key":"12_CR10","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1126\/science.1065103","volume":"296","author":"S. Maslov","year":"2002","unstructured":"Maslov, S., Sneppen, K.: Specificity and stability in topology of protein networks. Science\u00a0296(5569), 910\u2013913 (2002)","journal-title":"Science"},{"key":"12_CR11","unstructured":"Adams, S.: Dilbert: Random number generator (2001), \n                    http:\/\/search.dilbert.com\/comic\/RandomNumberGenerator"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Sokal, A.: Monte Carlo methods in statistical mechanics: Foundations and new algorithms (1996)","DOI":"10.1007\/978-1-4899-0319-8_6"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Ray, J., Pinar, A., Seshadhri, C.: Are we there yet? when to stop a markov chain while generating random graphs. CoRR abs\/1202.3473 (2012)","DOI":"10.1007\/978-3-642-30541-2_12"},{"key":"12_CR14","unstructured":"Raftery, A., Lewis, S.M.: Implementing MCMC. In: Gilks, W.R., Richardson, S., Spiegelhalter, D.J. (eds.) Markov Chain Monte Carlo in Practice, pp. 115\u2013130. Chapman and Hall (1996)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Raftery, A.E., Lewis, S.M.: How many iterations in the Gibbs sampler? In: Bernardo, J.M., Berger, J.O., Dawid, A.P., Smith, A.F.M. (eds.) Bayesian Statistics, vol.\u00a04, pp. 765\u2013766. Oxford University Press (1992)","DOI":"10.21236\/ADA640705"},{"key":"12_CR16","volume-title":"Discrete multivariate analysis: Theory and practice","author":"Y.M. Bishop","year":"2007","unstructured":"Bishop, Y.M., Fienberg, S.E., Holland, P.W.: Discrete multivariate analysis: Theory and practice. Springer, New York (2007)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2019small-world\u2019 networks. Nature\u00a0393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"12_CR18","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"M.E.J. Newman","year":"2006","unstructured":"Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E\u00a074, 036104 (2006)","journal-title":"Phys. Rev. E"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-39718-2_23","volume-title":"The Semantic Web - ISWC 2003","author":"M. Richardson","year":"2003","unstructured":"Richardson, M., Agrawal, R., Domingos, P.: Trust Management for the Semantic Web. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol.\u00a02870, pp. 351\u2013368. Springer, Heidelberg (2003), doi:10.1007\/978-3-540-39718-2_23"},{"key":"12_CR20","unstructured":"Newman, M.E.J.: Prof. M.\u00a0E.\u00a0J. Newman\u2019s collection of graphs at University of Michigan, \n                    http:\/\/www-personal.umich.edu\/~mejn\/netdata\/"},{"key":"12_CR21","unstructured":"Stanford Network Analysis Platform Collection of Graphs: The Epinions social network from the Stanford Network Analysis Platform collection, \n                    http:\/\/snap.stanford.edu\/data\/soc-Epinions1.html"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1214\/ss\/1177011136","volume":"7","author":"A. Gelman","year":"1992","unstructured":"Gelman, A., Rubin, D.B.: Inference from iterative simulation using multiple sequences. Statistical Science\u00a07, 457\u2013472 (1992)","journal-title":"Statistical Science"}],"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-642-30541-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T16:30:02Z","timestamp":1675096202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-30541-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642305405","9783642305412"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30541-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}