Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 51 for “"Metropolis Algorithm"”.

  1. Estimating a noncompensatory IRT model using a modified metropolis algorithm.

    … estimation method used was a modification of the Metropolis-Hastings algorithm that used multivariate prior distributions to help determine whether or not a newly sampled value was retained or rejected. Results showed that the noncompensatory model required a sample size of 4,000 people, 6 …

    umn Repository record for Estimating a noncompensatory IRT model using a modified metropolis algorithm. (opens in a new tab)

  2. Markov chain Monte Carlo algorithm comparisons

    Various Markov chain Monte Carlo algorithms are available for sampling from a posterior distribution. The random walk Metropolis algorithm is a simple scheme which is frequently used in Bayesian statistical problem. The guided walk algorithm attempts to suppress the random walk behavior in the …

    ubc Repository record for Markov chain Monte Carlo algorithm comparisons (opens in a new tab) Download PDF for Markov chain Monte Carlo algorithm comparisons (opens in a new tab)

  3. Rejection-Free and Partial Neighbor Search MCMC Algorithms

    The Metropolis algorithm involves producing a Markov chain to converge in distribution to a specified target density $\pi$. To improve its efficiency, we can use the Rejection-Free version of the Metropolis algorithm, which avoids the inefficiency of rejections by evaluating all neighbors. …

    toronto-retro Repository record for Rejection-Free and Partial Neighbor Search MCMC Algorithms (opens in a new tab)

  4. Genetic algorithms with 3-parent crossover

    "A new genetic algorithm which uses a 3-parent uniform crossover operator is developed and analyzed. Uniform crossover operators are shown to be based on the premise that all bit-level genetic information should be passed from parents to children. The 3-parent uniform crossover operator is shown to …

    must-thes Repository record for Genetic algorithms with 3-parent crossover (opens in a new tab)

  5. Simulações de Monte Carlo para os modelos Ising e Blume-Capel em redes complexa

    … network, using computer simulation through the Metropolis algorithm. We calculated macroscopic quantities of the system, such as internal energy, magnetization, specific heat, magnetic susceptibility and Binder cumulant. We found for the Ising model the same result obtained by Koreans H. Hong, …

    brazil-ufrn Repository record for Simulações de Monte Carlo para os modelos Ising e Blume-Capel em redes complexa (opens in a new tab)

  6. MCMC methods for wavelet representations in single index models

    … of the direction is unknown and we employ a Metropolis algorithm and an independence sampler, which require a proposal distribution. A normal distribution is proposed as the proposal distribution for the direction. We introduce ways to choose its mode (mean) using the independence sampler. …

    tamu Repository record for MCMC methods for wavelet representations in single index models (opens in a new tab)

  7. A Comparison of Random Walks with Different Types of Acceptance Probabilities

    In this thesis random walks similar to the Metropolis algorithm are investigated. Special emphasis is laid on different types of acceptance probabilities, namely Metropolis, Tsallis and Threshold Accepting. Equilibrium and relaxation properties as well as performance aspects in stochastic …

    qucosa-diss

  8. Sensitivity Analyses for Tumor Growth Models

    … Carlo (MCMC) techniques with the Random Walk Metropolis algorithm with Non-informative Prior and the Delayed Rejection Adoptive Metropolis (DRAM) algorithm to construct parameters' posterior distributions and then obtain credible intervals.

    wku-diss Repository record for Sensitivity Analyses for Tumor Growth Models (opens in a new tab)

  9. Convergence of Adaptive Markov Chain Monte Carlo Algorithms

    … some specific form is one, the adaptive MCMC algorithm is ergodic. For adaptive MCMC algorithm with Markovian adaptation, the algorithm satisfying simultaneous polynomial ergodicity is ergodic without those restrictions. We also discuss some recent results related to this topic. \indent Second …

    toronto-retro Repository record for Convergence of Adaptive Markov Chain Monte Carlo Algorithms (opens in a new tab)

  10. Crustal Composition Beneath Southern Idaho: Insights from Teleseismic Receiver Functions

    … I calculate and model receiver functions via a Metropolis algorithm approach to extract seismic velocity distributions in the lithosphere. I use the results to explore changing lithologies and heat signatures beneath the geologically complex southern Idaho region. In addition to a robust crustal …

    boise Repository record for Crustal Composition Beneath Southern Idaho: Insights from Teleseismic Receiver Functions (opens in a new tab)

  11. On the Verge of Attachment: The Effect of Ionic Concentration on Bacterial Adhesion

    … or metallic characteristics. The Monte Carlo Metropolis algorithm was used to find the equilibrium states of the systems. Both monovalent and divalent ions were present and their effects were quantified as functions of distance between the bacterial membrane and the surface. The energies of …

    guelph Repository record for On the Verge of Attachment: The Effect of Ionic Concentration on Bacterial Adhesion (opens in a new tab)

  12. Some Estimation and Restoration Techniques for Statistical Image Analysis

    … the parameter estimates and the data. We develop algorithms for estimation within hierarchical and empirical Bayesian models, and compare results with non-Bayesian methods. The empirical behaviour of parameter estimates under different algorithms are studied in a simulation exercise and compared …

    glasgow Download PDF for Some Estimation and Restoration Techniques for Statistical Image Analysis (opens in a new tab)

  13. Thermal Conductance of Pristine Amorphous Silicon Nanowires - A Non Equilibrium Green's Function Approach

    … (S-W) inter-atomic potential and Metropolis Algorithm. Now we solve the system to obtain the Hessian Matrix. Upon obtaining the same, we employ NEGF technique, under steady state conditions in order to compute the thermal conductance (&kappa). The value of &kappa of a-Si is less …

    nus Repository record for Thermal Conductance of Pristine Amorphous Silicon Nanowires - A Non Equilibrium Green's Function Approach (opens in a new tab) Download file for Thermal Conductance of Pristine Amorphous Silicon Nanowires - A Non Equilibrium Green's Function Approach (opens in a new tab)

  14. BAYESIAN ESTIMATION OF HIERARCHICAL LINEAR MODELS FROM INCOMPLETE DATA: CLUSTER-LEVEL NON-LINEAR EFFECTS AND SMALL SAMPLE SIZES

    … the HLM, but impute missing values of C by a Metropolis algorithm via a proposal density having a constant variance while the target conditional distribution has a nonconstant variance. Therefore, the samplers are not guaranteed to be compatible with the joint distribution and, thus, always …

    vcu Repository record for BAYESIAN ESTIMATION OF HIERARCHICAL LINEAR MODELS FROM INCOMPLETE DATA: CLUSTER-LEVEL NON-LINEAR EFFECTS AND SMALL SAMPLE SIZES (opens in a new tab)

  15. O Modelo de Ising inomogêneo: uma interrupção contínua entre as redes quadrada e triangular

    … Monte Carlo simulation using the sequential Metropolis algorithm, we calculate the magnetization and the magnetic susceptibility on lattices of differents sizes. Applying the finite size scaling method through a data colappse, we obtained the critical temperatures as well as the critical …

    brazil-ufrn Repository record for O Modelo de Ising inomogêneo: uma interrupção contínua entre as redes quadrada e triangular (opens in a new tab)

  16. A new approach to lattice quantum field theories

    In this thesis report, I describe an algorithm for lattice simulation of quantum/statistical fields that reduces the complexity of current techniques (Metropolis algorithm) from exponential in all the directions of space and (Euclidean-)time, to linear in (Euclidean-)time and exponential in space. …

    umn Repository record for A new approach to lattice quantum field theories (opens in a new tab)

  17. Bayesian variable selection in clustering via dirichlet process mixture models

    … has raised a strong interest in clustering algorithms and variable selection procedures. In this disserta- tion, I propose a model-based method that addresses the two problems simultane- ously. I use Dirichlet process mixture models to define the cluster structure and to introduce in the …

    tamu Repository record for Bayesian variable selection in clustering via dirichlet process mixture models (opens in a new tab)

  18. A hierarchical multivariate Bayesian approach to ensemble model output statistics in atmospheric prediction

    … ensemble. An adaptive variant of the random-walk Metropolis algorithm was used to complete the inference scheme with block-wise multiparameter updates. This produced calibrated multivariate posterior predictive distributions (PPD) for 24-hour forecasts of diurnal extrema in surface temperature and …

    nps Repository record for A hierarchical multivariate Bayesian approach to ensemble model output statistics in atmospheric prediction (opens in a new tab)

  19. GPU Implementation of the Feynman Path-Integral Method in Quantum Mechanics

    … Monte Carlo integration and by use of the Metropolis algorithm. This is due to the discretization of the path integral results in an integral with a high number of integration variables. The mathematical concepts of this calculation are explained. Also, a method for obtaining the …

    chalmers Repository record for GPU Implementation of the Feynman Path-Integral Method in Quantum Mechanics (opens in a new tab)

  20. Approximations and Scaling Llimits of Markov Chains with Applications to MCMC and Approximate Inference

    … proposal scaling and shaping for the random-walk Metropolis algorithm; and (iv) a complete characterization of the statistical asymptotics of stochastic gradient algorithms as methods for approximate inference, with recommendations on how to tune them for accuracy and efficiency.

    toronto-retro Repository record for Approximations and Scaling Llimits of Markov Chains with Applications to MCMC and Approximate Inference (opens in a new tab)

Page 1 of 3