4 citations · 4 across the 4 of their papers we have counts for
5 papers
Optimal design of the Barker proposal and other locally-balanced Metropolis-Hastings algorithms
Jure Vogrinc, Samuel Livingstone, Giacomo Zanella
We study the class of first-order locally-balanced Metropolis--Hastings algorithms introduced in Livingstone & Zanella (2021). To choose a specific algorithm within the class the u…
Hopping between distant basins
Maldon Goodridge, John Moriarty, Jure Vogrinc +1
We present the Basin Hopping with Skipping (BH-S) algorithm for stochastic optimisation, which replaces the perturbation step of basin hopping (BH) with a so-called skipping propos…
Counterexamples for optimal scaling of Metropolis-Hastings chains with rough target densities
Jure Vogrinc, Wilfrid Stephen Kendall
For sufficiently smooth targets of product form it is known that the variance of a single coordinate of the proposal in RWM (Random walk Metropolis) and MALA (Metropolis adjusted L…
Binomial Symbols and Prime Moduli
Manjil P. Saikia, Jure Vogrinc
We try to improve a problem asked in an Indian Math Olympiad. We give a brief overview of the work done in Saikia and Vogrinc (2011) and Saikia and Vogrinc where the authors have f…
A Simple Number Theoretic Result
Manjil P. Saikia, Jure Vogrinc
We derive an interesting congruence relation motivated by an Indian Olympiad problem. We give three different proofs of the theorem and mention a few interesting related results.