6,138 research outputs found

    Moderate deviations for diffusions with Brownian potentials

    Full text link
    We present precise moderate deviation probabilities, in both quenched and annealed settings, for a recurrent diffusion process with a Brownian potential. Our method relies on fine tools in stochastic calculus, including Kotani's lemma and Lamperti's representation for exponential functionals. In particular, our result for quenched moderate deviations is in agreement with a recent theorem of Comets and Popov [Probab. Theory Related Fields 126 (2003) 571-609] who studied the corresponding problem for Sinai's random walk in random environment.Comment: Published at http://dx.doi.org/10.1214/009117904000000829 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org

    A subdiffusive behaviour of recurrent random walk in random environment on a regular tree

    Get PDF
    We are interested in the random walk in random environment on an infinite tree. Lyons and Pemantle [11] give a precise recurrence/transience criterion. Our paper focuses on the almost sure asymptotic behaviours of a recurrent random walk (X_n)(X\_n) in random environment on a regular tree, which is closely related to Mandelbrot [13]'s multiplicative cascade. We prove, under some general assumptions upon the distribution of the environment, the existence of a new exponent ν(0,12]\nu\in (0, {1\over 2}] such that max_0inX_i\max\_{0\le i \le n} |X\_i| behaves asymptotically like nνn^{\nu}. The value of ν\nu is explicitly formulated in terms of the distribution of the environment.Comment: 29 pages with 1 figure. Its preliminary version was put in the following web site: http://www.math.univ-paris13.fr/prepub/pp2005/pp2005-28.htm

    The slow regime of randomly biased walks on trees

    Full text link
    We are interested in the randomly biased random walk on the supercritical Galton--Watson tree. Our attention is focused on a slow regime when the biased random walk (Xn)(X_n) is null recurrent, making a maximal displacement of order of magnitude (logn)3(\log n)^3 in the first nn steps. We study the localization problem of XnX_n and prove that the quenched law of XnX_n can be approximated by a certain invariant probability depending on nn and the random environment. As a consequence, we establish that upon the survival of the system, Xn(logn)2\frac{|X_n|}{(\log n)^2} converges in law to some non-degenerate limit on (0,)(0, \infty) whose law is explicitly computed.Comment: 43 pages. We added a recent work by Jim Pitman ([38]) for the limiting la
    corecore