Related papers: Leading All The Way

We consider a nearest-neighbor, one-dimensional random walk $\{X_n\}_{n\geq 0}$ in a random i.i.d. environment, in the regime where the walk is transient with speed v_P > 0 and there exists an $s\in(1,2)$ such that the annealed law of…

Consider $2k-1$ voters, each of which has a preference ranking between $n$ given alternatives. An alternative $A$ is called a Condorcet winner, if it wins against every other alternative $B$ in majority voting (meaning that for every other…

We introduce a toy model of the "rat race" in which individuals try to better themselves relative to the rest of the population. An individual is characterized by a real-valued fitness and each advances at a constant rate by an amount that…

Consider a random walk in $\mathbb{R}^d$ that starts at the origin and whose increment distribution assigns zero probability to any affine hyperplane. We solve Sylvester's problem for these random walks by showing that the probability that…

This paper studies a variant of the contest model introduced in Seel and Strack [J. Econom. Theory 148 (2013) 2033-2048]. In the Seel-Strack contest, each agent or contestant privately observes a Brownian motion, absorbed at zero, and…

In this paper, we study a distribution of labeled particles on a continuous ring. It arises in three different ways, all related to the multi-type TASEP on a ring. We prove formulas for the probability density function for some permutations…

We study competing first passage percolation on graphs generated by the configuration model. At time 0, vertex 1 and vertex 2 are infected with the type 1 and the type 2 infection, respectively, and an uninfected vertex then becomes type 1…

In the game of Matching Pennies, Alice and Bob each hold a penny, and at every tick of the clock they simultaneously display the head or the tail sides of their coins. If they both display the same side, then Alice wins Bob's penny; if they…

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

We consider a system of three random walkers (a `cheetah' surrounded by two `antelopes') diffusing in one dimension. The cheetah and the antelopes diffuse, but the antelopes experience in addition a deterministic relative drift velocity,…

Multi-round competitions often double or triple the points awarded in the final round, calling it a bonus, to maximize spectators' excitement. In a two-player competition with $n$ rounds, we aim to derive the optimal bonus size to maximize…

Let $X_1$, $X_2$, $...$ be a sequence of independently and identically distributed random variables with $\mathsf{E}X_1=0$, and let $S_0=0$ and $S_t=S_{t-1}+X_t$, $t=1,2,...$, be a random walk. Denote $\tau={cases}\inf\{t>1: S_t\leq0\},…

Associated to a random walk on $\mathbb{Z}$ and a positive integer $n$, there is a return probability of the random walk returning to the origin after $n$ steps. An interesting question is when the set of return probabilities uniquely…

A diffusing lion pursues a diffusing lamb when both of them are allowed to get back to their homes intermittently. Identifying the system with a pair of vicious random walkers, we study their dynamics under Poissonian and sharp resetting.…

Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ with increments $(1,0)$, $(-1,0)$, $(0,1)$ and $(0,-1)$; $X$ represents, at arrivals and service completions, the lengths of two queues working in parallel whose service and…

Axis-driven random walks were introduced by P. Andreoletti and P. Debs [AD23] to provide a rough description of the behaviour of a particle trapped in a localized force field. In contrast to their work, we examine the scenario where a…

Consider a nearest neighbor random walk on the two-dimensional integer lattice, where each vertex is initially labeled either `H' or `V', uniformly and independently. At each discrete time step, the walker resamples the label at its current…

We analyse the mixing profile of a random walk on a dynamic random permutation, focusing on the regime where the walk evolves much faster than the permutation. Two types of dynamics generated by random transpositions are considered: one…

Fix integers $d \geq 2$ and $k\geq d-1$. Consider a random walk $X_0, X_1, \ldots$ in $\mathbb{R}^d$ in which, given $X_0, X_1, \ldots, X_n$ ($n \geq k$), the next step $X_{n+1}$ is uniformly distributed on the unit ball centred at $X_n$,…

Consider two independent Goldstein-Kac telegraph processes $X_1(t)$ and $X_2(t)$ on the real line $\Bbb R$. The processes $X_k(t), \; k=1,2,$ are performed by stochastic motions at finite constant velocities $c_1>0, \; c_2>0,$ that start at…