{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T14:35:27Z","timestamp":1790260527651,"version":"4.1.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,11,8]],"date-time":"2013-11-08T00:00:00Z","timestamp":1383868800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s11222-013-9428-y","type":"journal-article","created":{"date-parts":[[2013,11,7]],"date-time":"2013-11-07T12:55:35Z","timestamp":1383828935000},"page":"227-242","source":"Crossref","is-referenced-by-count":15,"title":["Uniform random generation of large acyclic digraphs"],"prefix":"10.1007","volume":"25","author":[{"given":"Jack","family":"Kuipers","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giusi","family":"Moffa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,11,8]]},"reference":[{"key":"9428_CR1","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"I. Alon","year":"1978","unstructured":"Alon, I., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7, 413\u2013423 (1978)","journal-title":"SIAM J. Comput."},{"key":"9428_CR2","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1214\/aos\/1031833662","volume":"25","author":"S.A. Andersson","year":"1997","unstructured":"Andersson, S.A., Madigan, D., Perlman, M.D.: A characterization of Markov equivalence classes for acyclic digraphs. Ann. Stat. 25, 505\u2013541 (1997)","journal-title":"Ann. Stat."},{"key":"9428_CR3","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0095-8956(88)90044-5","volume":"44","author":"E.A. Bender","year":"1988","unstructured":"Bender, E.A., Robinson, R.W.: The asymptotic number of acyclic digraphs. II. J. Comb. Theory, Ser. B 44, 363\u2013369 (1988)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9428_CR4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF02579404","volume":"6","author":"E.A. Bender","year":"1986","unstructured":"Bender, E.A., Richmond, L.B., Robinson, R.W., Wormald, N.C.: The asymptotic number of acyclic digraphs. I. Combinatorica 6, 15\u201322 (1986)","journal-title":"Combinatorica"},{"key":"9428_CR5","unstructured":"Borboudakis, G., Tsamardinos, I.: Scoring Bayesian networks with informative, causal and associative priors. Preprint (2012). arXiv:1209.6561"},{"key":"9428_CR6","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1214\/11-AOS940","volume":"40","author":"D. Colombo","year":"2012","unstructured":"Colombo, D., Maathuis, M.H., Kalisch, M., Richardson, T.S.: Learning high-dimensional directed acyclic graphs with latent and selection variables. Ann. Stat. 40, 294\u2013321 (2012)","journal-title":"Ann. Stat."},{"issue":"2","key":"9428_CR7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1017\/S0269888910000251","volume":"26","author":"R. Daly","year":"2011","unstructured":"Daly, R., Shen, Q., Aitken, S.: Learning Bayesian networks: approaches and issues. Knowl. Eng. Rev. 26(2), 99\u2013157 (2011)","journal-title":"Knowl. Eng. Rev."},{"key":"9428_CR8","doi-asserted-by":"crossref","first-page":"8","DOI":"10.3389\/fgene.2012.00008","volume":"3","author":"F. Emmert-Streib","year":"2012","unstructured":"Emmert-Streib, F., Glazko, G.V., Altay, G., de Matos Simoes, R.: Statistical inference and reverse engineering of gene regulatory networks from observational expression data. Front. Genet. 3, 8 (2012)","journal-title":"Front. Genet."},{"key":"9428_CR9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1020249912095","volume":"50","author":"N. Friedman","year":"2003","unstructured":"Friedman, N., Koller, D.: Being Bayesian about network structure. A\u00a0Bayesian approach to structure discovery in Bayesian networks. Mach. Learn. 50, 95\u2013125 (2003)","journal-title":"Mach. Learn."},{"key":"9428_CR10","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1089\/106652700750050961","volume":"7","author":"N. Friedman","year":"2000","unstructured":"Friedman, N., Linial, M., Nachman, I., Pe\u2019er, D.: Using Bayesian networks to analyze expression data. J. Comput. Biol. 7, 601\u2013620 (2000)","journal-title":"J. Comput. Biol."},{"key":"9428_CR11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0004-3702(02)00264-3","volume":"141","author":"S.B. Gillispie","year":"2002","unstructured":"Gillispie, S.B., Perlman, M.D.: The size distribution for Markov equivalence classes of acyclic digraph models. Artif. Intell. 141, 137\u2013155 (2002)","journal-title":"Artif. Intell."},{"key":"9428_CR12","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10994-008-5057-7","volume":"71","author":"M. Grzegorczyk","year":"2008","unstructured":"Grzegorczyk, M., Husmeier, D.: Improving the structure MCMC sampler for Bayesian networks by introducing a new edge reversal move. Mach. Learn. 71, 265\u2013305 (2008)","journal-title":"Mach. Learn."},{"key":"9428_CR13","first-page":"366","volume-title":"Brazilian Symposium on Artificial Intelligence","author":"J.S. Ide","year":"2002","unstructured":"Ide, J.S., Cozman, F.G.: Random generation of Bayesian networks. In: Brazilian Symposium on Artificial Intelligence, pp. 366\u2013375 (2002)"},{"key":"9428_CR14","first-page":"323","volume-title":"European Conference on Artificial Intelligence","author":"J.S. Ide","year":"2004","unstructured":"Ide, J.S., Cozman, F.G., Ramos, F.T.: Generating random Bayesian networks with constraints on induced width. In: European Conference on Artificial Intelligence, pp. 323\u2013327 (2004)"},{"key":"9428_CR15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1186\/1471-2105-12-89","volume":"12","author":"X. Jiang","year":"2011","unstructured":"Jiang, X., Neapolitan, R., Barmada, M.M., Visweswaran, S.: Learning genetic epistasis using Bayesian network scoring criteria. BMC Bioinform. 12, 89 (2011). doi: 10.1186\/1471-2105-12-89","journal-title":"BMC Bioinform."},{"key":"9428_CR16","first-page":"613","volume":"8","author":"M. Kalisch","year":"2007","unstructured":"Kalisch, M., B\u00fchlmann, P.: Estimating high-dimensional directed acyclic graphs with the PC-algorithm. J. Mach. Learn. Res. 8, 613\u2013636 (2007)","journal-title":"J. Mach. Learn. Res."},{"key":"9428_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v047.i11","volume":"47","author":"M. Kalisch","year":"2012","unstructured":"Kalisch, M., Machler, M., Colombo, D., Maathuis, M.H., Buhlmann, P.: Causal inference using graphical models with the R package pcalg. J. Stat. Softw. 47, 1\u201326 (2012)","journal-title":"J. Stat. Softw."},{"key":"9428_CR18","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","volume-title":"Graphical Models","author":"S.L. Lauritzen","year":"1996","unstructured":"Lauritzen, S.L.: Graphical Models. Clarendon, Oxford (1996)"},{"key":"9428_CR19","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/1120047","volume":"20","author":"V. Liskovets","year":"1976","unstructured":"Liskovets, V.: On the number of maximal vertices of a random acyclic digraph. Theory Probab. Appl. 20, 401\u2013409 (1976)","journal-title":"Theory Probab. Appl."},{"key":"9428_CR20","doi-asserted-by":"crossref","first-page":"215","DOI":"10.2307\/1403615","volume":"63","author":"D. Madigan","year":"1995","unstructured":"Madigan, D., York, J.: Bayesian graphical models for discrete data. Int. Stat. Rev. 63, 215\u2013232 (1995)","journal-title":"Int. Stat. Rev."},{"key":"9428_CR21","doi-asserted-by":"crossref","first-page":"2493","DOI":"10.1080\/03610929608831853","volume":"25","author":"D. Madigan","year":"1996","unstructured":"Madigan, D., Andersson, S.A., Perlman, M.D., Volinsky, C.T.: Bayesian model averaging and model selection for Markov equivalence classes of acyclic digraphs. Commun. Stat., Theory Methods 25, 2493\u20132519 (1996)","journal-title":"Commun. Stat., Theory Methods"},{"key":"9428_CR22","volume":"7","author":"B.D. McKay","year":"2004","unstructured":"McKay, B.D., Oggier, F.O., Royle, G.F., Sloane, N.J.A., Wanless, I.M., Wilf, H.S.: Acyclic digraphs and eigenvalues of (0, 1)-matrices. J. Integer Seq. 7, 04.3.3 (2004)","journal-title":"J. Integer Seq."},{"key":"9428_CR23","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.ipl.2003.06.002","volume":"90","author":"G. Melan\u00e7on","year":"2004","unstructured":"Melan\u00e7on, G., Philippe, F.: Generating connected acyclic digraphs uniformly at random. Inf. Process. Lett. 90, 209\u2013213 (2004)","journal-title":"Inf. Process. Lett."},{"key":"9428_CR24","unstructured":"Melan\u00e7on, G., Dutour, I., Bousquet-M\u00e9lou, M.: Random generation of dags for graph drawing. Tech. rep. CWI INS-R 0005 (2000)"},{"key":"9428_CR25","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/S1571-0653(04)00394-4","volume":"10","author":"G. Melan\u00e7on","year":"2001","unstructured":"Melan\u00e7on, G., Dutour, I., Bousquet-M\u00e9lou, M.: Random generation of directed acyclic graphs. Electron. Notes Discrete Math. 10, 202\u2013207 (2001)","journal-title":"Electron. Notes Discrete Math."},{"key":"9428_CR26","volume-title":"Learning Bayesian Networks","author":"R.E. Neapolitan","year":"2004","unstructured":"Neapolitan, R.E.: Learning Bayesian Networks. Prentice Hall, New York (2004)"},{"key":"9428_CR27","first-page":"352","volume-title":"Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics","author":"J.M. Pe\u00f1a","year":"2007","unstructured":"Pe\u00f1a, J.M.: Approximate counting of graphical models via MCMC. In: Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, pp. 352\u2013359 (2007)"},{"key":"9428_CR28","first-page":"391","volume-title":"Proceedings of the Second Chapel Hill Conference on Combinatorial Mathematics and Its Applications","author":"R.W. Robinson","year":"1970","unstructured":"Robinson, R.W.: Enumeration of acyclic digraphs. In: Proceedings of the Second Chapel Hill Conference on Combinatorial Mathematics and Its Applications, University of North Carolina, Chapel Hill, pp. 391\u2013399 (1970)"},{"key":"9428_CR29","first-page":"239","volume-title":"New Directions in the Theory of Graphs","author":"R.W. Robinson","year":"1973","unstructured":"Robinson, R.W.: Counting labeled acyclic digraphs. In: New Directions in the Theory of Graphs, pp. 239\u2013273. Academic Press, New York (1973)"},{"key":"9428_CR30","series-title":"Springer Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BFb0069178","volume-title":"Combinatorial Mathematics V","author":"R.W. Robinson","year":"1977","unstructured":"Robinson, R.W.: Counting unlabeled acyclic digraphs. In: Combinatorial Mathematics V. Springer Lecture Notes in Mathematics, vol.\u00a0622, pp. 28\u201343 (1977)"},{"key":"9428_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v035.i03","volume":"35","author":"M. Scutari","year":"2010","unstructured":"Scutari, M.: Learning Bayesian networks with the bnlearn R package. J. Stat. Softw. 35, 1\u201322 (2010)","journal-title":"J. Stat. Softw."},{"key":"9428_CR32","unstructured":"Sloane, N.J.A.: The on-line encyclopedia of integer sequences (2013). http:\/\/oeis.org"},{"key":"9428_CR33","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0012-365X(73)90108-8","volume":"5","author":"R.P. Stanley","year":"1973","unstructured":"Stanley, R.P.: Acyclic orientations of graphs. Discrete Math. 5, 171\u2013178 (1973)","journal-title":"Discrete Math."},{"key":"9428_CR34","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0012-365X(02)00838-5","volume":"270","author":"B. Steinsky","year":"2003","unstructured":"Steinsky, B.: Enumeration of labeled chain graphs and labeled essential directed acyclic graphs. Discrete Math. 270, 267\u2013278 (2003)","journal-title":"Discrete Math."},{"key":"9428_CR35","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s00373-004-0569-9","volume":"20","author":"B. Steinsky","year":"2004","unstructured":"Steinsky, B.: Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs. Graphs Comb. 20, 399\u2013411 (2004)","journal-title":"Graphs Comb."},{"key":"9428_CR36","first-page":"485","volume":"111","author":"B. Steinsky","year":"2013","unstructured":"Steinsky, B.: Enumeration of labelled essential graphs. Ars Comb. 111, 485\u2013494 (2013)","journal-title":"Ars Comb."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-013-9428-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11222-013-9428-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-013-9428-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,19]],"date-time":"2024-05-19T08:09:44Z","timestamp":1716106184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11222-013-9428-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,8]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["9428"],"URL":"https:\/\/doi.org\/10.1007\/s11222-013-9428-y","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,8]]}}}