搜索结果: 1-8 共查到“概率论 Sampling”相关记录8条 . 查询时间(0.349 秒)
Examples comparing Importance Sampling and the Metropolis algorithm
Sampling order markov chain monte carlo simulation technology the markov chain
2015/7/8
Importance sampling, particularly sequential and adaptive importance sampling, have emerged as competitive simulation techniques to Markov–chain Monte–Carlo techniques. We compare importance sampling ...
Gibbs Sampling, Exponential Families and Orthogonal Polynomials
Family convergence rate gibbs sampler standard index
2015/7/8
We give families of examples where sharp rates of convergence to stationarity of the widely used Gibbs sampler are available. The examples involve standard exponential families and their conjugate pri...
A SEQUENTIAL IMPORTANCE SAMPLING ALGORITHM FOR GENERATING RANDOM GRAPHS WITH PRESCRIBED DEGREES
Sequential sampling algorithms the random graph degree
2015/7/8
A SEQUENTIAL IMPORTANCE SAMPLING ALGORITHM FOR GENERATING RANDOM GRAPHS WITH PRESCRIBED DEGREES。
Importance Sampling for Multiscale Diffusions
importance sampling Monte Carlo homogenization multiscale rough energy landscape
2011/9/21
Abstract: We construct importance sampling schemes for stochastic differential equations with small noise and fast oscillating coefficients. Standard Monte Carlo methods perform poorly for these probl...
Closed-form asymptotic sampling distributions under the coalescent with recombination for an arbitrary number of loci
coalescent theory recombination asymptotic expansion sampling distribution
2011/9/19
Abstract: Obtaining a closed-form sampling distribution for the coalescent with recombination is a challenging problem. In the case of two loci, a new framework based on asymptotic series has recently...
Pade approximants and exact two-locus sampling distributions
population genetics recombination sampling distribution asymptotic expansion Pade approximants
2011/9/15
Abstract: For population genetics models with recombination, obtaining an exact, analytic sampling distribution has remained a challenging open problem for several decades. Recently, a new perspective...
Perfect Sampling of Markov Chains with Piecewise Homogeneous Events
Markov chains perfect sampling queueing systems
2011/3/2
Perfect sampling is a technique that uses coupling arguments to provide a sample from the stationary distribution of a Markov chain in a nite time without ever computing the distribution.
Exact sampling for intractable probability distributions via a Bernoulli factory
intractable probability distributions Bernoulli factory
2011/3/3
Many applications in the eld of statistics require Markov chain Monte Carlo methods.
Determining appropriate starting values and run lengths can be both analytically and empirically challenging.