Search results for "Carlo"

showing 10 items of 1845 documents

Parsimonious adaptive rejection sampling

2017

Monte Carlo (MC) methods have become very popular in signal processing during the past decades. The adaptive rejection sampling (ARS) algorithms are well-known MC technique which draw efficiently independent samples from univariate target densities. The ARS schemes yield a sequence of proposal functions that converge toward the target, so that the probability of accepting a sample approaches one. However, sampling from the proposal pdf becomes more computationally demanding each time it is updated. We propose the Parsimonious Adaptive Rejection Sampling (PARS) method, where an efficient trade-off between acceptance rate and proposal complexity is obtained. Thus, the resulting algorithm is f…

FOS: Computer and information sciencesSignal processingSequenceComputer science020208 electrical & electronic engineeringMonte Carlo methodRejection samplingUnivariateSampling (statistics)020206 networking & telecommunicationsSample (statistics)02 engineering and technologyStatistics - ComputationAdaptive filter0202 electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringAlgorithmComputation (stat.CO)Electronics Letters
researchProduct

Conditional particle filters with diffuse initial distributions

2020

Conditional particle filters (CPFs) are powerful smoothing algorithms for general nonlinear/non-Gaussian hidden Markov models. However, CPFs can be inefficient or difficult to apply with diffuse initial distributions, which are common in statistical applications. We propose a simple but generally applicable auxiliary variable method, which can be used together with the CPF in order to perform efficient inference with diffuse initial distributions. The method only requires simulatable Markov transitions that are reversible with respect to the initial distribution, which can be improper. We focus in particular on random-walk type transitions which are reversible with respect to a uniform init…

FOS: Computer and information sciencesStatistics and ProbabilityComputer scienceGaussianBayesian inferenceMarkovin ketjut02 engineering and technology01 natural sciencesStatistics - ComputationArticleTheoretical Computer ScienceMethodology (stat.ME)010104 statistics & probabilitysymbols.namesakeAdaptive Markov chain Monte Carlotilastotiede0202 electrical engineering electronic engineering information engineeringStatistical physics0101 mathematicsDiffuse initialisationHidden Markov modelComputation (stat.CO)Statistics - MethodologyState space modelHidden Markov modelbayesian inferenceMarkov chaindiffuse initialisationbayesilainen menetelmäconditional particle filtersmoothingmatemaattiset menetelmät020206 networking & telecommunicationsConditional particle filterCovariancecompartment modelRandom walkCompartment modelstate space modelComputational Theory and MathematicsAutoregressive modelsymbolsStatistics Probability and UncertaintyParticle filterSmoothingSmoothing
researchProduct

Unbiased Inference for Discretely Observed Hidden Markov Model Diffusions

2021

We develop a Bayesian inference method for diffusions observed discretely and with noise, which is free of discretisation bias. Unlike existing unbiased inference methods, our method does not rely on exact simulation techniques. Instead, our method uses standard time-discretised approximations of diffusions, such as the Euler--Maruyama scheme. Our approach is based on particle marginal Metropolis--Hastings, a particle filter, randomised multilevel Monte Carlo, and importance sampling type correction of approximate Markov chain Monte Carlo. The resulting estimator leads to inference without a bias from the time-discretisation as the number of Markov chain iterations increases. We give conver…

FOS: Computer and information sciencesStatistics and ProbabilityDiscretizationComputer scienceMarkovin ketjutInference010103 numerical & computational mathematicssequential Monte CarloBayesian inferenceStatistics - Computation01 natural sciencesMethodology (stat.ME)010104 statistics & probabilitysymbols.namesakediffuusio (fysikaaliset ilmiöt)FOS: MathematicsDiscrete Mathematics and Combinatorics0101 mathematicsHidden Markov modelComputation (stat.CO)Statistics - Methodologymatematiikkabayesilainen menetelmäApplied MathematicsProbability (math.PR)diffusionmatemaattiset menetelmätMarkov chain Monte CarloMarkov chain Monte CarloMonte Carlo -menetelmätNoiseimportance sampling65C05 (primary) 60H35 65C35 65C40 (secondary)Modeling and Simulationsymbolsmatemaattiset mallitStatistics Probability and Uncertaintymultilevel Monte CarloParticle filterAlgorithmMathematics - ProbabilityImportance samplingSIAM/ASA Journal on Uncertainty Quantification
researchProduct

