English
Related papers

Related papers: Precise logarithmic asymptotics for the right tail…

200 papers

We consider certain one dimensional ordinary stochastic differential equations driven by additive Brownian motion of variance $\varepsilon ^2$. When $\varepsilon =0$ such equations have an unstable non-hyperbolic fixed point and the drift…

Probability · Mathematics 2015-09-30 Giambattista Giacomin , Mathieu Merle

We study tail behaviour of the distribution of the area under the positive excursion of a random walk which has negative drift and light-tailed increments. We determine the asymptotics for local probabilities for the area and prove a local…

Probability · Mathematics 2017-08-22 Elena Perfilev , Vitali Wachtel

Let T be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The lambda-biased random walk (X_t, t>=0) on T is the nearest-neighbor random walk which, when at a…

Probability · Mathematics 2012-05-08 Amir Dembo , Nike Sun

Donsker's theorem shows that random walks behave like Brownian motion in an asymptotic sense. This result can be used to approximate expectations associated with the time and location of a random walk when it first crosses a nonlinear…

Statistics Theory · Mathematics 2013-02-01 Robert Keener

We obtain results on both weak and almost sure asymptotic behaviour of power variations of a linear combination of independent Wiener process and fractional Brownian motion. These results are used to construct strongly consistent parameter…

Probability · Mathematics 2013-06-20 Marco Dozzi , Yuliya Mishura , Georgiy Shevchenko

We prove that the speed of $\lambda$-biased random walks on a supercritical Galton-Watson tree without leaves is differentiable when $\lambda\in(0,1)$, and give an expression of the derivative using a certain 2-dimensional Gaussian random…

Probability · Mathematics 2019-06-21 Yuki Tokushige

We consider the minimization over probability measures of the expected value of a random variable, regularized by relative entropy with respect to a given probability distribution. In the general setting we provide a complete…

Probability · Mathematics 2020-09-29 Joris Bierkens , Hilbert J. Kappen

We consider a transient random walk $(X_n)$ in random environment on a Galton--Watson tree. Under fairly general assumptions, we give a sharp and explicit criterion for the asymptotic speed to be positive. As a consequence, situations with…

Probability · Mathematics 2011-01-11 Elie Aidekon

The purpose of this note is to show how simple Optimal Transport arguments, on the real line, can be used in Superconcentration theory. This methodology is efficient to produce sharp non-asymptotic variance bounds for various functionals…

Probability · Mathematics 2018-04-11 Kevin Tanguy

We study the asymptotic tail probability of the first-passage time over a moving boundary for a random walk conditioned to return to zero, where the increments of the random walk have finite variance. Typically, the asymptotic tail behavior…

Probability · Mathematics 2017-08-09 Fiona Sloothaak , Vitali Wachtel , Bert Zwart

The article studies the almost surely asymptotics of extreme values $\bar{\xi}_n = \max_{1\leq i \leq n} \xi_i$, where $ \xi , \xi_1 , \xi_2 , \ldots$ are discrete identically distributed random variables. One of the main results on this…

Probability · Mathematics 2025-03-27 Kateryna Akbash , Ivan Matsak

By considering a continuous pruning procedure on Aldous's Brownian tree, we construct a random variable $\Theta$ which is distributed, conditionally given the tree, according to the probability law introduced by Janson as the limit…

Probability · Mathematics 2013-05-14 Romain Abraham , Jean-François Delmas

In this article we focus on a general model of random walk on random marked trees. We prove a recurrence criterion, analogue to the recurrence criterion proved by R. Lyons and Robin Pemantle (1992) in a slightly different model. In the…

Probability · Mathematics 2011-09-02 Gabriel Faraud

We derive an upper bound for the annealed return probability for the simple random walk on supercritical Bienaym\'e-Galton-Watson trees. The bound decays subexponentially in time $t$ with $t^{1/3}$ in the exponent. It is valid for all…

Probability · Mathematics 2026-03-04 Markus Heydenreich , Peter Müller , Sara Terveer

We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…

Probability · Mathematics 2023-12-08 Gabriel Berzunza Ojeda , Cecilia Holmgren , Svante Janson

In this paper, we consider the $(1,R)$ state-dependent reflecting random walk (RW) on the half line, allowing the size of jumps to the right at maximal $R$ and to the left only 1. We provide an explicit criterion for positive recurrence and…

Probability · Mathematics 2013-02-27 Wenming Hong , Ke Zhou

We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results…

Probability · Mathematics 2022-04-26 Louigi Addario-Berry , Anna Brandenberger , Jad Hamdan , Céline Kerriou

We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…

Probability · Mathematics 2016-12-15 Benedikt Stufler

We consider the Gittins index for a normal distribution with unknown mean $\theta$ and known variance where $\theta$ has a normal prior. In addition to presenting some monotonicity properties of the Gittins index, we derive an approximation…

Statistics Theory · Mathematics 2007-06-13 Yi-Ching Yao

A random walk (or a Wiener process), possibly with drift, is observed in a noisy or delayed fashion. The problem considered in this paper is to estimate the first time \tau the random walk reaches a given level. Specifically, the p-moment…

Information Theory · Computer Science 2012-03-22 Marat V. Burnashev , Aslan Tchamkerten