{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T02:47:27Z","timestamp":1772938047597,"version":"3.50.1"},"reference-count":44,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T00:00:00Z","timestamp":1787356800000},"content-version":"am","delay-in-days":233,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1954042"],"award-info":[{"award-number":["1954042"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Advances in Applied Mathematics"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1016\/j.aam.2025.102955","type":"journal-article","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T10:56:15Z","timestamp":1755860175000},"page":"102955","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Counting the number of group orbits by marrying the Burnside process with importance sampling"],"prefix":"10.1016","volume":"172","author":[{"given":"Persi","family":"Diaconis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8481-7269","authenticated-orcid":false,"given":"Chenyang","family":"Zhong","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.aam.2025.102955_br0180","author":"Aldous"},{"key":"10.1016\/j.aam.2025.102955_br0360","author":"Bartholdi"},{"key":"10.1016\/j.aam.2025.102955_br0310","series-title":"Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing","first-page":"50","article-title":"How hard is it to marry at random? (On the approximation of the permanent)","author":"Broder","year":"1986"},{"issue":"421","key":"10.1016\/j.aam.2025.102955_br0420","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1080\/01621459.1993.10594330","article-title":"Estimating the number of species: a review","volume":"88","author":"Bunge","year":"1993","journal-title":"J. Am. Stat. Assoc."},{"key":"10.1016\/j.aam.2025.102955_br0270","series-title":"Inference in Hidden Markov Models","author":"Capp\u00e9","year":"2006"},{"issue":"2","key":"10.1016\/j.aam.2025.102955_br0070","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1214\/17-AAP1326","article-title":"The sample size required in importance sampling","volume":"28","author":"Chatterjee","year":"2018","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/j.aam.2025.102955_br0200","series-title":"Mixing times for Burnside processes","author":"Chen","year":"2006"},{"issue":"3","key":"10.1016\/j.aam.2025.102955_br0190","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.anihpb.2004.09.007","article-title":"Analysis of a Bose-Einstein Markov chain","volume":"41","author":"Diaconis","year":"2005","journal-title":"Ann. Inst. Henri Poincar\u00e9 Probab. Stat."},{"key":"10.1016\/j.aam.2025.102955_br0370","author":"Diaconis"},{"key":"10.1016\/j.aam.2025.102955_br0390","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.jalgebra.2021.05.010","article-title":"Statistical enumeration of groups by double cosets","volume":"607","author":"Diaconis","year":"2022","journal-title":"J. Algebra"},{"issue":"7","key":"10.1016\/j.aam.2025.102955_br0140","doi-asserted-by":"crossref","first-page":"3501","DOI":"10.1090\/S0002-9947-09-04521-8","article-title":"Supercharacter formulas for pattern groups","volume":"361","author":"Diaconis","year":"2009","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/j.aam.2025.102955_br0380","author":"Diaconis"},{"issue":"2","key":"10.1016\/j.aam.2025.102955_br0220","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s11139-021-00482-z","article-title":"Hahn polynomials and the Burnside process","volume":"61","author":"Diaconis","year":"2023","journal-title":"Ramanujan J."},{"key":"10.1016\/j.aam.2025.102955_br0210","series-title":"Counting linear extensions and contingency tables","author":"Dittmer","year":"2019"},{"issue":"2","key":"10.1016\/j.aam.2025.102955_br0030","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1006\/inco.1993.1045","article-title":"Automating P\u00f3lya theory: the computational complexity of the cycle index polynomial","volume":"105","author":"Goldberg","year":"1993","journal-title":"Inf. Comput."},{"key":"10.1016\/j.aam.2025.102955_br0170","series-title":"Randomization and Approximation Techniques in Computer Science","first-page":"331","article-title":"The \u201cBurnside process\u201d converges slowly","volume":"vol. 1518","author":"Goldberg","year":"1998"},{"key":"10.1016\/j.aam.2025.102955_br0050","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1112\/S1461157000000243","article-title":"Counting unlabelled subtrees of a tree is #P-complete","volume":"3","author":"Goldberg","year":"2000","journal-title":"LMS J. Comput. Math."},{"issue":"3\u20134","key":"10.1016\/j.aam.2025.102955_br0410","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1093\/biomet\/40.3-4.237","article-title":"The population frequencies of species and the estimation of population parameters","volume":"40","author":"Good","year":"1953","journal-title":"Biometrika"},{"key":"10.1016\/j.aam.2025.102955_br0250","series-title":"Monte Carlo Methods","author":"Hammersley","year":"1965"},{"key":"10.1016\/j.aam.2025.102955_br0080","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1112\/plms\/s3-10.1.24","article-title":"Enumerating p-groups. I. Inequalities","volume":"10","author":"Higman","year":"1960","journal-title":"Proc. Lond. Math. Soc. (3)"},{"key":"10.1016\/j.aam.2025.102955_br0060","series-title":"Expanding Graphs","first-page":"37","article-title":"Uniform sampling modulo a group of symmetries using Markov chain simulation","volume":"vol. 10","author":"Jerrum","year":"1993"},{"key":"10.1016\/j.aam.2025.102955_br0040","series-title":"Surveys in Combinatorics","first-page":"103","article-title":"Computational P\u00f3lya theory","volume":"vol. 218","author":"Jerrum","year":"1995"},{"key":"10.1016\/j.aam.2025.102955_br0340","series-title":"Counting, Sampling and Integrating: Algorithms and Complexity","author":"Jerrum","year":"2003"},{"key":"10.1016\/j.aam.2025.102955_br0320","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","article-title":"Random generation of combinatorial structures from a uniform distribution","volume":"43","author":"Jerrum","year":"1986","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.aam.2025.102955_br0010","series-title":"Groups St. Andrews 2001 in Oxford. Vol. II","first-page":"306","article-title":"Orbits in finite group actions","volume":"vol. 305","author":"Keller","year":"2003"},{"key":"10.1016\/j.aam.2025.102955_br0160","article-title":"Finite Markov Chains","author":"Kemeny","year":"1976"},{"key":"10.1016\/j.aam.2025.102955_br0280","series-title":"Monte Carlo Strategies in Scientific Computing","author":"Liu","year":"2008"},{"issue":"4","key":"10.1016\/j.aam.2025.102955_br0290","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1214\/aoap\/1029962870","article-title":"Importance sampling for families of distributions","volume":"9","author":"Madras","year":"1999","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/j.aam.2025.102955_br0110","series-title":"Constructing modules of algebra groups","author":"Marberg","year":"2008"},{"issue":"1","key":"10.1016\/j.aam.2025.102955_br0150","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.jalgebra.2011.07.035","article-title":"Combinatorial methods of character enumeration for the unitriangular group","volume":"345","author":"Marberg","year":"2011","journal-title":"J. Algebra"},{"key":"10.1016\/j.aam.2025.102955_br0240","author":"Paguyo"},{"key":"10.1016\/j.aam.2025.102955_br0090","author":"Pak"},{"issue":"449","key":"10.1016\/j.aam.2025.102955_br0400","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1080\/01621459.2000.10473926","article-title":"Capture-recapture models","volume":"95","author":"Pollock","year":"2000","journal-title":"J. Am. Stat. Assoc."},{"key":"10.1016\/j.aam.2025.102955_br0020","series-title":"Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds","author":"P\u00f3lya","year":"1987"},{"issue":"1","key":"10.1016\/j.aam.2025.102955_br0230","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10959-020-01049-2","article-title":"Mixing times for the commuting chain on CA groups","volume":"35","author":"Rahmani","year":"2022","journal-title":"J. Theor. Probab."},{"key":"10.1016\/j.aam.2025.102955_br0300","article-title":"Monte Carlo Statistical Methods","volume":"vol. 274","author":"Robert","year":"2004"},{"key":"10.1016\/j.aam.2025.102955_br0350","series-title":"Algorithms for Random Generation and Counting: a Markov Chain Approach","author":"Sinclair","year":"2012"},{"issue":"1","key":"10.1016\/j.aam.2025.102955_br0330","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","article-title":"Approximate counting, uniform generation and rapidly mixing Markov chains","volume":"82","author":"Sinclair","year":"1989","journal-title":"Inf. Comput."},{"issue":"6","key":"10.1016\/j.aam.2025.102955_br0120","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1515\/jgth-2016-0016","article-title":"Upper bounds on the number of conjugacy classes in unitriangular groups","volume":"19","author":"Soffer","year":"2016","journal-title":"J. Group Theory"},{"key":"10.1016\/j.aam.2025.102955_br0130","series-title":"Combinatorics of conjugacy classes in Un(Fq)","author":"Soffer","year":"2016"},{"issue":"7","key":"10.1016\/j.aam.2025.102955_br0430","doi-asserted-by":"crossref","first-page":"2139","DOI":"10.2307\/1941617","article-title":"On the Bayesian estimation of the number of species in a community","volume":"75","author":"Solow","year":"1994","journal-title":"Ecology"},{"key":"10.1016\/j.aam.2025.102955_br0260","series-title":"Importance Sampling: Applications in Communications and Detection","author":"Srinivasan","year":"2002"},{"key":"10.1016\/j.aam.2025.102955_br0100","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0024-3795(03)00371-9","article-title":"Conjugacy classes in unitriangular matrices","volume":"370","author":"Vera-L\u00f3pez","year":"2003","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.aam.2025.102955_br0440","series-title":"Mixing time of the commuting chain on the symmetric group","author":"Zhong","year":"2024"}],"container-title":["Advances in Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196885825001174?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196885825001174?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:53:02Z","timestamp":1772808782000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196885825001174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":44,"alternative-id":["S0196885825001174"],"URL":"https:\/\/doi.org\/10.1016\/j.aam.2025.102955","relation":{},"ISSN":["0196-8858"],"issn-type":[{"value":"0196-8858","type":"print"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Counting the number of group orbits by marrying the Burnside process with importance sampling","name":"articletitle","label":"Article Title"},{"value":"Advances in Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.aam.2025.102955","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102955"}}