✦ LIBER ✦

Robustness and applicability of Markov chain Monte Carlo algorithms for eigenvalue problems

✍ Scribed by I.T. Dimov; B. Philippe; A. Karaivanova; C. Weihrauch

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 275 KB
Volume: 32
Category: Article
ISSN: 0307-904X
DOI: 10.1016/j.apm.2007.04.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Identifiability and convergence issues f

Identifiability and convergence issues for Markov chain Monte Carlo fitting of spatial models

✍ Lynn E. Eberly; Bradley P. Carlin 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 2 views

The marked increase in popularity of Bayesian methods in statistical practice over the last decade owes much to the simultaneous development of Markov chain Monte Carlo (MCMC) methods for the evaluation of requisite posterior distributions. However, along with this increase in computing power has co

Ascertainment correction for Markov chai

Ascertainment correction for Markov chain Monte Carlo segregation and linkage analysis of a quantitative trait

✍ Jianzhong Ma; Christopher I. Amos; E. Warwick Daw 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 458 KB 👁 1 views

## Abstract Although extended pedigrees are often sampled through probands with extreme levels of a quantitative trait, Markov chain Monte Carlo (MCMC) methods for segregation and linkage analysis have not been able to perform ascertainment corrections. Further, the extent to which ascertainment of

Finding starting points for Markov chain

Finding starting points for Markov chain Monte Carlo analysis of genetic data from large and complex pedigrees

✍ Yuqun Luo; Shili Lin 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 254 KB

## Abstract Genetic data from founder populations are advantageous for studies of complex traits that are often plagued by the problem of genetic heterogeneity. However, the desire to analyze large and complex pedigrees that often arise from such populations, coupled with the need to handle many li

Reconstruction of extended cortical sour

Reconstruction of extended cortical sources for EEG and MEG based on a Monte-Carlo-Markov-chain estimator

✍ Wilhelm Emil Kincses; Christoph Braun; Stefan Kaiser; Wolfgang Grodd; Hermann Ac 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 531 KB

## Abstract A new procedure to model extended cortical sources from EEG and MEG recordings based on a probabilistic approach is presented. The method (SPMECS) was implemented within the framework of maximum likelihood estimators. Neuronal activity generating EEG or MEG signals was characterized by

Bayesian Modeling and Markov Chain Monte

Bayesian Modeling and Markov Chain Monte Carlo Simulations for a Kinetic Study of Homo- and Co- Polymerization Systems

✍ Ali Habibi; Ebrahim Vasheghani-Farahani 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 695 KB

## Abstract A Bayesian modeling and Markov Chain Monte Carlo simulation was developed for a kinetic study of homopolymerization and copolymerization systems at the molecular scale. Two copolymerization models – the terminal unit model and the penultimate unit model – were considered. Prior estimate

Monte Carlo simulation of tetrahedral ch

Monte Carlo simulation of tetrahedral chains, 5. The pivot-algorithm for non-athermal linear and star-branched polymers

✍ Zifferer, Gerhard 📂 Article 📅 1992 🏛 Wiley (John Wiley & Sons) ⚖ 741 KB

## Abstract By use of the pivot algorithm, star‐branched chains with __F__ = 3–12 arms of length __n, nF__ = 480, and linear chains (__F__ = 2) are generated on a tetrahedral lattice. In order to simulate different qualities of the solvent, specific short‐range interactions are taken into account.