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 2827 for “"Markov Chain"”.

  1. Aspects of population Markov chain Monte Carlo and reversible jump Markov chain Monte Carlo

    This thesis consists ideas of two new population Markov chain Monte Carlo algorithms and an automatic proposal mechanism for the Reversible jump Markov chain Monte Carlo algorithm.

    glasgow Download PDF for Aspects of population Markov chain Monte Carlo and reversible jump Markov chain Monte Carlo (opens in a new tab)

  2. Particle Markov chain Monte Carlo

    Markov chain Monte Carlo (MCMC) and sequential Monte Carlo (SMC) methods have emerged as the two main tools to sample from high-dimensional probability distributions. Although asymptotic convergence of MCMC algorithms is ensured under weak assumptions, the performance of these latters is unreliable …

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

  3. 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)

  4. Piecewise-deterministic Markov chain Monte Carlo

    <p>Recent interest in a class of Markov chain Monte Carlo schemes based on continuous-time piecewise-deterministic Markov processes has led to several new and promising algorithmic developments. Prominent examples include the zig-zag process and the bouncy particle sampler. We explore this class of …

    oxford Repository record for Piecewise-deterministic Markov chain Monte Carlo (opens in a new tab)

  5. Efficient Markov Chain Monte Carlo Methods

    … statistics, and the simulation of materials. Markov Chain Monte Carlo (MCMC) methods are usually the required tool for this task, if the desired distribution is known only up to a multiplicative constant. Samples produced by an MCMC method are real values in N-dimensional space, called the …

    purdue-thes Repository record for Efficient Markov Chain Monte Carlo Methods (opens in a new tab)

  6. Some Improved Markov Chain Convergence Rates

    … equilibrium are established for non reversible Markov chains not having an atom via coupling methods. We consider two Markov chains having the same transition function but different initial conditions on the same probability space, that is, a coupling. A random time is constructed so that …

    clemson Repository record for Some Improved Markov Chain Convergence Rates (opens in a new tab)

  7. Extensions of Markov Chain Marginal Bootstrap

    The Markov chain marginal bootstrap (MCMB) is a new bootstrap method proposed by He and Hu (2002) for constructing confidence intervals or regions based on likelihood equations. It is designed to ease the computational burden of bootstrap in high-dimensional problems. It differs from the usual …

    uiuc Repository record for Extensions of Markov Chain Marginal Bootstrap (opens in a new tab)

  8. Output Analysis for Markov Chain Monte Carlo

    Markov chain Monte Carlo (MCMC) is a sampling method used to estimate expectations with respect to a target distribution. An important question is when should sampling stop so that we have good estimates of these expectations? The key to answering this question lies in assessing the Monte Carlo …

    umn Repository record for Output Analysis for Markov Chain Monte Carlo (opens in a new tab)

  9. RIESZ PARTICLE MARKOV CHAIN MONTE CARLO METHODS

    Markov chain Monte Carlo (MCMC) methods are simulations that explore complex statistical distributions, while bypassing the cumbersome requirement of a specific analytical expression for the target. This stochastic exploration of an uncertain parameter space comes at the expense of a large number …

    lsu-thes Repository record for RIESZ PARTICLE MARKOV CHAIN MONTE CARLO METHODS (opens in a new tab)

  10. Markov chain models and stochastic differential equations.

    … mathematical procedure is formulated to obtain a Markov Chain model for {y&macr;(t)} or any of the individual components {y1(t)}, {y 2(t)}, ... , {yr(t)} as a separate and distinct stochastic processes. Finally, a stability test is developed to predict whether the range of values of {y&macr;(t)} …

    ottawa-retro Repository record for Markov chain models and stochastic differential equations. (opens in a new tab)

  11. Implicit methods for Markov chain state classification

    <p>Markov chains are a well-established and important tool to assess the performance and dependability of computer and communication systems. An important step in many types of Markov chain analysis is the classification of states into recurrent classes and the class of transient states. The …

    iastate Repository record for Implicit methods for Markov chain state classification (opens in a new tab)

  12. Online Bipartite Matching under Markov Chain Model

    … In our model, input nodes are sampled from a Markov chain, and we refer to this as the Markov chain model. Introducing Markov chain significantly increases the complexity of analysis of algorithms by adding a number of parameters: initial distribution, transition probabilities, sampling size, …

    concordia Download PDF for Online Bipartite Matching under Markov Chain Model (opens in a new tab)

  13. Generating transition probabilities for Markov chain usage models

    … all one-step transition probabilities in the Markov chain. This work applies techniques from mathematical analysis, mathematical programming, linear algebra, and information theory to present a new approach to the representation and optimization of the transition probabilities of software …

    utk-theses Repository record for Generating transition probabilities for Markov chain usage models (opens in a new tab)

  14. Markov chain models of calcium puffs and sparks

    … modeled as a continuous-time discrete-state Markov chain may result in dynamics reminiscent of Ca2+ puffs and sparks. In such simulations, individual Ca2+-release channels are coupled via a mathematical representation of the local [Ca2+] and exhibit "stochastic Ca2+ excitability" where …

    wm-mary Repository record for Markov chain models of calcium puffs and sparks (opens in a new tab)

Page 1 of 142