English
Related papers

Related papers: On the probability that integrated random walks st…

200 papers

Let $X_1, X_2, \ldots$ be a sequence of i.i.d. real-valued random variables with mean zero, and consider the scaled random walk of the form $Y^N_{k+1} = Y^N_{k} + a_N(Y^N_k) X_{k+1}$, where $a_N: \mathbb R \to \mathbb R_+$. We show, under…

Probability · Mathematics 2015-09-24 Stefan Ankirchner , Thomas Kruse , Mikhail Urusov

The exponential functional of simple, symmetric random walks with negative drift is an infinite polynomial $Y = 1 + \xi_1 + \xi_1 \xi_2 + \xi_1 \xi_2 \xi_3 + ...$ of independent and identically distributed non-negative random variables. It…

Combinatorics · Mathematics 2010-08-10 Tamas Szabados , Balazs Szekely

Let $n = b_1 + ... + b_k = b_1' + \cdot + b_k'$ be a pair of compositions of $n$ into $k$ positive parts. We say this pair is {\em irreducible} if there is no positive $j < k$ for which $b_1 + ... b_j = b_1' + ... b_j'$. The probability…

Combinatorics · Mathematics 2007-05-23 Edward A. Bender , Gregory F. Lawler , Robin Pemantle , Herbert S. Wilf

Consider the boundary case in a one-dimensional super-critical branching random walk. It is known that upon the survival of the system, the minimal position after $n$ steps behaves in probability like ${3\over 2} \log n$ when $n\to \infty$.…

Probability · Mathematics 2011-02-02 Elie Aidekon , Zhan Shi

Recently Simenhaus proved that for any elliptic random walk in random environment, transience in the neighborhood of a given direction is equivalent to the a.s. existence of a deterministic asymptotic direction and to transience in any…

Probability · Mathematics 2009-02-09 Alexander Drewitz , Alejandro F. Ramírez

Consider a random walk $S=(S_n:n\geq 0)$ that is ``perturbed'' by a stationary sequence $(\xi_n:n\geq 0)$ to produce the process $(S_n+\xi_n:n\geq0)$. This paper is concerned with computing the distribution of the all-time maximum…

Probability · Mathematics 2007-05-23 Victor F. Araman , Peter W. Glynn

We revisit the statistics of extremes and records of symmetric random walks with stochastic resetting, extending earlier studies in several directions. We put forward a diffusive scaling regime (symmetric step length distribution with…

Statistical Mechanics · Physics 2022-06-29 Claude Godrèche , Jean-Marc Luck

Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…

Probability · Mathematics 2021-02-15 Jimmy He

In this note we first consider local times of random walks killed at leaving positive half-axis. We prove that the distribution of the properly rescaled local time at point $N$ conditioned on being positive converges towards an exponential…

Probability · Mathematics 2014-12-22 Denis Denisov , Vitali Wachtel

Let $P_n^1,\dots, P_n^d$ be $n\times n$ permutation matrices drawn independently and uniformly at random, and set $S_n^d:=\sum_{\ell=1}^d P_n^\ell$. We show that if $\log^{12}n/(\log \log n)^{4} \le d=O(n)$, then the empirical spectral…

Probability · Mathematics 2018-04-05 Anirban Basak , Nicholas Cook , Ofer Zeitouni

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

Probability · Mathematics 2012-10-08 Christophe Gallesco , Serguei Popov

We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution…

Probability · Mathematics 2018-09-20 Andrea Collevecchio , Paul Jung

We bound the rate of convergence to uniformity for certain random walks on the complete monomial groups G \wr S_n for any group G. These results provide rates of convergence for random walks on a number of groups of interest: the…

Probability · Mathematics 2012-08-27 Clyde H. Schoolfield,

Let $S=(S_k)_{k\geq 0}$ be a random walk on $\mathbb{Z}$ and $\xi=(\xi_{i})_{i\in\mathbb{Z}}$ a stationary random sequence of centered random variables, independent of $S$. We consider a random walk in random scenery that is the sequence of…

Probability · Mathematics 2008-07-23 Nadine Guillotin-Plantard , Clémentine Prieur

Let $S_k$ be a random walk in $R^d$ such that its distribution of increments does not assign mass to hyperplanes. We study the probability $p_n$ that the convex hull $conv (S_1, \ldots , S_n)$ of the first $n$ steps of the walk does not…

Probability · Mathematics 2017-08-02 Vladislav Vysotsky , Dmitry Zaporozhets

Let $G$ be a finitely generated group of polynomial volume growth equipped with a word-length $|\cdot|$. The goal of this paper is to develop techniques to study the behavior of random walks driven by symmetric measures $\mu$ such that, for…

Probability · Mathematics 2015-07-14 Laurent Saloff-Coste , Tianyi Zheng

Conditions are provided under which an endomorphism on quasisymmetric functions gives rise to a left random walk on the descent algebra which is also a lumping of a left random walk on permutations. Spectral results are also obtained.…

Combinatorics · Mathematics 2007-09-12 Patricia Hersh , Samuel K. Hsiao

A measure on a locally compact group is called spread out if one of its convolution powers is not singular with respect to Haar measure. Using Markov chain theory, we conduct a detailed analysis of random walks on homogeneous spaces with…

Dynamical Systems · Mathematics 2023-06-22 Roland Prohaska

For a generalized step reinforced random walk, starting from the origin, the first step is taken according to the first element of an innovation sequence. Then in subsequent epochs, it recalls a past epoch with probability proportional to a…

Probability · Mathematics 2025-05-12 Aritra Majumdar , Krishanu Maulik

We study driven-dissipative activated random walk with sleep probability $p$ on an $n$-vertex complete graph with a sink that traps jumping particles with probability $q_n$. We show that the number of sleeping particles $S_n$ left by the…

Probability · Mathematics 2026-05-21 Matthew Junge , Harley Kaufman , Josh Meisel
‹ Prev 1 8 9 10 Next ›