Search results for "stochastic"

Can the Adaptive Metropolis Algorithm Collapse Without the Covariance Lower Bound?

2011

The Adaptive Metropolis (AM) algorithm is based on the symmetric random-walk Metropolis algorithm. The proposal distribution has the following time-dependent covariance matrix at step $n+1$ \[ S_n = Cov(X_1,...,X_n) + \epsilon I, \] that is, the sample covariance matrix of the history of the chain plus a (small) constant $\epsilon>0$ multiple of the identity matrix $I$. The lower bound on the eigenvalues of $S_n$ induced by the factor $\epsilon I$ is theoretically convenient, but practically cumbersome, as a good value for the parameter $\epsilon$ may not always be easy to choose. This article considers variants of the AM algorithm that do not explicitly bound the eigenvalues of $S_n$ away …

Multiscale Granger causality

2017

In the study of complex physical and biological systems represented by multivariate stochastic processes, an issue of great relevance is the description of the system dynamics spanning multiple temporal scales. While methods to assess the dynamic complexity of individual processes at different time scales are well-established, multiscale analysis of directed interactions has never been formalized theoretically, and empirical evaluations are complicated by practical issues such as filtering and downsampling. Here we extend the very popular measure of Granger causality (GC), a prominent tool for assessing directed lagged interactions between joint processes, to quantify information transfer a…

Large systems of path-repellent Brownian motions in a trap at positive temperature

2006

We study a model of $ N $ mutually repellent Brownian motions under confinement to stay in some bounded region of space. Our model is defined in terms of a transformed path measure under a trap Hamiltonian, which prevents the motions from escaping to infinity, and a pair-interaction Hamiltonian, which imposes a repellency of the $N$ paths. In fact, this interaction is an $N$-dependent regularisation of the Brownian intersection local times, an object which is of independent interest in the theory of stochastic processes. The time horizon (interpreted as the inverse temperature) is kept fixed. We analyse the model for diverging number of Brownian motions in terms of a large deviation princip…

Rare events and scaling properties in field-induced anomalous dynamics

2012

We show that, in a broad class of continuous time random walks (CTRW), a small external field can turn diffusion from standard into anomalous. We illustrate our findings in a CTRW with trapping, a prototype of subdiffusion in disordered and glassy materials, and in the L\'evy walk process, which describes superdiffusion within inhomogeneous media. For both models, in the presence of an external field, rare events induce a singular behavior in the originally Gaussian displacements distribution, giving rise to power-law tails. Remarkably, in the subdiffusive CTRW, the combined effect of highly fluctuating waiting times and of a drift yields a non-Gaussian distribution characterized by long sp…

Rough linear PDE's with discontinuous coefficients - existence of solutions via regularization by fractional Brownian motion

2020

We consider two related linear PDE's perturbed by a fractional Brownian motion. We allow the drift to be discontinuous, in which case the corresponding deterministic equation is ill-posed. However, the noise will be shown to have a regularizing effect on the equations in the sense that we can prove existence of solutions for almost all paths of the fractional Brownian motion.

2019

In the independent component model, the multivariate data are assumed to be a mixture of mutually independent latent components. The independent component analysis (ICA) then aims at estimating these latent components. In this article, we study an ICA method which combines the use of linear and quadratic autocorrelations to enable efficient estimation of various kinds of stationary time series. Statistical properties of the estimator are studied by finding its limiting distribution under general conditions, and the asymptotic variances are derived in the case of ARMA-GARCH model. We use the asymptotic results and a finite sample simulation study to compare different choices of a weight coef…

Evaluation of Insurance Products with Guarantee in Incomplete Markets

2008

Abstract Life insurance products are usually equipped with minimum guarantee and bonus provision options. The pricing of such claims is of vital importance for the insurance industry. Risk management, strategic asset allocation, and product design depend on the correct evaluation of the written options. Also regulators are interested in such issues since they have to be aware of the possible scenarios that the overall industry will face. Pricing techniques based on the Black & Scholes paradigm are often used, however, the hypotheses underneath this model are rarely met. To overcome Black & Scholes limitations, we develop a stochastic programming model to determine the fair price of the mini…

Uniform measure density condition and game regularity for tug-of-war games

2018

We show that a uniform measure density condition implies game regularity for all 2 < p < ∞ in a stochastic game called “tug-of-war with noise”. The proof utilizes suitable choices of strategies combined with estimates for the associated stopping times and density estimates for the sum of independent and identically distributed random vectors. peerReviewed

Updating input–output matrices: assessing alternatives through simulation

2009

A problem that frequently arises in economics, demography, statistics, transportation planning and stochastic modelling is how to adjust the entries of a matrix to fulfil row and column aggregation constraints. Biproportional methods in general and the so-called RAS algorithm in particular, have been used for decades to find solutions to this type of problem. Although alternatives exist, the RAS algorithm and its extensions are still the most popular. Apart from some interesting empirical and theoretical properties, tradition, simplicity and very low computational costs are among the reasons behind the great success of RAS. Nowadays computer hardware and software have made alternative proce…

Local bandwidth selection for kernel density estimation in a bifurcating Markov chain model

2020

International audience; We propose an adaptive estimator for the stationary distribution of a bifurcating Markov Chain onRd. Bifurcating Markov chains (BMC for short) are a class of stochastic processes indexed by regular binary trees. A kernel estimator is proposed whose bandwidths are selected by a method inspired by the works of Goldenshluger and Lepski [(2011), 'Bandwidth Selection in Kernel Density Estimation: Oracle Inequalities and Adaptive Minimax Optimality',The Annals of Statistics3: 1608-1632). Drawing inspiration from dimension jump methods for model selection, we also provide an algorithm to select the best constant in the penalty. Finally, we investigate the performance of the…