Abstract
This paper applies the transitional Markov chain Monte Carlo (TMCMC) algorithm to probabilistic site characterization problems. The purpose is to characterize the statistical uncertainties in the spatial variability parameters based on the cone penetration test (CPT) dataset. The spatial variability parameters of interest include the trend function, standard deviation and scale of fluctuation for the spatial variability, and so on. In contrast to the Metropolis–Hastings (MH) algorithm, the TMCMC algorithm is a tune-free algorithm: it does not require the specification of the proposal probability density function (PDF), hence there is no need to tune the proposal PDF. Also, there is no burn-in period to worry about, and the convergence issue is mild for TMCMC because the samples spread widely. Moreover, it can estimate the model evidence, a quantity essential for Bayesian model comparison, without extra computation cost. The effectiveness for the TMCMC algorithm is demonstrated through simulated examples and a real case study.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
