An invariance principle for LPQD random variables.
We consider the nearest-neighbor simple random walk on ℤd, d≥2, driven by a field of bounded random conductances ωxy∈[0, 1]. The conductance law is i.i.d. subject to the condition that the probability of ωxy>0 exceeds the threshold for bond percolation on ℤd. For environments in which the origin is connected to infinity by bonds with positive conductances, we study the decay of the 2n-step return probability . We prove that is bounded by a random constant timesn−d/2 in d=2, 3, while it...
The paper deals with several questions of the diffusion approximation. The goal of this paper is to create the general method of reducting the dimension of the model with the aid of the diffusion approximation. Especially, two dimensional random variables are approximated by one-dimensional diffusion process by replacing one of its coordinates by a certain characteristic, e.g. by its stationary expectation. The suggested method is used for several different systems. For instance, the method is applicable...
We consider a differential equation with a random rapidly varying coefficient. The random coefficient is a gaussian process with slowly decaying correlations and compete with a periodic component. In the asymptotic framework corresponding to the separation of scales present in the problem, we prove that the solution of the differential equation converges in distribution to the solution of a stochastic differential equation driven by a classical brownian motion in some cases, by a fractional brownian...
We consider a differential equation with a random rapidly varying coefficient. The random coefficient is a Gaussian process with slowly decaying correlations and compete with a periodic component. In the asymptotic framework corresponding to the separation of scales present in the problem, we prove that the solution of the differential equation converges in distribution to the solution of a stochastic differential equation driven by a classical Brownian motion in some cases, by a fractional Brownian motion...
Let be a Lévy process started at , with Lévy measure . We consider the first passage time of to level , and the overshoot and the undershoot. We first prove that the Laplace transform of the random triple satisfies some kind of integral equation. Second, assuming that admits exponential moments, we show that converges in distribution as , where denotes a suitable renormalization of .
Let (Xt, t ≥ 0) be a Lévy process started at 0, with Lévy measure ν. We consider the first passage time Tx of (Xt, t ≥ 0) to level x > 0, and Kx := XTx - x the overshoot and Lx := x- XTx- the undershoot. We first prove that the Laplace transform of the random triple (Tx,Kx,Lx) satisfies some kind of integral equation. Second, assuming that ν admits exponential moments, we show that converges in distribution as x → ∞, where denotes a suitable renormalization of Tx.
We study the asymptotic behaviour, as n → ∞, of the Lebesgue measure of the set for a random k-dimensional subspace E ⊂ ℝⁿ and an isotropic convex body K ⊂ ℝⁿ. For k growing slowly to infinity, we prove it to be close to the suitably normalised Gaussian measure in of a t-dilate of the Euclidean unit ball. Some of the results hold for a wider class of probabilities on ℝⁿ.
We consider a large class of non compact hyperbolic manifolds with cusps and we prove that the winding process generated by a closed -form supported on a neighborhood of a cusp , satisfies a limit theorem, with an asymptotic stable law and a renormalising factor depending only on the rank of the cusp and the Poincaré exponent of . No assumption on the value of is required and this theorem generalises previous results due to Y. Guivarc’h, Y. Le Jan, J. Franchi and N. Enriquez.
We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins–Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to ensure convergence when standard algorithms fail because the expected-value function grows too fast. In this work, we give a self contained proof of a central limit theorem for this algorithm under local assumptions on the expected-value function, which are fairly...
We determine the asymptotic behavior of the realized power variations, and more generally of sums of a given function f evaluated at the increments of a Lévy process between the successive times iΔn for i = 0,1,...,n. One can elucidate completely the first order behavior, that is the convergence in probability of such sums, possibly after normalization and/or centering: it turns out that there is a rather wide variety of possible behaviors, depending on the structure of jumps and on the chosen...
Motivated by the Watts-Strogatz model for a complex network, we introduce a generalization of the Erdős-Rényi random graph. We derive a combinatorial formula for the moment sequence of its spectral distribution in the sparse limit.