English
Related papers

Related papers: Sufficient burn-in for Gibbs samplers for a hierar…

200 papers

We study square loss in a realizable time-series framework with martingale difference noise. Our main result is a fast rate excess risk bound which shows that whenever a trajectory hypercontractivity condition holds, the risk of the…

Machine Learning · Computer Science 2024-06-14 Ingvar Ziemann , Stephen Tu

Estimating boundary curves has many applications such as economics, climate science, and medicine. Bayesian trend filtering has been developed as one of locally adaptive smoothing methods to estimate the non-stationary trend of data. This…

Methodology · Statistics 2023-11-13 Takahiro Onizuka , Fumiya Iwashige , Shintaro Hashimoto

Physically motivated stochastic dynamics are often used to sample from high-dimensional distributions. However such dynamics often get stuck in specific regions of their state space and mix very slowly to the desired stationary state. This…

Machine Learning · Statistics 2025-05-13 Abhijith Jayakumar , Andrey Y. Lokhov , Sidhant Misra , Marc Vuffray

A brief review of the role of the Higgs mechanism and the ensuing Higgs particle in the Minimal Standard Model is given. Then the property of triviality of the scalar sector in the Minimal Standard Model and the upper bound on the Higgs…

High Energy Physics - Phenomenology · Physics 2009-09-25 Urs M. Heller

We characterise the convergence of the Gibbs sampler which samples from the joint posterior distribution of parameters and missing data in hierarchical linear models with arbitrary symmetric error distributions. We show that the convergence…

Methodology · Statistics 2007-10-24 Omiros Papaspiliopoulos , Gareth Roberts

We address diffusion processes in a bounded domain, while focusing on somewhat unexplored affinities between the presence of absorbing and/or inaccessible boundaries. For the Brownian motion (L\'{e}vy-stable cases are briefly mentioned)…

Statistical Mechanics · Physics 2017-10-24 Piotr Garbaczewski

Optimal designs minimize the number of experimental runs (samples) needed to accurately estimate model parameters, resulting in algorithms that, for instance, efficiently minimize parameter estimate variance. Governed by knowledge of past…

Methodology · Statistics 2023-02-03 Nicholas W. Barendregt , Emily G. Webb , Zachary P. Kilpatrick

In this paper we develop a quantitative Harris theorem with effective control over the constants. A benefit of our methodology is the decoupling of the small set and Lyapunov-Foster Drift conditions. Our methodology allows any small set and…

Probability · Mathematics 2023-03-09 Christopher DuPre

We discuss the relationship between discrete-time processes (chains) and one-dimensional Gibbs measures. We consider finite-alphabet (finite-spin) systems, possibly with a grammar (exclusion rule). We establish conditions for a stochastic…

Probability · Mathematics 2007-05-23 Roberto Fernandez , Gregory Maillard

A workload model using the infinite source Poisson model for bursts is combined with the on--off model for within burst activity. Burst durations and on--off durations are assumed to have heavy-tailed distributions with infinite variance…

Statistics Theory · Mathematics 2011-06-06 David A. Rolls

We consider posterior sampling in the very common Bayesian hierarchical model in which observed data depends on high-dimensional latent variables that, in turn, depend on relatively few hyperparameters. When the full conditional over the…

Computation · Statistics 2016-10-24 Richard A. Norton , J. Andres Christen , Colin Fox

We compute the stationary distribution of a continuous-time Markov chain which is constructed by gluing together two finite, irreducible Markov chains by identifying a pair of states of one chain with a pair of states of the other and…

Probability · Mathematics 2015-10-22 Bence Mélykúti , Peter Pfaffelhuber

P-splines provide a flexible setting for modeling nonlinear model components based on a discretized penalty structure with a relatively simple computational backbone. Under a Bayesian inferential framework based on Markov chain Monte Carlo,…

Methodology · Statistics 2025-11-03 Oswaldo Gressani , Paul H. C. Eilers

In this paper we improve some existing results concerning the approximation of the distribution of extremes of a 1-dependent and stationary sequence of random variables. We enlarge the range of applicability and improve the approximation…

Probability · Mathematics 2012-11-26 Alexandru Amarioarei

Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…

Probability · Mathematics 2024-12-18 Sam Olesker-Taylor , Thomas Sauerwald , John Sylvester

Computational couplings of Markov chains provide a practical route to unbiased Monte Carlo estimation that can utilize parallel computation. However, these approaches depend crucially on chains meeting after a small number of transitions.…

Methodology · Statistics 2021-04-14 Brian L. Trippe , Tin D. Nguyen , Tamara Broderick

The paper concerns a particular example of the Gibbs sampler and its mixing efficiency. Coordinates of a point are rerandomized in the unit square $[0,1]^2$ to approach a stationary distribution with density proportional to…

Probability · Mathematics 2018-10-09 Balázs Gerencsér

In this paper we extend the results of Lenci and Rey-Bellet on the large deviation upper bound of the distribution measures of local Hamiltonians with respect to a Gibbs state, in the setting of translation-invariant finite-range…

Mathematical Physics · Physics 2009-11-13 Fumio Hiai , Milan Mosonyi , Tomohiro Ogawa

Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…

Probability · Mathematics 2017-06-14 Jean-Christophe Mourrat , Daniel Valesin

We study convergence to equilibrium for a large class of Markov chains in random environment. The chains are sparse in the sense that in every row of the transition matrix $P$ the mass is essentially concentrated on few entries. Moreover,…

Probability · Mathematics 2018-01-23 Charles Bordenave , Pietro Caputo , Justin Salez