English
Related papers

Related papers: Tournaments and random walks

200 papers

We study asymptotic properties of spatially non-homogeneous random walks with non-integrable increments, including transience, almost-sure bounds, and existence and non-existence of moments for first-passage and last-exit times. In our…

Probability · Mathematics 2012-08-03 Ostap Hryniv , Iain M. MacPhee , Mikhail V. Menshikov , Andrew R. Wade

Recently, in ["The coin-turning walk and its scaling limit", Electronic Journal of Probability, 25 (2020)], the ``coin-turning walk'' was introduced on ${\mathbb Z}$. It is a non-Markovian process where the steps form a (possibly)…

Probability · Mathematics 2022-10-10 Janos Englander , Stanislav Volkov

A classical random walk $(S_t, t\in\mathbb{N})$ is defined by $S_t:=\displaystyle\sum_{n=0}^t X_n$, where $(X_n)$ are i.i.d. When the increments $(X_n)_{n\in\mathbb{N}}$ are a one-order Markov chain, a short memory is introduced in the…

Probability · Mathematics 2012-08-17 Peggy Cénac , Brigitte Chauvin , Samuel Herrmann , Pierre Vallois

We consider random walks on the surface of the sphere $S_{n-1}$ ($n \geq 2$) of the $n$-dimensional Euclidean space $E_n$, in short a hypersphere. By solving the diffusion equation in $S_{n-1}$ we show that the usual law $<r^2 > \varpropto…

Statistical Mechanics · Physics 2009-11-10 Jean-Michel Caillol

The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…

Probability · Mathematics 2010-04-08 Alexander E. Holroyd , James Propp

Given a labelled tournament on $[n]$, \emph{inverting} a vertex subset $X$ means reversing every edge with both endpoints in $X$. Alon, Powierski, Savery, Scott, and Wilmer~\cite{AlonPowierskiSaveryScottWilmer2024} asked for the mixing time…

Combinatorics · Mathematics 2026-03-09 Jiangdong Ai

We study records generated by Brownian particles in one dimension. Specifically, we investigate an ordinary random walk and define the record as the maximal position of the walk. We compare the record of an individual random walk with the…

Statistical Mechanics · Physics 2014-06-13 E. Ben-Naim , P. L. Krapivsky

We call one-way simple random walk a random walk in the quadrant Z_+^n whose increments belong to the canonical base. In relation with representation theory of Lie algebras and superalgebras, we describe the law of such a random walk…

Representation Theory · Mathematics 2012-02-17 Cédric Lecouvey , Emmanuel Lesigne , Marc Peigné

Modeling of polymer chains has received a lot of attention in mathematics. In fact, probabilistic models that naturally arise in statistical mechanics have been widely studied by mathematicians for the very challenging and novel problems…

Probability · Mathematics 2007-05-23 Francesco Caravenna

We study the asymptotic behaviour of additive functionals of random walks in random scenery. We establish bounds for the moments of the local time of the Kesten and Spitzer process.These bounds combined with a previous moment convergence…

Dynamical Systems · Mathematics 2021-01-05 Françoise Pene

We study the persistence exponent for the first passage time of a random walk below the trajectory of another random walk. More precisely, let $\{B_n\}$ and $\{W_n\}$ be two centered, weakly dependent random walks. We establish that…

Probability · Mathematics 2019-05-21 Bastien Mallein , Piotr Miłoś

For the perimeter length and the area of the convex hull of the first $n$ steps of a planar random walk, we study $n \to \infty$ mean and variance asymptotics and establish non-Gaussian distributional limits. Our results apply to random…

Probability · Mathematics 2015-09-25 Andrew R. Wade , Chang Xu

Let $G$ be an infinite, locally finite graph. We investigate the relation between supercritical, transient branching random walk and the Martin boundary of its underlying random walk. We show results regarding the typical asymptotic…

Probability · Mathematics 2024-07-10 Daniela Bertacchi , Elisabetta Candellero , Fabio Zucca

Let $\{S_n,n\geq 0\} $ be a random walk whose increments belong without centering to the domain of attraction of an $\alpha$-stable law $\{Y_t,t\geq 0\}$, i.e. $S_{nt}/a_n\Rightarrow Y_t,t\geq 0,$ for some scaling constants $a_n$. Assuming…

Probability · Mathematics 2023-03-15 Congzao Dong , Elena Dyakonova , Vladimir Vatutin

In this paper, we study the asymptotic behavior of the number of rarely visited edges (i.e., edges that visited only once) of a simple symmetric random walk on $\mathbb{Z}$. Let $\alpha(n)$ be the number of rarely visited edges up to time…

Probability · Mathematics 2026-01-21 Ze-Chun Hu , Xue Peng , Renming Song , Yuan Tan

We consider a variant of random walks on finite groups. At each step, we choose an element from a set of generators ("directions") uniformly, and an integer from a power law ("speed") distribution associated with the chosen direction. We…

Probability · Mathematics 2022-03-14 Laurent Saloff-Coste , Yuwen Wang

We consider the simple random walk on the $N$-dimensional integer lattice from the perspective of evaluating asymptotically the duration of play in the multidimensional gambler\apost s ruin problem. We show that, under suitable rescalings,…

Probability · Mathematics 2020-12-08 Achillefs Tzioufas

Let $(X,d)$ be a geodesic Gromov-hyperbolic space, $o \in X$ a basepoint and $\mu$ a countably supported non-elementary probability measure on $\operatorname{Isom}(X)$. Denote by $z_n$ the random walk on $X$ driven by the probability…

Probability · Mathematics 2022-03-15 Richard Aoun , Pierre Mathieu , Cagri Sert

We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…

Probability · Mathematics 2013-07-22 Jean-François Le Gall , Shen Lin

Given a sequence of $n$ real numbers $\{S_i\}_{i\leq n}$, we consider the longest weakly increasing subsequence, namely $i_1<i_2<\dots <i_L$ with $S_{i_k} \leq S_{i_{k+1}}$ and $L$ maximal. When the elements $S_i$ are i.i.d. uniform random…

Probability · Mathematics 2016-09-28 Omer Angel , Richárd Balka , Yuval Peres
‹ Prev 1 4 5 6 7 8 10 Next ›