Displaying 241 – 260 of 297

Showing per page

Asymptotic behavior of differential equations driven by periodic and random processes with slowly decaying correlations

Renaud Marty (2005)

ESAIM: Probability and Statistics

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...

Asymptotic behavior of differential equations driven by periodic and random processes with slowly decaying correlations

Renaud Marty (2010)

ESAIM: Probability and Statistics

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...

Asymptotic behavior of the hitting time, overshoot and undershoot for some Lévy processes

Bernard Roynette, Pierre Vallois, Agnès Volpi (2008)

ESAIM: Probability and Statistics

Let ( X t , t 0 ) be a Lévy process started at 0 , with Lévy measure ν . We consider the first passage time T x of ( X t , t 0 ) to level x > 0 , and K x : = X T x - 𝑥 the overshoot and L x : = x - X T 𝑥 - the undershoot. We first prove that the Laplace transform of the random triple ( T x , K x , L x ) satisfies some kind of integral equation. Second, assuming that ν admits exponential moments, we show that ( T x ˜ , K x , L x ) converges in distribution as x , where T x ˜ denotes a suitable renormalization of T x .

Asymptotic behavior of the hitting time, overshoot and undershoot for some Lévy processes

Bernard Roynette, Pierre Vallois, Agnès Volpi (2007)

ESAIM: Probability and Statistics

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 ( T x ˜ , K x , L x ) converges in distribution as x → ∞, where T x ˜ denotes a suitable renormalization of Tx.


Asymptotic behaviour of averages of k-dimensional marginals of measures on ℝⁿ

Jesús Bastero, Julio Bernués (2009)

Studia Mathematica

We study the asymptotic behaviour, as n → ∞, of the Lebesgue measure of the set x K : | P E ( x ) | t 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 k of a t-dilate of the Euclidean unit ball. Some of the results hold for a wider class of probabilities on ℝⁿ.

Asymptotic equipartition properties for simple hierarchical and networked structures

Kwabena Doku-Amponsah (2012)

ESAIM: Probability and Statistics

We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large n, a networked data structure consisting of n units connected by an average number of links of order n / log n can be coded by about H × n bits, where H is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical...

Asymptotic equipartition properties for simple hierarchical and networked structures

Kwabena Doku-Amponsah (2012)

ESAIM: Probability and Statistics

We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large n, a networked data structure consisting of n units connected by an average number of links of order n / log n can be coded by about H × n bits, where H is an explicitly defined entropy. The main technique in our proofs are large deviation principles for suitably defined empirical...

Asymptotic Feynman–Kac formulae for large symmetrised systems of random walks

Stefan Adams, Tony Dorlas (2008)

Annales de l'I.H.P. Probabilités et statistiques

We study large deviations principles for N random processes on the lattice ℤd with finite time horizon [0, β] under a symmetrised measure where all initial and terminal points are uniformly averaged over random permutations. That is, given a permutation σ of N elements and a vector (x1, …, xN) of N initial points we let the random processes terminate in the points (xσ(1), …, xσ(N)) and then sum over all possible permutations and initial points, weighted with an initial distribution. We prove level-two...

Currently displaying 241 – 260 of 297