{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T06:31:47Z","timestamp":1681453907013},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T00:00:00Z","timestamp":1559606400000},"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":["Comput Stat"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00180-019-00899-7","type":"journal-article","created":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T08:57:07Z","timestamp":1559638627000},"page":"837-869","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Random sampling of contingency tables via probabilistic divide-and-conquer"],"prefix":"10.1007","volume":"35","author":[{"given":"Stephen","family":"DeSalvo","sequence":"first","affiliation":[]},{"given":"James","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,4]]},"reference":[{"issue":"3","key":"899_CR1","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1017\/S0963548315000358","volume":"25","author":"R Arratia","year":"2016","unstructured":"Arratia R, DeSalvo S (2016) Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example. Comb Probab Comput 25(3):324\u2013351","journal-title":"Comb Probab Comput"},{"issue":"1","key":"899_CR2","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1006\/aima.1994.1022","volume":"104","author":"R Arratia","year":"1994","unstructured":"Arratia R, Tavar\u00e9 S (1994) Independent process approximations for random combinatorial structures. Adv Math 104(1):90\u2013154","journal-title":"Adv Math"},{"issue":"3","key":"899_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10208-003-0088-8","volume":"4","author":"W Baldoni-Silva","year":"2004","unstructured":"Baldoni-Silva W, De Loera JA, Vergne M (2004) Counting integer flows in networks. Found Comput Math 4(3):277\u2013314","journal-title":"Found Comput Math"},{"issue":"1","key":"899_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.aim.2006.07.012","volume":"211","author":"A Barvinok","year":"2007","unstructured":"Barvinok A (2007) Brunn\u2013Minkowski inequalities for contingency tables and integer flows. Adv Math 211(1):105\u2013122","journal-title":"Adv Math"},{"issue":"1","key":"899_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0963548307008668","volume":"17","author":"A Barvinok","year":"2008","unstructured":"Barvinok A (2008) Enumerating contingency tables via random permanents. Comb Probab Comput 17(1):1\u201319","journal-title":"Comb Probab Comput"},{"key":"899_CR6","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1093\/imrn\/rnn133","volume":"2","author":"A Barvinok","year":"2009","unstructured":"Barvinok A (2009a) Asymptotic estimates for the number of contingency tables, integer flows, and volumes of transportation polytopes. Int Math Res Not IMRN 2:348\u2013385","journal-title":"Int Math Res Not IMRN"},{"issue":"2","key":"899_CR7","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1093\/imrn\/rnn133","volume":"2009","author":"A Barvinok","year":"2009","unstructured":"Barvinok A (2009b) Asymptotic estimates for the number of contingency tables, integer flows, and volumes of transportation polytopes. Int Math Res Not 2009(2):348\u2013385","journal-title":"Int Math Res Not"},{"issue":"04","key":"899_CR8","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1017\/S0963548310000039","volume":"19","author":"A Barvinok","year":"2010","unstructured":"Barvinok A (2010) What does a random contingency table look like? Comb Probab Comput 19(04):517\u2013539","journal-title":"Comb Probab Comput"},{"issue":"2","key":"899_CR9","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.aam.2010.01.004","volume":"45","author":"A Barvinok","year":"2010","unstructured":"Barvinok A, Hartigan J (2010) Maximum entropy gaussian approximations for the number of integer points and volumes of polytopes. Adv Appl Math 45(2):252\u2013289","journal-title":"Adv Appl Math"},{"issue":"8","key":"899_CR10","doi-asserted-by":"publisher","first-page":"4323","DOI":"10.1090\/S0002-9947-2012-05585-1","volume":"364","author":"A Barvinok","year":"2012","unstructured":"Barvinok A, Hartigan JA (2012) An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums. Trans Am Math Soc 364(8):4323\u20134368","journal-title":"Trans Am Math Soc"},{"issue":"1","key":"899_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1002\/rsa.20301","volume":"37","author":"A Barvinok","year":"2010","unstructured":"Barvinok A, Luria Z, Samorodnitsky A, Yong A (2010) An approximation algorithm for counting contingency tables. Random Struct Algorithms 37(1):25\u201366","journal-title":"Random Struct Algorithms"},{"key":"899_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0012-365X(74)90118-6","volume":"10","author":"EA Bender","year":"1974","unstructured":"Bender EA (1974) The asymptotic number of non-negative integer matrices with given row and column sums. Discrete Math 10:217\u2013223","journal-title":"Discrete Math"},{"key":"899_CR13","doi-asserted-by":"crossref","unstructured":"Bez\u00e1kov\u00e1 I, Sinclair A, \u0160tefankovi\u010d D, Vigoda E (2006) Negative examples for sequential importance sampling of binary contingency tables. In: Algorithms\u2013ESA 2006. Springer, pp 136\u2013147","DOI":"10.1007\/11841036_15"},{"issue":"4","key":"899_CR14","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1080\/15427951.2010.557277","volume":"6","author":"J Blitzstein","year":"2011","unstructured":"Blitzstein J, Diaconis P (2011) A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Math 6(4):489\u2013522","journal-title":"Internet Math"},{"issue":"2","key":"899_CR15","first-page":"R29","volume":"12","author":"ER Canfield","year":"2005","unstructured":"Canfield ER, McKay BD (2005) Asymptotic enumeration of dense 0\u20131 matrices with equal row sums and equal column sums. J Comb 12(2):R29","journal-title":"J Comb"},{"issue":"469","key":"899_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1198\/016214504000001303","volume":"100","author":"Y Chen","year":"2005","unstructured":"Chen Y, Diaconis P, Holmes SP, Liu JS (2005) Sequential Monte Carlo methods for statistical analysis of tables. J Am Stat Assoc 100(469):109\u2013120","journal-title":"J Am Stat Assoc"},{"issue":"1","key":"899_CR17","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1214\/009053605000000822","volume":"34","author":"Y Chen","year":"2006","unstructured":"Chen Y, Dinwoodie IH, Sullivant S (2006) Sequential importance sampling for multiway tables. Ann Stat 34(1):523\u2013545","journal-title":"Ann Stat"},{"issue":"2","key":"899_CR18","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0022-0000(03)00014-X","volume":"67","author":"M Cryan","year":"2003","unstructured":"Cryan M, Dyer M (2003) A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. J Comput Syst Sci 67(2):291\u2013310","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"899_CR19","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1137\/S0097539703434243","volume":"36","author":"M Cryan","year":"2006","unstructured":"Cryan M, Dyer M, Goldberg LA, Jerrum M, Martin R (2006) Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows. SIAM J Comput 36(1):247\u2013278","journal-title":"SIAM J Comput"},{"issue":"4","key":"899_CR20","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.jsc.2003.04.003","volume":"38","author":"JA De Loera","year":"2004","unstructured":"De Loera JA, Hemmecke R, Tauzer J, Yoshida R (2004) Effective lattice point counting in rational convex polytopes. J Symb Comput 38(4):1273\u20131302","journal-title":"J Symb Comput"},{"key":"899_CR21","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.aam.2017.06.005","volume":"92","author":"S DeSalvo","year":"2018","unstructured":"DeSalvo S (2018) Probabilistic divide-and-conquer: deterministic second half. Adv Appl Math 92:17\u201350","journal-title":"Adv Appl Math"},{"key":"899_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8643-8","volume-title":"Nonuniform random variate generation","author":"L Devroye","year":"1986","unstructured":"Devroye L (1986) Nonuniform random variate generation. Springer, New York"},{"key":"899_CR23","doi-asserted-by":"crossref","unstructured":"Diaconis P, Gangolli A (1995) Rectangular arrays with fixed margins. In: Discrete probability and algorithms (Minneapolis, MN, 1993), IMA Vol. Math. Appl., vol\u00a072. Springer, New York, pp 15\u201341","DOI":"10.1007\/978-1-4612-0801-3_3"},{"issue":"1","key":"899_CR24","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1214\/aos\/1030563990","volume":"26","author":"P Diaconis","year":"1998","unstructured":"Diaconis P, Sturmfels B et al (1998) Algebraic algorithms for sampling from conditional distributions. Ann Stat 26(1):363\u2013397","journal-title":"Ann Stat"},{"key":"899_CR25","doi-asserted-by":"crossref","unstructured":"Duchon P (2011) Random generation of combinatorial structures: Boltzmann samplers and beyond. In: Proceedings of the 2011 winter simulation conference (WSC), pp 120\u2013132","DOI":"10.1109\/WSC.2011.6147745"},{"issue":"4\u20135","key":"899_CR26","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1017\/S0963548304006315","volume":"13","author":"P Duchon","year":"2004","unstructured":"Duchon P, Flajolet P, Louchard G, Schaeffer G (2004) Boltzmann samplers for the random generation of combinatorial structures. Comb Probab Comput 13(4\u20135):577\u2013625","journal-title":"Comb Probab Comput"},{"issue":"1","key":"899_CR27","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0304-3975(99)00136-X","volume":"246","author":"M Dyer","year":"2000","unstructured":"Dyer M, Greenhill C (2000) Polynomial-time counting and sampling of two-rowed contingency tables. Theor Comput Sci 246(1):265\u2013278","journal-title":"Theor Comput Sci"},{"issue":"1","key":"899_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/102782.102783","volume":"38","author":"M Dyer","year":"1991","unstructured":"Dyer M, Frieze A, Kannan R (1991) A random polynomial-time algorithm for approximating the volume of convex bodies. J ACM 38(1):1\u201317","journal-title":"J ACM"},{"issue":"3","key":"899_CR29","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1080\/10618600.2012.680369","volume":"21","author":"GS Fishman","year":"2012","unstructured":"Fishman GS (2012) Counting contingency tables via multistage Markov chain Monte Carlo. J Comput Graph Stat 21(3):713\u2013738","journal-title":"J Comput Graph Stat"},{"issue":"1","key":"899_CR30","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0012-365X(77)90117-0","volume":"19","author":"IJ Good","year":"1977","unstructured":"Good IJ, Crook JF (1977) The enumeration of arrays and a generalization related to contingency tables. Discrete Math 19(1):23\u201345","journal-title":"Discrete Math"},{"issue":"4","key":"899_CR31","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/j.aam.2008.01.002","volume":"41","author":"C Greenhill","year":"2008","unstructured":"Greenhill C, McKay BD (2008) Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums. Adv Appl Math 41(4):459\u2013481","journal-title":"Adv Appl Math"},{"key":"899_CR32","doi-asserted-by":"publisher","first-page":"240","DOI":"10.2307\/2331961","volume":"19","author":"P Hall","year":"1927","unstructured":"Hall P (1927) The distribution of means for samples of size n drawn from a population in which the variate takes values between 0 and 1, all such values being equally probable. Biometrika 19:240\u2013245","journal-title":"Biometrika"},{"key":"899_CR33","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1093\/biomet\/19.3-4.225","volume":"19","author":"JO Irwin","year":"1927","unstructured":"Irwin JO (1927) On the frequency distribution of the means of samples from a population having any law of frequency with finite moments, with special reference to Pearson\u2019s type ii. Biometrika 19:225\u2013239","journal-title":"Biometrika"},{"issue":"4","key":"899_CR34","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1016\/j.jspi.2011.10.010","volume":"142","author":"D Kieffer","year":"2012","unstructured":"Kieffer D, Bianchetti L, Poch O (2012) Perfect sampling on 2 x 2 x... x 2 x k contingency tables with an application to SAGE data. J Stat Plan Inference 142(4):896\u2013901","journal-title":"J Stat Plan Inference"},{"issue":"2","key":"899_CR35","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1002\/rsa.20087","volume":"29","author":"S Kijima","year":"2006","unstructured":"Kijima S, Matsui T (2006) Polynomial time perfect sampling algorithm for two-rowed contingency tables. Random Struct Algorithms 29(2):243\u2013256","journal-title":"Random Struct Algorithms"},{"key":"899_CR36","unstructured":"Knuth DE, Yao AC (1976) The complexity of nonuniform random number generation. In: Algorithms and complexity (Proc. Sympos., Carnegie-Mellon Univ., Pittsburgh, PA, 1976). Academic Press, New York, pp 357\u2013428"},{"issue":"3","key":"899_CR37","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1137\/040610623","volume":"17","author":"JAD Loera","year":"2006","unstructured":"Loera JAD, Onn S (2006) All linear and integer programs are slim 3-way transportation programs. SIAM J Optim 17(3):806\u2013821","journal-title":"SIAM J Optim"},{"issue":"1\u20133","key":"899_CR38","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tcs.2004.06.014","volume":"326","author":"T Matsui","year":"2004","unstructured":"Matsui T, Matsui Y, Ono Y (2004) Random generation of 2 x 2 x... x 2 x j contingency tables. Theor Comput Sci 326(1\u20133):117\u2013135","journal-title":"Theor Comput Sci"},{"issue":"2","key":"899_CR39","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/rsa.10049","volume":"21","author":"BJ Morris","year":"2002","unstructured":"Morris BJ (2002) Improved bounds for sampling contingency tables. Random Struct Algorithms 21(2):135\u2013146","journal-title":"Random Struct Algorithms"},{"issue":"1\u20132","key":"899_CR40","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<223::AID-RSA14>3.0.CO;2-O","volume":"9","author":"JG Propp","year":"1996","unstructured":"Propp JG, Wilson DB (1996) Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Struct Algorithms 9(1\u20132):223\u2013252","journal-title":"Random Struct Algorithms"},{"issue":"4","key":"899_CR41","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1080\/0308108031000098450","volume":"51","author":"GW Soules","year":"2003","unstructured":"Soules GW (2003) New permanental upper bounds for nonnegative matrices. Linear Multilinear Algebra 51(4):319\u2013337","journal-title":"Linear Multilinear Algebra"},{"key":"899_CR42","unstructured":"Steutel F, Thiemann J (1987) On the independence of integer and fractional parts. University of Technology, Department of Mathematics and Computing Science"},{"issue":"3","key":"899_CR43","first-page":"36","volume":"13","author":"J Von Neumann","year":"1951","unstructured":"Von Neumann J (1951) Various techniques used in connection with random digits. J Res Natl Bur Stand Appl Math Ser 13(3):36\u201338","journal-title":"J Res Natl Bur Stand Appl Math Ser"},{"issue":"1","key":"899_CR44","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s11222-009-9115-1","volume":"20","author":"N Wicker","year":"2010","unstructured":"Wicker N (2010) Perfect sampling algorithm for small m$$\\times $$ n contingency tables. Stat Comput 20(1):57\u201361","journal-title":"Stat Comput"},{"key":"899_CR45","unstructured":"Yoshida R, Xi J, Wei S, Zhou F, Haws D (2011) Semigroups and sequential importance sampling for multiway tables. arXiv preprint \narXiv:1111.6518"}],"container-title":["Computational Statistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-019-00899-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00180-019-00899-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-019-00899-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T16:24:23Z","timestamp":1588609463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00180-019-00899-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,4]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["899"],"URL":"https:\/\/doi.org\/10.1007\/s00180-019-00899-7","relation":{},"ISSN":["0943-4062","1613-9658"],"issn-type":[{"value":"0943-4062","type":"print"},{"value":"1613-9658","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,4]]},"assertion":[{"value":"27 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}