2004
DOI: 10.1007/978-0-387-76371-2
|View full text |Cite
|
Sign up to set email alerts
|

Monte Carlo Strategies in Scientific Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

12
2,374
0
10

Year Published

2005
2005
2015
2015

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 1,805 publications
(2,439 citation statements)
references
References 0 publications
12
2,374
0
10
Order By: Relevance
“…A standard local Markov-Chain Monte-Carlo (MC) based method (see Binder and Heermann (1997) and Brémaud (2001)) would be the simplest of sampling strategies: one picks a state variable at a randomly-chosen time slice t k , and proposes a new configuration for it. The cost function of the new configuration is compared to the old cost function; the difference in the cost functions will determine whether to accept or reject using the standard Metropolis algorithm (see Liu (2002) for details on the Metropolis algorithm).…”
Section: The Path Integral Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…A standard local Markov-Chain Monte-Carlo (MC) based method (see Binder and Heermann (1997) and Brémaud (2001)) would be the simplest of sampling strategies: one picks a state variable at a randomly-chosen time slice t k , and proposes a new configuration for it. The cost function of the new configuration is compared to the old cost function; the difference in the cost functions will determine whether to accept or reject using the standard Metropolis algorithm (see Liu (2002) for details on the Metropolis algorithm).…”
Section: The Path Integral Methodsmentioning
confidence: 99%
“…Since (1) is not a proper probability distribution (the normalization is most likely unknown), a number of sampling techniques have been developed to circumvent this issue. One of these is Markov Chain Monte Carlo sampling scheme (MCMC) (see Liu (2002) and Chen et al (2000) for some background on Monte Carlo and its use in the Bayesian setting). Simple MCMC is computationally expensive and the path integral method PIMC constructed with this sampler will be slow to converge statistically.…”
Section: Introductionmentioning
confidence: 99%
“…This consists in building a Markov chain, whose stationary distribution is the joint posterior pdf (6), by sequentially generating random samples from the full conditional pdfs of all the unknown parameters and hyper-parameters; see (Liu, 2001;Robert, 2001) for a general introduction to MCMC.…”
Section: Gibbs Sampling Algorithmmentioning
confidence: 99%
“…These methods have their origin in motif-finding methods, such as meme and bioprospector, that were developed to identify regulatory elements in co-expressed genes [8][9][10][11][12][13]. The statistical search does not always converge to the correct binding site.…”
Section: Introductionmentioning
confidence: 99%