English
Related papers

Related papers: Upper moderate deviation probabilities for the max…

200 papers

Let $\left\{ Z_{n},n=0,1,2,...\right\} $ be a critical branching process in random environment and let $\left\{ S_{n},n=0,1,2,...\right\} $ be its associated random walk. It is known that if the increments of this random walk belong…

Probability · Mathematics 2022-09-29 Vladimir Vatutin , Elena Dyakonova

Let $G$ be a group with a non-elementary action on a proper CAT(0) space $X$, and let $\mu$ be a measure on $G$ such that the random walk $(Z_n)_n$ generated by $\mu$ has finite second moment on $X$. Let $o$ be a basepoint in $X$, and…

Group Theory · Mathematics 2024-07-31 Corentin Le Bars

We introduce a multidimensional walk with memory and random tendency. The asymptotic behaviour is characterized, proving a law of large numbers and showing a phase transition from diffusive to superdiffusive regimes. In first case, we…

Probability · Mathematics 2020-10-09 Manuel González-Navarrete

We study the rate of convergence to equilibrium of the self-repellent random walk and its local time process on the discrete circle $\mathbb{Z}_n$. While the self-repellent random walk alone is non-Markovian since the jump rates depend on…

Probability · Mathematics 2025-12-01 Andreas Eberle , Francis Lörler

We provide sufficient conditions which ensure that the intrinsic martingale in the supercritical branching random walk converges exponentially fast to its limit. The case of Galton-Watson processes is particularly included so that our…

Probability · Mathematics 2011-12-12 A. Iksanov , M. Meiners

We establish the discrete approximation to Brownian motion with varying dimension (BMVD in abbreviation) by random walks. The setting is very similar to that in [11], but here we use a different method allowing us to get rid the…

Probability · Mathematics 2021-11-16 Shuwen Lou

We obtain upper bounds (in most cases, sharp) for the hitting times of random walks on finite undirected graphs expressed as functions of the graph's number of edges. In particular, we show that the maximum hitting time for a simple random…

Combinatorics · Mathematics 2017-02-15 Dmitri Fomin

Let $A_N$ be distributed according to the Haar probability measure on the orthogonal group $\mathscr{O}(N)$ for each $N\in\mathbb{N}$. It is well-known that the upper left $m_N\times k_N$ block of $\sqrt{N}A_N$ with $m_Nk_N = o(N)$…

Probability · Mathematics 2025-09-30 Philipp Tuchel

The asymptotics of the probability that the self-intersection local time of a random walk on $\Z^d$ exceeds its expectation by a large amount is a fascinating subject because of its relation to some models from Statistical Mechanics, to…

Probability · Mathematics 2010-11-16 Wolfgang König

We provide Monte Carlo estimates of the scaling of the length $L_{n}$ of the longest increasing subsequences of $n$-steps random walks for several different distributions of step lengths, short and heavy-tailed. Our simulations indicate…

Statistical Mechanics · Physics 2017-01-19 J. Ricardo G. Mendonça

We consider a one dimensional ballistic random walk evolving in a parametric independent and identically distributed random environment. We study the asymptotic properties of the maximum likelihood estimator of the parameter based on a…

Statistics Theory · Mathematics 2014-04-29 Mikael Falconnet , Dasha Loukianova , Catherine Matias

Let $W_n, n\in\mn_{0}$ be an intrinsic martingale with almost sure limit $W$ in a supercritical branching random walk. We provide criteria for the $L_p$-convergence of the series $\sum_{n\ge 0} e^{an}(W-W_n)$ for $p>1$ and $a>0$. The result…

Probability · Mathematics 2009-03-24 Gerold Alsmeyer , Alex Iksanov , Sergej Polotsky , Uwe Roesler

We consider asymptotics for the maximum of a modulated random walk whose increments $\xi_n^{X_n}$ are heavy-tailed. Of particular interest is the case where the modulating process $X$ is regenerative. Here we study also the maximum of the…

Probability · Mathematics 2017-11-29 Sergey Foss , Stan Zachary

We consider branching random walk in spatial random branching environment (BRWRE) in dimension one, as well as related differential equations: the Fisher-KPP equation with random branching and its linearized version, the parabolic Anderson…

Probability · Mathematics 2019-04-04 Jiří Černý , Alexander Drewitz

We consider a standard binary branching Brownian motion on the real line. It is known that the maximal position $M_t$ among all particles alive at time $t$, shifted by $m_t = \sqrt{2} t - \frac{3}{2\sqrt{2}} \log t$ converges in law to a…

Probability · Mathematics 2020-07-02 Xinxin Chen , Hui He , Bastien Mallein

The probability distribution of the maximum $M_t$ of a single resetting Brownian motion (RBM) of duration $t$ and resetting rate $r$, properly centred and scaled, is known to converge to the standard Gumbel distribution of the classical…

Statistical Mechanics · Physics 2026-01-19 Alexander K. Hartmann , Satya N. Majumdar , Gregory Schehr

This work extends the studies on the minimum and extremal process of a supercritical branching random walk outside the boundary case which cannot be reduced to the boundary case. We study here the situation where the log-generating function…

Probability · Mathematics 2026-01-14 Xinxin Chen , Haojie Hou

We take the point of view of a particle performing random walk with bounded jumps on $\mathbb{Z}^d$ in a stationary and ergodic random environment. We prove the quenched large deviation principle (LDP) for the pair empirical measure of the…

Probability · Mathematics 2008-12-17 Atilla Yilmaz

We consider a branching random walk initiated by a single particle at location 0 in which particles alternately reproduce according to the law of a Galton-Watson process and disperse according to the law of a driftless random walk on the…

Probability · Mathematics 2014-03-31 Steven P. Lalley , Yuan Shao

Let $G = (V,E)$ be a connected directed graph on $n$ vertices. Assign values from the set $\{1,2,\dots,n\}$ to the vertices of $G$ and update the values according to the following rule: uniformly at random choose a vertex and update its…

Data Structures and Algorithms · Computer Science 2024-06-05 John Larkin