8 problems
Let denote the active information of a stochastic algorithm that starts randomly according to the null distribution of a non-guided algorithm and then performs …
The expected squared jump distance scaling constant is defined by … where is the standard Normal cumulative distribution function and is the limiting rescal…
Convergence-rate conjecture. The convergence rate of MTM-IS() without replacement is faster than
Let be the target measure on spanning forests and linking edges. A state has the form , where is a multi-scale hierarchical forest and is a linking edge set; p…
The paper considers rough target densities and the anomalous scaling behavior of Metropolis–Hastings chains exhibited by its examples. Typicality conjecture. Despite the examples b…
Let be an augmented Metropolis-Hastings Markov chain with stationary initial distribution, so that , and let be bo…
Let and be pseudo-marginal Metropolis--Hastings kernels formed by averaging estimators, and let denote the asymptotic variance of an…
Spectral-radius conjecture. For , where , one has