{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T04:00:16Z","timestamp":1793505616706,"version":"4.5.0"},"reference-count":70,"publisher":"Institute of Mathematical Statistics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann. Statist."],"published-print":{"date-parts":[[2025,8,1]]},"abstract":"<jats:p>Hybrid Gibbs samplers represent a prominent class of approximated Gibbs algorithms that utilize Markov chains to approximate conditional distributions, with the Metropolis-within-Gibbs algorithm standing out as a well-known example. Despite their widespread use in both statistical and non-statistical applications, little is known about their convergence properties. This article introduces novel methods for establishing bounds on the convergence rates of certain reversible hybrid Gibbs samplers. In particular, we examine the convergence characteristics of hybrid random-scan Gibbs algorithms. Our analysis reveals that the absolute spectral gap of a hybrid Gibbs chain can be bounded based on the absolute spectral gap of the exact Gibbs chain and the absolute spectral gaps of the Markov chains employed for conditional distribution approximations. We also provide a convergence bound of similar flavors for hybrid data augmentation algorithms, extending existing works on the topic. The general bounds are applied to three examples: a random-scan Metropolis-within-Gibbs sampler, random-scan Gibbs samplers with block updates and a hybrid slice sampler.<\/jats:p>","DOI":"10.1214\/25-aos2516","type":"journal-article","created":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T05:22:32Z","timestamp":1757654552000},"page":"1613-1638","source":"Crossref","is-referenced-by-count":2,"title":["Spectral gap bounds for reversible hybrid Gibbs chains"],"prefix":"10.1214","volume":"53","author":[{"given":"Qian","family":"Qin","sequence":"first","affiliation":[{"name":"School of Statistics, University of Minnesota"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nianqiao","family":"Ju","sequence":"additional","affiliation":[{"name":"Department of Statistics, Purdue University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guanyang","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Statistics, Rutgers University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"108","reference":[{"key":"9","doi-asserted-by":"publisher","unstructured":"<small>Baxendale, P. H.<\/small> (2005). Renewal theory and computable convergence rates for geometrically ergodic Markov chains. <i>Ann. Appl. Probab.<\/i> <b>15<\/b> 700\u2013738.","DOI":"10.1214\/105051604000000710"},{"key":"52","doi-asserted-by":"publisher","unstructured":"<small>Neal, R. M.<\/small> (2003). Slice sampling. <i>Ann. Statist.<\/i> <b>31<\/b> 705\u2013767.","DOI":"10.1214\/aos\/1056562461"},{"key":"28","doi-asserted-by":"crossref","unstructured":"<small>GEMAN, S.<\/small> and <small>GEMAN, D.<\/small> (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. <i>IEEE Trans. Pattern Anal. Mach. Intell.<\/i> <b>PAMI-6<\/b> 721\u2013741.","DOI":"10.1109\/TPAMI.1984.4767596"},{"key":"69","doi-asserted-by":"publisher","unstructured":"<small>VAN DYK, D. A.<\/small> and <small>MENG, X.-L.<\/small> (2001). The art of data augmentation. <i>J. Comput. Graph. Statist.<\/i> <b>10<\/b> 1\u201350.","DOI":"10.1198\/10618600152418584"},{"key":"45","doi-asserted-by":"publisher","unstructured":"<small>LOV\u00c1SZ, L.<\/small> and <small>VEMPALA, S.<\/small> (2004). Hit-and-run from a corner. In <i>Proceedings of the<\/i> 36<i>th Annual ACM Symposium on Theory of Computing<\/i> 310\u2013314. ACM, New York.","DOI":"10.1145\/1007352.1007403"},{"key":"14","doi-asserted-by":"publisher","unstructured":"<small>Caracciolo, S.<\/small>, <small>Pelissetto, A.<\/small> and <small>Sokal, A. D.<\/small> (1990). Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints. <i>J. Stat. Phys.<\/i> <b>60<\/b> 1\u201353.","DOI":"10.1007\/BF01013668"},{"key":"41","doi-asserted-by":"publisher","unstructured":"<small>Liu, J. S.<\/small> (1996). Peskun\u2019s theorem and a modified discrete-state Gibbs sampler. <i>Biometrika<\/i> <b>83<\/b> 681\u2013682.","DOI":"10.1093\/biomet\/83.3.681"},{"key":"47","doi-asserted-by":"publisher","unstructured":"<small>MADRAS, N.<\/small> and <small>RANDALL, D.<\/small> (2002). Markov chain decomposition for convergence rate analysis. <i>Ann. Appl. Probab.<\/i> <b>12<\/b> 581\u2013606.","DOI":"10.1214\/aoap\/1026915617"},{"key":"25","doi-asserted-by":"publisher","unstructured":"<small>DURANTE, D.<\/small> (2019). Conjugate Bayes for probit regression via unified skew-normal distributions. <i>Biometrika<\/i> <b>106<\/b> 765\u2013779.","DOI":"10.1093\/biomet\/asz034"},{"key":"21","doi-asserted-by":"crossref","unstructured":"<small>CHIB, S.<\/small> and <small>GREENBERG, E.<\/small> (1995). Understanding the Metropolis\u2013Hastings algorithm. <i>Amer. Statist.<\/i> <b>49<\/b> 327\u2013335.","DOI":"10.1080\/00031305.1995.10476177"},{"key":"17","doi-asserted-by":"publisher","unstructured":"<small>CASELLA, G.<\/small> and <small>GEORGE, E. I.<\/small> (1992). Explaining the Gibbs sampler. <i>Amer. Statist.<\/i> <b>46<\/b> 167\u2013174.","DOI":"10.2307\/2685208"},{"key":"4","doi-asserted-by":"publisher","unstructured":"<small>ANDRIEU, C.<\/small>, <small>LEE, A.<\/small> and <small>VIHOLA, M.<\/small> (2018). Uniform ergodicity of the iterated conditional SMC and geometric ergodicity of particle Gibbs samplers. <i>Bernoulli<\/i> <b>24<\/b> 842\u2013872.","DOI":"10.3150\/15-BEJ785"},{"key":"29","doi-asserted-by":"publisher","unstructured":"<small>George, E. I.<\/small> and <small>McCulloch, R. E.<\/small> (1993). Variable selection via Gibbs sampling. <i>J. Amer. Statist. Assoc.<\/i> <b>88<\/b> 881\u2013889.","DOI":"10.2307\/2290777"},{"key":"49","doi-asserted-by":"crossref","unstructured":"<small>Metropolis, N.<\/small>, <small>Rosenbluth, A. W.<\/small>, <small>Rosenbluth, M. N.<\/small>, <small>Teller, A. H.<\/small> and <small>Teller, E.<\/small> (1953). Equation of state calculations by fast computing machines. <i>J. Chem. Phys.<\/i> <b>21<\/b> 1087\u20131092.","DOI":"10.1063\/1.1699114"},{"key":"31","doi-asserted-by":"publisher","unstructured":"<small>Greenwood, P. E.<\/small>, <small>McKeague, I. W.<\/small> and <small>Wefelmeyer, W.<\/small> (1998). Information bounds for Gibbs samplers. <i>Ann. Statist.<\/i> <b>26<\/b> 2128\u20132156.","DOI":"10.1214\/aos\/1024691464"},{"key":"36","doi-asserted-by":"publisher","unstructured":"<small>Jones, G. L.<\/small>, <small>Roberts, G. O.<\/small> and <small>Rosenthal, J. S.<\/small> (2014). Convergence of conditional Metropolis\u2013Hastings samplers. <i>Adv. in Appl. Probab.<\/i> <b>46<\/b> 422\u2013445.","DOI":"10.1239\/aap\/1401369701"},{"key":"54","doi-asserted-by":"crossref","unstructured":"<small>Peskun, P. H.<\/small> (1973). Optimum Monte-Carlo sampling using Markov chains. <i>Biometrika<\/i> <b>60<\/b> 607\u2013612.","DOI":"10.1093\/biomet\/60.3.607"},{"key":"35","doi-asserted-by":"publisher","unstructured":"<small>Johnstone, I. M.<\/small> (2001). On the distribution of the largest eigenvalue in principal components analysis. <i>Ann. Statist.<\/i> <b>29<\/b> 295\u2013327.","DOI":"10.1214\/aos\/1009210544"},{"key":"50","doi-asserted-by":"publisher","unstructured":"<small>Mira, A.<\/small> and <small>Tierney, L.<\/small> (2002). Efficiency and convergence properties of slice samplers. <i>Scand. J. Stat.<\/i> <b>29<\/b> 1\u201312.","DOI":"10.1111\/1467-9469.00267"},{"key":"63","doi-asserted-by":"publisher","unstructured":"<small>Roberts, G. O.<\/small> and <small>Rosenthal, J. S.<\/small> (1999). Convergence of slice sampler Markov chains. <i>J. R. Stat. Soc. Ser. B. Stat. Methodol.<\/i> <b>61<\/b> 643\u2013660.","DOI":"10.1111\/1467-9868.00198"},{"key":"64","doi-asserted-by":"publisher","unstructured":"<small>Rudolf, D.<\/small> and <small>Ullrich, M.<\/small> (2013). Positivity of hit-and-run and related algorithms. <i>Electron. Commun. Probab.<\/i> <b>18<\/b> no. 49, 8.","DOI":"10.1214\/ECP.v18-2507"},{"key":"68","doi-asserted-by":"publisher","unstructured":"<small>Tierney, L.<\/small> (1998). A note on Metropolis\u2013Hastings kernels for general state spaces. <i>Ann. Appl. Probab.<\/i> <b>8<\/b> 1\u20139.","DOI":"10.1214\/aoap\/1027961031"},{"key":"16","doi-asserted-by":"publisher","unstructured":"<small>CARLEN, E. A.<\/small>, <small>CARVALHO, M. C.<\/small> and <small>LOSS, M.<\/small> (2003). Determination of the spectral gap for Kac\u2019s master equation and related stochastic evolution. <i>Acta Math.<\/i> <b>191<\/b> 1\u201354.","DOI":"10.1007\/BF02392695"},{"key":"8","doi-asserted-by":"publisher","unstructured":"<small>ATCHAD\u00c9, Y. F.<\/small> (2021). Approximate spectral gaps for Markov chain mixing times in high dimensions. <i>SIAM J. Math. Data Sci.<\/i> <b>3<\/b> 854\u2013872.","DOI":"10.1137\/19M1283082"},{"key":"44","doi-asserted-by":"publisher","unstructured":"<small>LOV\u00c1SZ, L.<\/small> and <small>SIMONOVITS, M.<\/small> (1993). Random walks in a convex body and an improved volume algorithm. <i>Random Structures Algorithms<\/i> <b>4<\/b> 359\u2013412.","DOI":"10.1002\/rsa.3240040402"},{"key":"18","doi-asserted-by":"publisher","unstructured":"<small>CHANG, J. T.<\/small> and <small>POLLARD, D.<\/small> (1997). Conditioning as disintegration. <i>Stat. Neerl.<\/i> <b>51<\/b> 287\u2013317.","DOI":"10.1111\/1467-9574.00056"},{"key":"70","doi-asserted-by":"publisher","unstructured":"<small>WANG, E. T.<\/small>, <small>CHIANG, S.<\/small>, <small>HANEEF, Z.<\/small>, <small>RAO, V. R.<\/small>, <small>MOSS, R.<\/small> and <small>VANNUCCI, M.<\/small> (2023). Bayesian non-homogeneous hidden Markov model with variable selection for investigating drivers of seizure risk cycling. <i>Ann. Appl. Stat.<\/i> <b>17<\/b> 333\u2013356.","DOI":"10.1214\/22-aoas1630"},{"key":"1","doi-asserted-by":"publisher","unstructured":"<small>ANARI, N.<\/small>, <small>LIU, K.<\/small> and <small>GHARAN, S. O.<\/small> (2024). Spectral independence in high-dimensional expanders and applications to the hardcore model. <i>SIAM J. Comput.<\/i> <b>53<\/b> FOCS20-1\u2013FOCS20-37.","DOI":"10.1137\/20M1367696"},{"key":"3","doi-asserted-by":"publisher","unstructured":"<small>ANDRIEU, C.<\/small>, <small>LEE, A.<\/small>, <small>POWER, S.<\/small> and <small>WANG, A. Q.<\/small> (2024). Explicit convergence bounds for Metropolis Markov chains: Isoperimetry, spectral gaps and profiles. <i>Ann. Appl. Probab.<\/i> <b>34<\/b> 4022\u20134071.","DOI":"10.1214\/24-aap2058"},{"key":"5","doi-asserted-by":"publisher","unstructured":"<small>ANDRIEU, C.<\/small>, <small>LEE, A.<\/small> and <small>VIHOLA, M.<\/small> (2018). Supplement to \u201cUniform ergodicity of the iterated conditional SMC and geometric ergodicity of particle Gibbs samplers\u201d.","DOI":"10.3150\/15-BEJ785SUPP"},{"key":"6","doi-asserted-by":"publisher","unstructured":"<small>ARVESON, W. GEHRING, F.<\/small> and <small>RIBET, K.<\/small> (2002). <i>A Short Course on Spectral Theory<\/i>. <i>Graduate Texts in Mathematics<\/i> <b>209<\/b>. Springer, New York.","DOI":"10.1007\/b97227"},{"key":"7","unstructured":"<small>ASCOLANI, F.<\/small>, <small>ROBERTS, G. O.<\/small> and <small>ZANELLA, G.<\/small> (2024). Scalability of Metropolis-within-Gibbs schemes for high-dimensional Bayesian models. arXiv preprint."},{"key":"10","doi-asserted-by":"publisher","unstructured":"<small>BLANCA, A.<\/small>, <small>CAPUTO, P.<\/small>, <small>CHEN, Z.<\/small>, <small>PARISI, D.<\/small>, <small>\u0160TEFANKOVI\u010c, D.<\/small> and <small>VIGODA, E.<\/small> (2022). On mixing of Markov chains: Coupling, spectral independence, and entropy factorization. In <i>Proceedings of the<\/i> 2022 <i>Annual ACM\u2013SIAM Symposium on Discrete Algorithms<\/i> (<i>SODA<\/i>) 3670\u20133692. SIAM, Philadelphia.","DOI":"10.1137\/1.9781611977073.145"},{"key":"11","doi-asserted-by":"publisher","unstructured":"<small>B\u00d6HNING, D.<\/small> (1999). The lower bound method in probit regression. <i>Comput. Statist. Data Anal.<\/i> <b>30<\/b> 13\u201317.","DOI":"10.1016\/S0167-9473(98)00094-2"},{"key":"12","doi-asserted-by":"publisher","unstructured":"<small>BOTEV, Z. I.<\/small> (2017). The normal law under linear restrictions: Simulation and estimation via minimax tilting. <i>J. R. Stat. Soc. Ser. B. Stat. Methodol.<\/i> <b>79<\/b> 125\u2013148.","DOI":"10.1111\/rssb.12162"},{"key":"13","unstructured":"<small>BRUCKNER, A. M.<\/small>, <small>BRUCKNER, J. B.<\/small> and <small>THOMSON, B. S.<\/small> (2008). <i>Real Analysis<\/i>, 2nd ed. <a href=\"http:\/\/ClassicalRealAnalysis.com\">ClassicalRealAnalysis.com<\/a>."},{"key":"15","unstructured":"<small>CARACCIOLO, S.<\/small>, <small>PELISSETTO, A.<\/small> and <small>SOKAL, A. D.<\/small> (1992). Two remarks on simulated tempering. Unpublished manuscript."},{"key":"19","doi-asserted-by":"publisher","unstructured":"<small>CHEN, Z.<\/small>, <small>GALANIS, A.<\/small>, <small>\u0160TEFANKOVI\u010c, D.<\/small> and <small>VIGODA, E.<\/small> (2021). Rapid mixing for colorings via spectral independence. In <i>Proceedings of the<\/i> 2021 <i>ACM\u2013SIAM Symposium on Discrete Algorithms<\/i> (<i>SODA<\/i>) 1548\u20131557. SIAM, Philadelphia.","DOI":"10.1137\/1.9781611976465.94"},{"key":"20","doi-asserted-by":"crossref","unstructured":"<small>CHEN, Z.<\/small>, <small>LIU, K.<\/small> and <small>VIGODA, E.<\/small> (2021). Optimal mixing of Glauber dynamics: Entropy factorization via high-dimensional expansion. In <i>STOC \u2019<\/i>21<i>\u2014Proceedings of the<\/i> 53<i>rd Annual ACM SIGACT Symposium on Theory of Computing<\/i> 1537\u20131550. ACM, New York.","DOI":"10.1145\/3406325.3451035"},{"key":"22","doi-asserted-by":"publisher","unstructured":"<small>CHOPIN, N.<\/small> (2011). Fast simulation of truncated Gaussian distributions. <i>Stat. Comput.<\/i> <b>21<\/b> 275\u2013288.","DOI":"10.1007\/s11222-009-9168-1"},{"key":"23","unstructured":"<small>DEMIDENKO, E.<\/small> (2001). Computational aspects of probit model. <i>Math. Commun.<\/i> <b>6<\/b> 233\u2013247."},{"key":"24","unstructured":"<small>DIACONIS, P.<\/small> and <small>FREEDMAN, D.<\/small> (1998). On the hit and run process technical report."},{"key":"26","doi-asserted-by":"crossref","unstructured":"<small>FENG, W.<\/small>, <small>GUO, H.<\/small>, <small>YIN, Y.<\/small> and <small>ZHANG, C.<\/small> (2022). Rapid mixing from spectral independence beyond the Boolean domain. <i>ACM Trans. Algorithms<\/i> <b>18<\/b> Art. 28, 32.","DOI":"10.1145\/3531008"},{"key":"27","doi-asserted-by":"publisher","unstructured":"<small>FORT, G.<\/small>, <small>MOULINES, E.<\/small>, <small>ROBERTS, G. O.<\/small> and <small>ROSENTHAL, J. S.<\/small> (2003). On the geometric ergodicity of hybrid samplers. <i>J. Appl. Probab.<\/i> <b>40<\/b> 123\u2013146.","DOI":"10.1239\/jap\/1044476831"},{"key":"30","doi-asserted-by":"crossref","unstructured":"<small>GILKS, W. R.<\/small>, <small>BEST, N. G.<\/small> and <small>TAN, K. K. C.<\/small> (1995). Adaptive rejection Metropolis sampling within Gibbs sampling. <i>J. R. Stat. Soc<\/i>., <i>Ser. C, Appl. Stat.<\/i> <b>44<\/b> 455\u2013472.","DOI":"10.2307\/2986138"},{"key":"32","unstructured":"<small>HELMBERG, G.<\/small> (2014). <i>Introduction to Spectral Theory in Hilbert Space<\/i>. <i>North-Holland Series in Applied Mathematics and Mechanics<\/i> <b>6<\/b>. North-Holland, Amsterdam."},{"key":"33","doi-asserted-by":"crossref","unstructured":"<small>HOBERT, J. P.<\/small> (2011). The data augmentation algorithm: Theory and methodology. In <i>Handbook of Markov Chain Monte Carlo<\/i> (S. Brooks, A. Gelman, G. Jones and X. L. Meng, eds.). <i>Chapman &amp; Hall\/CRC Handb. Mod. Stat. Methods<\/i> 253\u2013293. CRC Press, Boca Raton, FL.","DOI":"10.1201\/b10905-11"},{"key":"34","doi-asserted-by":"publisher","unstructured":"<small>JAIN, V.<\/small>, <small>PHAM, H. T.<\/small> and <small>VUONG, T.-D.<\/small> (2022). Spectral independence, coupling, and the spectral gap of the Glauber dynamics. <i>Inform. Process. Lett.<\/i> <b>177<\/b> Paper No. 106268, 7.","DOI":"10.1016\/j.ipl.2022.106268"},{"key":"37","doi-asserted-by":"crossref","unstructured":"<small>JU, N.<\/small>, <small>AWAN, J.<\/small>, <small>GONG, R.<\/small> and <small>RAO, V.<\/small> (2022). Data augmentation MCMC for Bayesian inference from privatized data. <i>Adv. Neural Inf. Process. Syst.<\/i> <b>35<\/b> 12732\u201312743.","DOI":"10.52202\/068431-0925"},{"key":"38","unstructured":"<small>KAROUI, N. E.<\/small> (2003). On the largest eigenvalue of Wishart matrices with identity covariance when <i>n<\/i>, <i>p<\/i> and <math xmlns=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" overflow=\"scroll\" id=\"eq_5\"><mi mathvariant=\"italic\">p<\/mi><mo stretchy=\"false\">\/<\/mo><mi mathvariant=\"italic\">n<\/mi><mo stretchy=\"false\">\u2192<\/mo><mi>\u221e<\/mi><\/math>. arXiv preprint."},{"key":"39","doi-asserted-by":"publisher","unstructured":"<small>\u0141ATUSZY\u0143SKI, K.<\/small> and <small>RUDOLF, D.<\/small> (2024). Convergence of hybrid slice sampling via spectral gap. <i>Adv. in Appl. Probab.<\/i> <b>56<\/b> 1440\u20131466.","DOI":"10.1017\/apr.2024.16"},{"key":"40","doi-asserted-by":"publisher","unstructured":"<small>LAWLER, G. F.<\/small> and <small>SOKAL, A. D.<\/small> (1988). Bounds on the <math xmlns=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" overflow=\"scroll\" id=\"eq_6\"><msup><mrow><mi mathvariant=\"italic\">L<\/mi><\/mrow><mrow><mn>2<\/mn><\/mrow><\/msup><\/math> spectrum for Markov chains and Markov processes: A generalization of Cheeger\u2019s inequality. <i>Trans. Amer. Math. Soc.<\/i> <b>309<\/b> 557\u2013580.","DOI":"10.2307\/2000925"},{"key":"42","doi-asserted-by":"crossref","unstructured":"<small>LIU, J. S.<\/small>, <small>WONG, W. H.<\/small> and <small>KONG, A.<\/small> (1995). Covariance structure and convergence rate of the Gibbs sampler with various scans. <i>J. Roy. Statist. Soc. Ser. B, Methodol.<\/i> <b>57<\/b> 157\u2013169.","DOI":"10.1111\/j.2517-6161.1995.tb02021.x"},{"key":"43","doi-asserted-by":"publisher","unstructured":"<small>LOV\u00c1SZ, L.<\/small> (1999). Hit-and-run mixes fast. <i>Math. Program.<\/i> <b>86<\/b> 443\u2013461.","DOI":"10.1007\/s101070050099"},{"key":"46","doi-asserted-by":"publisher","unstructured":"<small>MADRAS, N.<\/small> and <small>PICCIONI, M.<\/small> (1999). Importance sampling for families of distributions. <i>Ann. Appl. Probab.<\/i> <b>9<\/b> 1202\u20131225.","DOI":"10.1214\/aoap\/1029962870"},{"key":"48","unstructured":"<small>MATTEI, P.-A.<\/small> and <small>FRELLSEN, J.<\/small> (2018). Leveraging the exact likelihood of deep latent variable models. <i>Adv. Neural Inf. Process. Syst.<\/i> <b>31<\/b>."},{"key":"51","doi-asserted-by":"publisher","unstructured":"<small>NATAROVSKII, V.<\/small>, <small>RUDOLF, D.<\/small> and <small>SPRUNGK, B.<\/small> (2021). Quantitative spectral gap estimate and Wasserstein contraction of simple slice sampling. <i>Ann. Appl. Probab.<\/i> <b>31<\/b> 806\u2013825.","DOI":"10.1214\/20-aap1605"},{"key":"53","unstructured":"<small>NEATH, R. C.<\/small> and <small>JONES, G. L.<\/small> (2009). Variable-at-a-time implementations of Metropolis\u2013Hastings. arXiv preprint."},{"key":"55","unstructured":"<small>POWER, S.<\/small>, <small>RUDOLF, D.<\/small>, <small>SPRUNGK, B.<\/small> and <small>WANG, A. Q.<\/small> (2024). Weak Poincar\u00e9 inequality comparisons for ideal and hybrid slice sampling. arXiv preprint."},{"key":"56","doi-asserted-by":"crossref","unstructured":"<small>PRATT, J. W.<\/small> (1981). Concavity of the log likelihood. <i>J. Amer. Statist. Assoc.<\/i> <b>76<\/b> 103\u2013106.","DOI":"10.1080\/01621459.1981.10477613"},{"key":"57","doi-asserted-by":"publisher","unstructured":"<small>QIN, Q.<\/small> (2024). Geometric ergodicity of trans-dimensional Markov chain Monte Carlo algorithms. <i>J. Amer. Statist. Assoc.<\/i>","DOI":"10.1080\/01621459.2024.2427432"},{"key":"59","doi-asserted-by":"crossref","unstructured":"<small>QIN, Q.<\/small>, <small>JU, N.<\/small> and <small>WANG, G.<\/small> (2025). Supplement to \u201cSpectral gap bounds for reversible hybrid Gibbs chains.\u201d <a href=\"https:\/\/doi.org\/10.1214\/25-AOS2516SUPP\">https:\/\/doi.org\/10.1214\/25-AOS2516SUPP<\/a>","DOI":"10.1214\/25-AOS2516SUPP"},{"key":"61","doi-asserted-by":"publisher","unstructured":"<small>ROBERTS, G. O.<\/small> and <small>ROSENTHAL, J. S.<\/small> (1997). Geometric ergodicity and hybrid Markov chains. <i>Electron. Commun. Probab.<\/i> <b>2<\/b> no. 2, 13\u201325.","DOI":"10.1214\/ECP.v2-981"},{"key":"62","doi-asserted-by":"publisher","unstructured":"<small>ROBERTS, G. O.<\/small> and <small>ROSENTHAL, J. S.<\/small> (1998). Two convergence properties of hybrid samplers. <i>Ann. Appl. Probab.<\/i> <b>8<\/b> 397\u2013407.","DOI":"10.1214\/aoap\/1028903533"},{"key":"65","doi-asserted-by":"crossref","unstructured":"<small>SCHAMBERGER, B.<\/small>, <small>GRUBER, L. F.<\/small> and <small>CZADO, C.<\/small> (2017). Bayesian inference for latent factor copulas and application to financial risk forecasting. <i>Econometrics<\/i> <b>5<\/b>.","DOI":"10.3390\/econometrics5020021"},{"key":"66","doi-asserted-by":"publisher","unstructured":"<small>SMITH, R. L.<\/small> (1984). Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. <i>Oper. Res.<\/i> <b>32<\/b> 1296\u20131308.","DOI":"10.1287\/opre.32.6.1296"},{"key":"58","doi-asserted-by":"publisher","unstructured":"<small>QIN, Q.<\/small> and <small>JONES, G. L.<\/small> (2022). Convergence rates of two-component MCMC samplers. <i>Bernoulli<\/i> <b>28<\/b> 859\u2013885.","DOI":"10.3150\/21-bej1369"},{"key":"67","doi-asserted-by":"crossref","unstructured":"<small>TANNER, M. A.<\/small> and <small>WONG, W. H.<\/small> (1987). The calculation of posterior distributions by data augmentation. <i>J. Amer. Statist. Assoc.<\/i> <b>82<\/b> 528\u2013540.","DOI":"10.1080\/01621459.1987.10478458"},{"key":"2","doi-asserted-by":"publisher","unstructured":"<small>ANDRIEU, C.<\/small>, <small>LEE, A.<\/small>, <small>POWER, S.<\/small> and <small>WANG, A. Q.<\/small> (2022). Comparison of Markov chains via weak Poincar\u00e9 inequalities with application to pseudo-marginal MCMC. <i>Ann. Statist.<\/i> <b>50<\/b> 3592\u20133618.","DOI":"10.1214\/22-aos2241"},{"key":"60","doi-asserted-by":"publisher","unstructured":"<small>QIN, Q.<\/small> and <small>WANG, G.<\/small> (2024). Spectral telescope: Convergence rate bounds for random-scan Gibbs samplers based on a hierarchical structure. <i>Ann. Appl. Probab.<\/i> <b>34<\/b> 1319\u20131349.","DOI":"10.1214\/23-aap1992"}],"container-title":["The Annals of Statistics"],"original-title":[],"deposited":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T16:37:51Z","timestamp":1791391071000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/annals-of-statistics\/volume-53\/issue-4\/Spectral-gap-bounds-for-reversible-hybrid-Gibbs-chains\/10.1214\/25-AOS2516.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"references-count":70,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,8,1]]}},"URL":"https:\/\/doi.org\/10.1214\/25-aos2516","relation":{},"ISSN":["0090-5364","2168-8966"],"issn-type":[{"value":"0090-5364","type":"print"},{"value":"2168-8966","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,1]]}}}