English
Related papers

Related papers: Sylvester's problem for random walks and bridges

200 papers

Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…

Astrophysics · Physics 2009-11-13 Jun Zhang , Lam Hui

A recently developed model of random walks on a $D$-dimensional hyperspherical lattice, where $D$ is {\sl not} restricted to integer values, is extended to include the possibility of creating and annihilating random walkers. Steady-state…

High Energy Physics - Lattice · Physics 2010-11-19 Carl M. Bender , Peter N. Meisinger , Stefan Boettcher

In this paper, we study (1,2) and (2,1) random walks in varying environments on the lattice of positive half line. We assume that the transition probabilities at site $n$ are asymptotically constants as $n\rightarrow\infty.$ For (1,2)…

Probability · Mathematics 2022-06-22 Hua-Ming Wang , Lanlan Tang

This paper concerns a random walk that moves on the integer lattice and has zero mean and a finite variance. We obtain first an asymptotic estimate of the transition probability of the walk absorbed at the origin, and then, using the…

Probability · Mathematics 2011-03-31 Kohei Uchiyama

A connection is made between the random turns model of vicious walkers and random permutations indexed by their increasing subsequences. Consequently the scaled distribution of the maximum displacements in a particular asymmeteric version…

Combinatorics · Mathematics 2007-05-23 P. J. Forrester

A Bernoulli random walk is a random trajectory starting from 0 and having i.i.d. increments, each of them being $+1$ or -1, equally likely. The other families cited in the title are Bernoulli random walks under various conditionings. A peak…

Probability · Mathematics 2007-05-23 Jean-Maxime Labarbe , Jean-François Marckert

The one-dimensional Brownian motion starting from the origin at time $t=0$, conditioned to return to the origin at time $t=1$ and to stay positive during time interval $0 < t < 1$, is called the Bessel bridge with duration 1. We consider…

Statistical Mechanics · Physics 2008-11-06 Naoki Kobayashi , Minami Izumi , Makoto Katori

We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is a non-compact simple Lie group and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense subgroup.…

Dynamical Systems · Mathematics 2026-05-27 Timothée Bénard , Weikun He

Building upon the knowledge of the distribution of the first positive position reached by a random walker starting from the origin, one can derive new results on the statistics of the gap between the largest and second-largest positions of…

Statistical Mechanics · Physics 2025-09-04 Claude Godrèche , Jean-Marc Luck

If four people with Gaussian-distributed heights stand at Gaussian positions on the plane, the probability that there are exactly two people whose height is above the average of the four is exactly the same as the probability that they…

Probability · Mathematics 2024-07-04 Florian Frick , Andrew Newman , Wesley Pegden

It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…

Condensed Matter · Physics 2009-10-28 C. Godreche , J. M. Luck , M. R. Evans , D. Mukamel , S. Sandow , E. R. Speer

We consider a random walk $\tilde S$ which has different increment distributions in positive and negative half-planes. In the upper half-plane the increments are mean-zero i.i.d. with finite variance. In the lower half-plane we consider two…

Probability · Mathematics 2021-11-18 Andrey Pilipenko , Ben Povar

We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…

Optimization and Control · Mathematics 2016-09-20 Damjan Škulj

The distribution of the first positive position reached by a random walker starting from the origin is fundamental for understanding the statistics of extremes and records in one-dimensional random walks. We present a comprehensive study of…

Statistical Mechanics · Physics 2025-09-03 Claude Godrèche , Jean-Marc Luck

This paper concerns a scaling limit of a one-dimensional random walk $S^x_n$ started from $x$ on the integer lattice conditioned to avoid a non-empty finite set $A$, the random walk being assumed to be irreducible and have zero mean.…

Probability · Mathematics 2019-05-06 Kohei Uchiyama

We consider random walks with independent but not necessarily identical distributed increments. Assuming that the increments satisfy the well-known Lindeberg condition, we investigate the asymptotic behaviour of first-passage times over…

Probability · Mathematics 2016-11-03 Denis Denisov , Alexander Sakhanenko , Vitali Wachtel

We construct examples of a random walk with pairwise-independent steps which is almost-surely bounded, and for any $m$ and $k$ a random walk with $k$-wise independent steps which has no stationary distribution modulo $m$.

Probability · Mathematics 2007-05-23 Itai Benjamini , Gady Kozma , Dan Romik

Consider a sequence of partial sums $S_i= \xi_1+\dots+\xi_i$, $1\leq i\leq n$, starting at $S_0=0$, whose increments $\xi_1,\dots,\xi_n$ are random vectors in $\mathbb R^d$, $d\leq n$. We are interested in the properties of the convex hull…

Probability · Mathematics 2017-08-23 Zakhar Kabluchko , Vladislav Vysotsky , Dmitry Zaporozhets

We consider Monge-Kantorovich optimal transport problems on $\mathbb{R}^d$, $d\ge 1$, with a convex cost function given by the cumulant generating function of a probability measure. Examples include the Wasserstein-2 transport whose cost…

Probability · Mathematics 2017-08-29 Soumik Pal

Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A…

Combinatorics · Mathematics 2022-06-14 Stefan Steinerberger , Rekha R. Thomas