Jeffrey S. Rosenthal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Jeffrey S. Rosenthal has a total of 72 co-authors. Here are the top co-authors by number of shared publications:
- Gareth O. Roberts
Department of Statistics, University of Warwick, Coventry, UK
13 shared publications - Gareth O. Roberts
Lancaster University, Department of Mathematics and Statistics, Lancaster, UK, LA1 4YF
8 shared publications - Duncan J. Murdoch
Department of Statistical and Actuarial Sciences, University of Western Ontario, London, Ontario N6G 2E9, Canada
4 shared publications - James Allen Fill
The Johns Hopkins University
4 shared publications - Motoya Machida
Department of Mathematical Sciences, The Johns Hopkins University, Baltimore, Maryland 21218–2682
4 shared publications Gareth O. Roberts
Department of Statistics University of Warwick Coventry CV4 7AL UK
3 shared publications
Latest Publications
- 15 July 2026
- Published by Taylor & Francis in Stochastic Models
- p. 1-42
Estimating MCMC convergence rates using common random number simulations
- 15 July 2026
- Published by Taylor & Francis in Stochastic Models
- p. 1-42
Estimating MCMC convergence rates using common random number simulations
- 3 April 2026
- Published by Taylor & Francis in CHANCE
- Vol. 39 (2) , 28-34
Friday the 13th, Full Moons, and Holiday Blues: Ontario Death Date Distributions
A dark sky with a large blue moon, featuring the text "FRIDAY 13TH" prominently displayed, alongside tree branches.Among society’s many superstitions is fear of Friday the 13th (“paraskevidekatriap...
- 3 April 2026
- Published by Taylor & Francis in CHANCE
- Vol. 39 (2) , 28-34
Friday the 13th, Full Moons, and Holiday Blues: Ontario Death Date Distributions
A dark sky with a large blue moon, featuring the text "FRIDAY 13TH" prominently displayed, alongside tree branches.Among society’s many superstitions is fear of Friday the 13th (“paraskevidekatriap...
- Open Access
- 15 January 2026
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 58 (3) , 1-31
Comparing the Efficiency of General State Space Reversible MCMC Algorithms
We prove new results about comparing the efficiency of general state space Markov chain Monte Carlo algorithms that randomly select a possibly different reversible method at each step (previously known only for finite state spaces). We also provide new, simpler, more accessible proofs of key results, and analyse numerous examples. We provide a full proof of the formula for the asymptotic variance for real-valued functionals on $\varphi$ -irreducible reversible Markov chains, first introduced by Kipnis and Varadhan (1986, Commun. Math. Phys. 104 , 1–19). Given two Markov kernels P and Q with stationary measure $\pi$ , we say that the Markov kernel P efficiency-dominates the Markov kernel Q if the asymptotic variance with respect to P is at most the asymptotic variance with respect to Q for every real-valued functional $f\in L^2(\pi)$ . Assuming only a basic background in functional analysis, we prove that for two reversible Markov kernels P and Q , P efficiency-dominates Q if and only if the operator $\mathcal{Q}-\mathcal{P}$ , where $\mathcal{P}$ is the operator on $L^2(\pi)$ that maps $f\mapsto\int f(y)P(\cdot,\mathrm{d}y)$ and similarly for $\mathcal{Q}$ , is positive on $L^2(\pi)$ , i.e. $\langle f,\left(\mathcal{Q}-\mathcal{P}\right)f\rangle\geq0$ for every $f\in L^2(\pi)$ (previous proofs for general state spaces use technical results from monotone operator function theory). We use this result to show that under mild conditions, sandwich variants of data augmentation algorithms efficiency-dominate the original algorithm. We also provide other easy-to-check sufficient conditions for efficiency dominance, some of which are generalized from the finite state space case. We also provide a proof based on that of Tierney (1998, Ann. Appl. Prob. 8 , 1–9) that Peskun dominance is a sufficient condition for efficiency dominance for reversible kernels. Using these results, we show that Markov kernels formed by random selection of other ‘component’ Markov kernels will always efficiency-dominate another Markov kernel formed in this way, as long as the component kernels of the former efficiency-dominate those of the latter. These results on the efficiency dominance of combining component kernels generalizes the results on the efficiency dominance of combined chains introduced by Neal and Rosenthal (2024, J. Appl. Prob. 62 , 188–208) from finite state spaces to general state spaces.- 15 January 2026
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 58 (3) , 1-31
Open AccessComparing the Efficiency of General State Space Reversible MCMC Algorithms
We prove new results about comparing the efficiency of general state space Markov chain Monte Carlo algorithms that randomly select a possibly different reversible method at each step (previously known only for finite state spaces). We also provide new, simpler, more accessible proofs of key results, and analyse numerous examples. We provide a full proof of the formula for the asymptotic variance for real-valued functionals on $\varphi$ -irreducible reversible Markov chains, first introduced by Kipnis and Varadhan (1986, Commun. Math. Phys. 104 , 1–19). Given two Markov kernels P and Q with stationary measure $\pi$ , we say that the Markov kernel P efficiency-dominates the Markov kernel Q if the asymptotic variance with respect to P is at most the asymptotic variance with respect to Q for every real-valued functional $f\in L^2(\pi)$ . Assuming only a basic background in functional analysis, we prove that for two reversible Markov kernels P and Q , P efficiency-dominates Q if and only if the operator $\mathcal{Q}-\mathcal{P}$ , where $\mathcal{P}$ is the operator on $L^2(\pi)$ that maps $f\mapsto\int f(y)P(\cdot,\mathrm{d}y)$ and similarly for $\mathcal{Q}$ , is positive on $L^2(\pi)$ , i.e. $\langle f,\left(\mathcal{Q}-\mathcal{P}\right)f\rangle\geq0$ for every $f\in L^2(\pi)$ (previous proofs for general state spaces use technical results from monotone operator function theory). We use this result to show that under mild conditions, sandwich variants of data augmentation algorithms efficiency-dominate the original algorithm. We also provide other easy-to-check sufficient conditions for efficiency dominance, some of which are generalized from the finite state space case. We also provide a proof based on that of Tierney (1998, Ann. Appl. Prob. 8 , 1–9) that Peskun dominance is a sufficient condition for efficiency dominance for reversible kernels. Using these results, we show that Markov kernels formed by random selection of other ‘component’ Markov kernels will always efficiency-dominate another Markov kernel formed in this way, as long as the component kernels of the former efficiency-dominate those of the latter. These results on the efficiency dominance of combining component kernels generalizes the results on the efficiency dominance of combined chains introduced by Neal and Rosenthal (2024, J. Appl. Prob. 62 , 188–208) from finite state spaces to general state spaces. - Open Access
- 30 April 2025
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 62 (4) , 1318-1339
Weak convergence of adaptive Markov chain Monte Carlo
We develop general conditions for weak convergence of adaptive Markov chain Monte Carlo processes and this is shown to imply a weak law of large numbers for bounded Lipschitz continuous functions. This allows an estimation theory for adaptive Markov chain Monte Carlo where previously developed theory in total variation may fail or be difficult to establish. Extensions of weak convergence to general Wasserstein distances are established, along with a weak law of large numbers for possibly unbounded Lipschitz functions. Applications are applied to autoregressive processes in various settings, unadjusted Langevin processes, and adaptive Metropolis–Hastings.
- 30 April 2025
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 62 (4) , 1318-1339
Open AccessWeak convergence of adaptive Markov chain Monte Carlo
We develop general conditions for weak convergence of adaptive Markov chain Monte Carlo processes and this is shown to imply a weak law of large numbers for bounded Lipschitz continuous functions. This allows an estimation theory for adaptive Markov chain Monte Carlo where previously developed theory in total variation may fail or be difficult to establish. Extensions of weak convergence to general Wasserstein distances are established, along with a weak law of large numbers for possibly unbounded Lipschitz functions. Applications are applied to autoregressive processes in various settings, unadjusted Langevin processes, and adaptive Metropolis–Hastings.
- Open Access
- 1 January 2025
- Published by Institute of Mathematical Statistics in Electronic Communications in Probability
- Vol. 30 (none) , 1-13
Equivalence of starting point cutoff and the concentration of hitting times on a general state space
In this article we extend a result of Martinez and Ycart from their paper “Decay Rates and Cutoff for Convergence and Hitting Times of Markov Chains with Countably Infinite State Space” [7] to show that for a regular Markov chain on a general state space, the existence of a cutoff phenomenon for total variation distance to stationarity as the starting point tends to infinity is equivalent to the concentration of hitting times for any fixed regular set as the starting points tend to infinity. We apply this result to show that all random walks on the half-line with bounded steps exhibit starting point cutoff.
- 1 January 2025
- Published by Institute of Mathematical Statistics in Electronic Communications in Probability
- Vol. 30 (none) , 1-13
Open AccessEquivalence of starting point cutoff and the concentration of hitting times on a general state space
In this article we extend a result of Martinez and Ycart from their paper “Decay Rates and Cutoff for Convergence and Hitting Times of Markov Chains with Countably Infinite State Space” [7] to show that for a regular Markov chain on a general state space, the existence of a cutoff phenomenon for total variation distance to stationarity as the starting point tends to infinity is equivalent to the concentration of hitting times for any fixed regular set as the starting points tend to infinity. We apply this result to show that all random walks on the half-line with bounded steps exhibit starting point cutoff.
- Open Access
- 18 September 2024
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 62 (1) , 188-208
Efficiency of reversible MCMC methods: elementary derivations and applications to composite methods
We review criteria for comparing the efficiency of Markov chain Monte Carlo (MCMC) methods with respect to the asymptotic variance of estimates of expectations of functions of state, and show how such criteria can justify ways of combining improvements to MCMC methods. We say that a chain on a finite state space with transition matrix P efficiency-dominates one with transition matrix Q if for every function of state it has lower (or equal) asymptotic variance. We give elementary proofs of some previous results regarding efficiency dominance, leading to a self-contained demonstration that a reversible chain with transition matrix P efficiency-dominates a reversible chain with transition matrix Q if and only if none of the eigenvalues of $Q-P$ are negative. This allows us to conclude that modifying a reversible MCMC method to improve its efficiency will also improve the efficiency of a method that randomly chooses either this or some other reversible method, and to conclude that improving the efficiency of a reversible update for one component of state (as in Gibbs sampling) will improve the overall efficiency of a reversible method that combines this and other updates. It also explains how antithetic MCMC can be more efficient than independent and identically distributed sampling. We also establish conditions that can guarantee that a method is not efficiency-dominated by any other method.- 18 September 2024
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 62 (1) , 188-208
Open AccessEfficiency of reversible MCMC methods: elementary derivations and applications to composite methods
We review criteria for comparing the efficiency of Markov chain Monte Carlo (MCMC) methods with respect to the asymptotic variance of estimates of expectations of functions of state, and show how such criteria can justify ways of combining improvements to MCMC methods. We say that a chain on a finite state space with transition matrix P efficiency-dominates one with transition matrix Q if for every function of state it has lower (or equal) asymptotic variance. We give elementary proofs of some previous results regarding efficiency dominance, leading to a self-contained demonstration that a reversible chain with transition matrix P efficiency-dominates a reversible chain with transition matrix Q if and only if none of the eigenvalues of $Q-P$ are negative. This allows us to conclude that modifying a reversible MCMC method to improve its efficiency will also improve the efficiency of a method that randomly chooses either this or some other reversible method, and to conclude that improving the efficiency of a reversible update for one component of state (as in Gibbs sampling) will improve the overall efficiency of a reversible method that combines this and other updates. It also explains how antithetic MCMC can be more efficient than independent and identically distributed sampling. We also establish conditions that can guarantee that a method is not efficiency-dominated by any other method. - Open Access
Comparing the Efficiency of General State Space Reversible MCMC Algorithms
We review and provide new proofs of results used to compare the efficiency of estimates generated by reversible MCMC algorithms on a general state space. We provide a full proof of the formula for the asymptotic variance for real-valued functionals on $φ$-irreducible reversible Markov chains, first introduced by Kipnis and Varadhan. Given two Markov kernels $P$ and $Q$ with stationary measure $π$, we say that the Markov kernel $P$ efficiency dominates the Markov kernel $Q$ if the asymptotic variance with respect to $P$ is at most the asymptotic variance with respect to $Q$ for every real-valued functional $f\in L^2(π)$. Assuming only a basic background in functional analysis, we prove that for two $φ$-irreducible reversible Markov kernels $P$ and $Q$, $P$ efficiency dominates $Q$ if and only if the operator $Q-P$, where $P$ is the operator on $L^2(π)$ that maps $f\mapsto\int f(y)P(\cdot,dy)$ and similarly for $Q$, is positive on $L^2(π)$, i.e. $\langle f,(Q-P)f\rangle\geq0$ for every $f\in L^2(π)$. We use this result to show that reversible antithetic kernels are more efficient than i.i.d. sampling, and that efficiency dominance is a partial ordering on $φ$-irreducible reversible Markov kernels. We also provide a proof based on that of Tierney that Peskun dominance is a sufficient condition for efficiency dominance for reversible kernels. Using these results, we show that Markov kernels formed by randomly selecting other "component" Markov kernels will always efficiency dominate another Markov kernel formed in this way, as long as the component kernels of the former efficiency dominate those of the latter. These results on the efficiency dominance of combining component kernels generalises the results on the efficiency dominance of combined chains introduced by Neal and Rosenthal from finite state spaces to general state spaces.Open AccessComparing the Efficiency of General State Space Reversible MCMC Algorithms
We review and provide new proofs of results used to compare the efficiency of estimates generated by reversible MCMC algorithms on a general state space. We provide a full proof of the formula for the asymptotic variance for real-valued functionals on $φ$-irreducible reversible Markov chains, first introduced by Kipnis and Varadhan. Given two Markov kernels $P$ and $Q$ with stationary measure $π$, we say that the Markov kernel $P$ efficiency dominates the Markov kernel $Q$ if the asymptotic variance with respect to $P$ is at most the asymptotic variance with respect to $Q$ for every real-valued functional $f\in L^2(π)$. Assuming only a basic background in functional analysis, we prove that for two $φ$-irreducible reversible Markov kernels $P$ and $Q$, $P$ efficiency dominates $Q$ if and only if the operator $Q-P$, where $P$ is the operator on $L^2(π)$ that maps $f\mapsto\int f(y)P(\cdot,dy)$ and similarly for $Q$, is positive on $L^2(π)$, i.e. $\langle f,(Q-P)f\rangle\geq0$ for every $f\in L^2(π)$. We use this result to show that reversible antithetic kernels are more efficient than i.i.d. sampling, and that efficiency dominance is a partial ordering on $φ$-irreducible reversible Markov kernels. We also provide a proof based on that of Tierney that Peskun dominance is a sufficient condition for efficiency dominance for reversible kernels. Using these results, we show that Markov kernels formed by randomly selecting other "component" Markov kernels will always efficiency dominate another Markov kernel formed in this way, as long as the component kernels of the former efficiency dominate those of the latter. These results on the efficiency dominance of combining component kernels generalises the results on the efficiency dominance of combined chains introduced by Neal and Rosenthal from finite state spaces to general state spaces. - 27 April 2024
- Published by Springer Nature
- p. 1371-1381
How Markov’s Little Idea Transformed Statistics
- 27 April 2024
- Published by Springer Nature
- p. 1371-1381
How Markov’s Little Idea Transformed Statistics
- Open Access
Efficiency of reversible MCMC methods: elementary derivations and applications to composite methods
We review criteria for comparing the efficiency of Markov chain Monte Carlo (MCMC) methods with respect to the asymptotic variance of estimates of expectations of functions of state, and show how such criteria can justify ways of combining improvements to MCMC methods. We say that a chain on a finite state space with transition matrix $P$ efficiency-dominates one with transition matrix $Q$ if for every function of state it has lower (or equal) asymptotic variance. We give elementary proofs of some previous results regarding efficiency dominance, leading to a self-contained demonstration that a reversible chain with transition matrix $P$ efficiency-dominates a reversible chain with transition matrix $Q$ if and only if none of the eigenvalues of $Q-P$ are negative. This allows us to conclude that modifying a reversible MCMC method to improve its efficiency will also improve the efficiency of a method that randomly chooses either this or some other reversible method, and to conclude that improving the efficiency of a reversible update for one component of state (as in Gibbs sampling) will improve the overall efficiency of a reversible method that combines this and other updates. It also explains how antithetic MCMC can be more efficient than i.i.d. sampling. We also establish conditions that can guarantee that a method is not efficiency-dominated by any other method.Open AccessEfficiency of reversible MCMC methods: elementary derivations and applications to composite methods
We review criteria for comparing the efficiency of Markov chain Monte Carlo (MCMC) methods with respect to the asymptotic variance of estimates of expectations of functions of state, and show how such criteria can justify ways of combining improvements to MCMC methods. We say that a chain on a finite state space with transition matrix $P$ efficiency-dominates one with transition matrix $Q$ if for every function of state it has lower (or equal) asymptotic variance. We give elementary proofs of some previous results regarding efficiency dominance, leading to a self-contained demonstration that a reversible chain with transition matrix $P$ efficiency-dominates a reversible chain with transition matrix $Q$ if and only if none of the eigenvalues of $Q-P$ are negative. This allows us to conclude that modifying a reversible MCMC method to improve its efficiency will also improve the efficiency of a method that randomly chooses either this or some other reversible method, and to conclude that improving the efficiency of a reversible update for one component of state (as in Gibbs sampling) will improve the overall efficiency of a reversible method that combines this and other updates. It also explains how antithetic MCMC can be more efficient than i.i.d. sampling. We also establish conditions that can guarantee that a method is not efficiency-dominated by any other method. - 10 November 2023
- Published by Wiley in Canadian Journal of Statistics
- Vol. 52 (3) , 659-677
Football group draw probabilities and corrections
This article considers the challenge of designing football group draw mechanisms, which have a uniform distribution over all valid draw assignments, but are also entertaining, practical and transparent. Although this problem is trivial in completely symmetric problems, it becomes challenging when there are draw constraints that are not exchangeable across each of the competing teams, so that symmetry breaks down. We explain how to simulate the FIFA sequential draw method and compute the nonuniformity of its draws by comparison with a uniform rejection sampler. We then propose several practical methods of achieving the uniform distribution while still using balls and bowls in a way which is suitable for a televised draw. The solutions can also be carried out interactively. The general methodology we provide can readily be transported to different competition draws and is not restricted to football events.
- 10 November 2023
- Published by Wiley in Canadian Journal of Statistics
- Vol. 52 (3) , 659-677
Football group draw probabilities and corrections
This article considers the challenge of designing football group draw mechanisms, which have a uniform distribution over all valid draw assignments, but are also entertaining, practical and transparent. Although this problem is trivial in completely symmetric problems, it becomes challenging when there are draw constraints that are not exchangeable across each of the competing teams, so that symmetry breaks down. We explain how to simulate the FIFA sequential draw method and compute the nonuniformity of its draws by comparison with a uniform rejection sampler. We then propose several practical methods of achieving the uniform distribution while still using balls and bowls in a way which is suitable for a televised draw. The solutions can also be carried out interactively. The general methodology we provide can readily be transported to different competition draws and is not restricted to football events.