Related papers: Geometric ergodicity of the Random Walk Metropolis…
Motivated by Bayesian inference with highly informative data we analyze the performance of random walk-like Metropolis-Hastings algorithms for approximate sampling of increasingly concentrating target distributions. We focus on Gaussian…
We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is a non-compact simple Lie group and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense subgroup.…
The continuous time random walk (CTRW) model exhibits a non-ergodic phase when the average waiting time diverges. Using an analytical approach for the non-biased and the uniformly biased CTRWs, and numerical simulations for the CTRW in a…
In any Markov chain Monte Carlo analysis, rapid convergence of the chain to its target probability distribution is of practical and theoretical importance. A chain that converges at a geometric rate is geometrically ergodic. In this paper,…
A method is proposed for constraining the Galactic gravitational potential from high precision observations of the phase space coordinates of a system of relaxed tracers. The method relies on an "ergodic" assumption that the observations…
We develop lagged Metropolis-Hastings walk for sampling from simple undirected graphs according to given stationary sampling probabilities. We explain how to apply the technique together with designed graphs for sampling of units-in-space.…
Datasets with extreme observations and/or heavy-tailed error distributions are commonly encountered and should be analyzed with careful consideration of these features from a statistical perspective. Small deviations from an assumed model,…
Scaling of proposals for Metropolis algorithms is an important practical problem in MCMC implementation. Criteria for scaling based on empirical acceptance rates of algorithms have been found to work consistently well across a broad range…
We study non-Gaussian random fields constructed by the selection normal distribution, and we term them selection Gaussian random fields. The selection Gaussian random field can capture skewness, multi-modality, and to some extend heavy…
We analyse computational efficiency of Metropolis-Hastings algorithms with stochastic AR(1) process proposals. These proposals include, as a subclass, discretized Langevin diffusion (e.g. MALA) and discretized Hamiltonian dynamics (e.g.…
Necessary and sufficient conditions for a Markov chain to be ergodic are that the chain is irreducible and aperiodic. This result is manifest in the case of random walks on finite groups by a statement about the support of the driving…
Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…
One main limitation of the existing optimal scaling results for Metropolis--Hastings algorithms is that the assumptions on the target distribution are unrealistic. In this paper, we consider optimal scaling of random-walk Metropolis…
In this paper we discuss how the notion of subgeometric ergodicity in Markov chain theory can be exploited to study stationarity and ergodicity of nonlinear time series models. Subgeometric ergodicity means that the transition probability…
We consider the optimal scaling problem for high-dimensional random walk Metropolis (RWM) algorithms where the target distribution has a discontinuous probability density function. Almost all previous analysis has focused upon continuous…
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 Langevin algorithm) should optimally scale as $n^{-1}$ and as…
The use of higher-order stochastic processes such as nonlinear Markov chains or vertex-reinforced random walks is significantly growing in recent years as they are much better at modeling high dimensional data and nonlinear dynamics in…
Graph vertex embeddings based on random walks have become increasingly influential in recent years, showing good performance in several tasks as they efficiently transform a graph into a more computationally digestible format while…
We define a random walk adic transformation associated to an aperiodic random walk on $G=\mathbb{Z}^{k}\times\mathbb{R}^{D-k}$ driven by a $\beta$-transformation and study its ergodic properties. In particular, this transformation is…
We investigate local MCMC algorithms, namely the random-walk Metropolis and the Langevin algorithms, and identify the optimal choice of the local step-size as a function of the dimension $n$ of the state space, asymptotically as…