Bayesian inference for the extremal dependence

2016

A simple approach for modeling multivariate extremes is to consider the vector of component-wise maxima and their max-stable distributions. The extremal dependence can be inferred by estimating the angular measure or, alternatively, the Pickands dependence function. We propose a nonparametric Bayesian model that allows, in the bivariate case, the simultaneous estimation of both functional representations through the use of polynomials in the Bernstein form. The constraints required to provide a valid extremal dependence are addressed in a straightforward manner, by placing a prior on the coefficients of the Bernstein polynomials which gives probability one to the set of valid functions. The…

FOS: Computer and information sciencesStatistics and ProbabilityInferenceBernstein polynomialsBivariate analysisBayesian inference01 natural sciencesMethodology (stat.ME)Bayesian nonparametrics010104 statistics & probabilitysymbols.namesakeGeneralised extreme value distribution0502 economics and business62G07Applied mathematics62G05Degree of a polynomial0101 mathematicsStatistics - Methodology050205 econometrics MathematicsAngular measureMax-stable distributionGENERALISED EXTREME VALUE DISTRIBUTION EXTREMAL DEPENDENCE ANGULAR MEASURE MAX-STABLE DISTRIBUTION BERNSTEIN POLYNOMIALS BAYESIAN NONPARAMETRICS TRANS-DIMENSIONAL MCMC EXCHANGE RATEExchange rates05 social sciencesNonparametric statisticsMarkov chain Monte CarloBernstein polynomialGENERALISED EXTREME VALUE DISTRIBUTION; EXTREMAL DEPENDENCE; ANGULAR MEASURE; MAX-STABLE DISTRIBUTION; BERNSTEIN POLYNOMIALS; BAYESIAN NONPARAMETRICS; TRANS-DIMENSIONAL MCMC; EXCHANGE RATETrans-dimensional MCMCEXCHANGE RATEsymbolsStatistics Probability and UncertaintySettore SECS-S/01 - StatisticaMaximaExtremal dependence62G32Electronic Journal of Statistics
researchProduct

Grapham: Graphical models with adaptive random walk Metropolis algorithms

2008

Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementation covering several such methods, with emphasis on graphical models for directed acyclic graphs. The implemented algorithms include the seminal Adaptive Metropolis algorithm adjusting the proposal covariance according to the history of the chain and a Metropolis algorithm adjusting the proposal scale based on the observed acceptance probability. Different variants of the algorithms allow one, for example, to use these two algorithms together, employ delayed rejection and adjust several parameters of the algorithm…

FOS: Computer and information sciencesStatistics and ProbabilityMarkov chainAdaptive algorithmApplied MathematicsRejection samplingMarkov chain Monte CarloMultiple-try MetropolisStatistics - ComputationStatistics::ComputationComputational Mathematicssymbols.namesakeMetropolis–Hastings algorithmComputational Theory and MathematicssymbolsGraphical modelAlgorithmComputation (stat.CO)MathematicsGibbs samplingComputational Statistics & Data Analysis
researchProduct

Efficient Bayesian generalized linear models with time-varying coefficients : The walker package in R

2020

The R package walker extends standard Bayesian general linear models to the case where the effects of the explanatory variables can vary in time. This allows, for example, to model the effects of interventions such as changes in tax policy which gradually increases their effect over time. The Markov chain Monte Carlo algorithms powering the Bayesian inference are based on Hamiltonian Monte Carlo provided by Stan software, using a state space representation of the model to marginalise over the regression coefficients for efficient low-dimensional sampling.

FOS: Computer and information sciencesaikasarjatbayesilainen menetelmäBayesian inferenceMarkovin ketjutRStatistics - Computationlineaariset mallitR-kieliMarkov chain Monte CarloMonte Carlo -menetelmätregressioanalyysiComputation (stat.CO)time-varying regression
researchProduct

Single chain structure in thin polymer films: Corrections to Flory's and Silberberg's hypotheses

2005

