Search results for "35"
showing 10 items of 2413 documents
Graphical representation of some duality relations in stochastic population models
2007
We derive a unified stochastic picture for the duality of a resampling-selection model with a branching-coalescing particle process (cf. http://www.ams.org/mathscinet-getitem?mr=MR2123250) and for the self-duality of Feller's branching diffusion with logistic growth (cf. math/0509612). The two dual processes are approximated by particle processes which are forward and backward processes in a graphical representation. We identify duality relations between the basic building blocks of the particle processes which lead to the two dualities mentioned above.
Directed random walk on the backbone of an oriented percolation cluster
2012
We consider a directed random walk on the backbone of the infinite cluster generated by supercritical oriented percolation, or equivalently the space-time embedding of the ``ancestral lineage'' of an individual in the stationary discrete-time contact process. We prove a law of large numbers and an annealed central limit theorem (i.e., averaged over the realisations of the cluster) using a regeneration approach. Furthermore, we obtain a quenched central limit theorem (i.e.\ for almost any realisation of the cluster) via an analysis of joint renewals of two independent walks on the same cluster.
Mean square rate of convergence for random walk approximation of forward-backward SDEs
2020
AbstractLet (Y,Z) denote the solution to a forward-backward stochastic differential equation (FBSDE). If one constructs a random walk$B^n$from the underlying Brownian motionBby Skorokhod embedding, one can show$L_2$-convergence of the corresponding solutions$(Y^n,Z^n)$to$(Y, Z).$We estimate the rate of convergence based on smoothness properties, especially for a terminal condition function in$C^{2,\alpha}$. The proof relies on an approximative representation of$Z^n$and uses the concept of discretized Malliavin calculus. Moreover, we use growth and smoothness properties of the partial differential equation associated to the FBSDE, as well as of the finite difference equations associated to t…
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 …
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
Affine-invariant rank tests for multivariate independence in independent component models
2016
We consider the problem of testing for multivariate independence in independent component (IC) models. Under a symmetry assumption, we develop parametric and nonparametric (signed-rank) tests. Unlike in independent component analysis (ICA), we allow for the singular cases involving more than one Gaussian independent component. The proposed rank tests are based on componentwise signed ranks, à la Puri and Sen. Unlike the Puri and Sen tests, however, our tests (i) are affine-invariant and (ii) are, for adequately chosen scores, locally and asymptotically optimal (in the Le Cam sense) at prespecified densities. Asymptotic local powers and asymptotic relative efficiencies with respect to Wilks’…
Infinite rate mutually catalytic branching in infinitely many colonies: The longtime behavior
2012
Consider the infinite rate mutually catalytic branching process (IMUB) constructed in [Infinite rate mutually catalytic branching in infinitely many colonies. Construction, characterization and convergence (2008) Preprint] and [Ann. Probab. 38 (2010) 479-497]. For finite initial conditions, we show that only one type survives in the long run if the interaction kernel is recurrent. On the other hand, under a slightly stronger condition than transience, we show that both types can coexist.
Rough nonlocal diffusions
2019
We consider a nonlinear Fokker-Planck equation driven by a deterministic rough path which describes the conditional probability of a McKean-Vlasov diffusion with "common" noise. To study the equation we build a self-contained framework of non-linear rough integration theory which we use to study McKean-Vlasov equations perturbed by rough paths. We construct an appropriate notion of solution of the corresponding Fokker-Planck equation and prove well-posedness.
On the stability and ergodicity of adaptive scaling Metropolis algorithms
2011
The stability and ergodicity properties of two adaptive random walk Metropolis algorithms are considered. The both algorithms adjust the scaling of the proposal distribution continuously based on the observed acceptance probability. Unlike the previously proposed forms of the algorithms, the adapted scaling parameter is not constrained within a predefined compact interval. The first algorithm is based on scale adaptation only, while the second one incorporates also covariance adaptation. A strong law of large numbers is shown to hold assuming that the target density is smooth enough and has either compact support or super-exponentially decaying tails.
Simulation of BSDEs with jumps by Wiener Chaos Expansion
2016
International audience; We present an algorithm to solve BSDEs with jumps based on Wiener Chaos Expansion and Picard's iterations. This paper extends the results given in Briand-Labart (2014) to the case of BSDEs with jumps. We get a forward scheme where the conditional expectations are easily computed thanks to chaos decomposition formulas. Concerning the error, we derive explicit bounds with respect to the number of chaos, the discretization time step and the number of Monte Carlo simulations. We also present numerical experiments. We obtain very encouraging results in terms of speed and accuracy.