78,932 research outputs found
Algebraic polynomials and moments of stochastic integrals
We propose an algebraic method for proving estimates on moments of stochastic
integrals. The method uses qualitative properties of roots of algebraic
polynomials from certain general classes. As an application, we give a new
proof of a variation of the Burkholder-Davis-Gundy inequality for the case of
stochastic integrals with respect to real locally square integrable
martingales. Further possible applications and extensions of the method are
outlined.Comment: Published in Statistics and Probability Letters by the Elsevier.
Permanent link: http://dx.doi.org/10.1016/j.spl.2011.01.022 Preliminary
version of this paper appeared on October 27, 2009 as EURANDOM Report
2009-03
Convex Optimal Uncertainty Quantification
Optimal uncertainty quantification (OUQ) is a framework for numerical
extreme-case analysis of stochastic systems with imperfect knowledge of the
underlying probability distribution. This paper presents sufficient conditions
under which an OUQ problem can be reformulated as a finite-dimensional convex
optimization problem, for which efficient numerical solutions can be obtained.
The sufficient conditions include that the objective function is piecewise
concave and the constraints are piecewise convex. In particular, we show that
piecewise concave objective functions may appear in applications where the
objective is defined by the optimal value of a parameterized linear program.Comment: Accepted for publication in SIAM Journal on Optimizatio
Moment inequalities for functions of independent random variables
A general method for obtaining moment inequalities for functions of
independent random variables is presented. It is a generalization of the
entropy method which has been used to derive concentration inequalities for
such functions [Boucheron, Lugosi and Massart Ann. Probab. 31 (2003)
1583-1614], and is based on a generalized tensorization inequality due to
Latala and Oleszkiewicz [Lecture Notes in Math. 1745 (2000) 147-168]. The new
inequalities prove to be a versatile tool in a wide range of applications. We
illustrate the power of the method by showing how it can be used to
effortlessly re-derive classical inequalities including Rosenthal and
Kahane-Khinchine-type inequalities for sums of independent random variables,
moment inequalities for suprema of empirical processes and moment inequalities
for Rademacher chaos and U-statistics. Some of these corollaries are apparently
new. In particular, we generalize Talagrand's exponential inequality for
Rademacher chaos of order 2 to any order. We also discuss applications for
other complex functions of independent random variables, such as suprema of
Boolean polynomials which include, as special cases, subgraph counting problems
in random graphs.Comment: Published at http://dx.doi.org/10.1214/009117904000000856 in the
Annals of Probability (http://www.imstat.org/aop/) by the Institute of
Mathematical Statistics (http://www.imstat.org
Accuracy of simulations for stochastic dynamic models
This paper provides a general framework for the simulation of stochastic dynamic models. Our analysis rests upon a continuity property of invariant distributions and a generalized law of large numbers. We then establish that the simulated moments from numerical approximations converge to their exact values as the approximation errors of the computed solutions converge to zero. These asymptotic results are of further interest in the comparative study of dynamic solutions, model estimation, and derivation of error bounds for the simulated moments
Two new Probability inequalities and Concentration Results
Concentration results and probabilistic analysis for combinatorial problems
like the TSP, MWST, graph coloring have received much attention, but generally,
for i.i.d. samples (i.i.d. points in the unit square for the TSP, for example).
Here, we prove two probability inequalities which generalize and strengthen
Martingale inequalities. The inequalities provide the tools to deal with more
general heavy-tailed and inhomogeneous distributions for combinatorial
problems. We prove a wide range of applications - in addition to the TSP, MWST,
graph coloring, we also prove more general results than known previously for
concentration in bin-packing, sub-graph counts, Johnson-Lindenstrauss random
projection theorem. It is hoped that the strength of the inequalities will
serve many more purposes.Comment: 3
Transition asymptotics for reaction-diffusion in random media
We describe a universal transition mechanism characterizing the passage to an
annealed behavior and to a regime where the fluctuations about this behavior
are Gaussian, for the long time asymptotics of the empirical average of the
expected value of the number of random walks which branch and annihilate on
, with stationary random rates. The random walks are
independent, continuous time rate , simple, symmetric, with . A random walk at , binary branches at rate ,
and annihilates at rate . The random environment has coordinates
which are i.i.d. We identify a natural way to describe
the annealed-Gaussian transition mechanism under mild conditions on the rates.
Indeed, we introduce the exponents
, and assume
that for
small enough, where and
denotes the average of the expected value of the number of particles
at time and an environment of rates , given that initially there was
only one particle at 0. Then the empirical average of over a box of
side has different behaviors: if for some and large enough , a law of large
numbers is satisfied; if for some
and large enough , a CLT is satisfied. These statements are
violated if the reversed inequalities are satisfied for some negative
. Applications to potentials with Weibull, Frechet and double
exponential tails are given.Comment: To appear in: Probability and Mathematical Physics: A Volume in Honor
of Stanislav Molchanov, Editors - AMS | CRM, (2007
- …