Conformational properties of polymer melts confined between two hard structureless walls are investigated by Monte Carlo simulation of the bond-fluctuation model. Parallel and perpendicular components of chain extension, bond-bond correlation function and structure factor are computed and compared with recent theoretical approaches attempting to go beyond Flory's and Silberberg's hypotheses. We demonstrate that for ultrathin films where the thickness, $H$, is smaller than the excluded volume screening length (blob size), $\xi$, the chain size parallel to the walls diverges logarithmically, $R^2/2N \approx b^2 + c \log(N)$ with $c \sim 1/H$. The corresponding bond-bond correlation function d…

FOS: Physical sciences02 engineering and technologyCondensed Matter - Soft Condensed MatterPlateau (mathematics)01 natural sciencesPower lawOmega0103 physical sciencesGeneral Materials Science61.25.Hq 67.70.+n010306 general physicspolymersMonte Carlo simulationPhysicsCondensed matter physicsForm factor (quantum field theory)021001 nanoscience & nanotechnologyCondensed Matter PhysicsCorrelation function (statistical mechanics)thin films[PHYS.COND.CM-GEN]Physics [physics]/Condensed Matter [cond-mat]/Other [cond-mat.other]Excluded volumeExponentSoft Condensed Matter (cond-mat.soft)0210 nano-technologyStructure factor
researchProduct

A study on the degree of relationship between two individuals.

2000

The paper studies the likely degree of relationship between two individuals who could possibly be half sibs. The possible common ancestor was dead, which further complicated the problem. The model used was devised by Thompson [in Rao and Chakraborty (eds): Handbook of Statistics, North-Holland, Amsterdam, 1991] and establishes a correspondence between the possible degree of relationship and certain feasible probability distributions on the number of identical by descent genes. Two statistical approaches are considered: the classical one, in which the maximum likelihood estimation for the parameters of Thompson’s model are obtained, and the Bayesian one, in which the test of the hypothesis o…

Family HealthLikelihood FunctionsDegree (graph theory)GenotypeModels GeneticMaximum likelihoodBayesian probabilityBayes TheoremIdentity by descentPhenotypeRobustness (computer science)StatisticsHalf sibsGeneticsProbability distributionHumansMonte Carlo MethodGenetics (clinical)MathematicsHuman heredity
researchProduct

The Blind Bard and the Unflagging Hierarch: Memories of War and Self-Representations in Fascist Italy

2013

The aim of this paper is to study two different and conflicting memories of the Great War developed in fascist Italy. In particular, an attempt will be made to focus on the cases of Carlo Delcroix and Roberto Farinacci. They were both born in 1890’s and took part in the war, during which Delcroix was severely mutilated. Alongside the few traits they had in common, many differences divided their political lives. Farinacci soon joined Fascism, became one of the leaders of the radical wing and, in the second half of 1930s, supported the alliance with Nazi Germany. Delcroix, who led one of the most important veterans associations, defined himself in the public debate mainly as a war invalid and…

FascismocommemorazioniSettore M-STO/04 - Storia ContemporaneaCommemorations of war in Fascist Italy; Roberto Farinacci; Carlo Delcroix; radical fascismmemoria della grande guerra
researchProduct

1993. La cuarta victoria socialista de Felipe González

2014

Este documento tiene los siguientes epígrafes: Una larga y difícil precampaña electoral para los socialistas. La semana negra. Felipe González abucheado en la Universidad Autónoma de Madrid. Felipe González Premio Carlomagno 1993. "La crisis de la economía sigue sin tocar fondo". 20% de paro. La crisis socialista en Francia e Italia. Joan Lerma valencianiza la federación valenciana. Encuestas y campaña electoral: resultado incierto. El juez Baltasar Garzón entra en campaña. Los debates televisivos Felipe González-José María Aznar. Felipe González gana las elecciones por cuarta vez. Gana el PSOE, pierde el PSPV-PSOE. «Los ciudadanos nunca se equivocan en las urnas; los errores han sido nuest…

Felipe González. Ciprià Císcar. Antonio García Miralles. Pedro Solbes. Carmen Alborch. Vicente Albero. Felipe González Premio Carlomagno 1993. Joan Lerma
researchProduct