English
Related papers

Related papers: Multi-point correlations for two dimensional coale…

200 papers

We compute exactly the statistics of the number of records in a discrete-time random walk model on a line where the walker stays at a given position with a nonzero probability $0\leq p \leq 1$, while with the complementary probability…

Statistical Mechanics · Physics 2021-09-08 Satya N. Majumdar , Philippe Mounaix , Gregory Schehr

When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact…

Probability · Mathematics 2026-03-10 Piotr Śniady

This paper is a sequel to Chaika and Krishnan [arXiv:1612.00434]. We again consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice Z^d. We assume that once walks meet, they…

Probability · Mathematics 2021-03-19 Jon Chaika , Arjun Krishnan

We consider the probability that a two-dimensional random walk starting from the origin never returns to the half-line $ (- \infty,0] \times {0}$ before time $n$. Let $X^{(1)}=(X_{1},X_{2})$ be the increment of the two-dimensional random…

Probability · Mathematics 2012-12-13 Yasunari Fukai

For the model of two-dimensional random interlacements in the critical regime (i.e., $\alpha=1$), we prove that the vacant set is a.s.\ infinite, thus solving an open problem from arXiv:1502.03470. Also, we prove that the entrance measure…

Probability · Mathematics 2022-09-20 Francis Comets , Serguei Popov

We investigate the dynamic scaling properties of stochastic particle systems on a non-deterministic scale-free network. It has been known that the dynamic scaling behavior depends on the degree distribution exponent of the underlying…

Statistical Mechanics · Physics 2007-05-23 Jae Dong Noh , Sang-Woo Kim

We present a new finite-size scaling method for the random walks (RW) superseeding a previously widely used renormalization group approach, which is shown here to be inconsistent. The method is valid in any dimension and is based on the…

Condensed Matter · Physics 2009-10-22 Achille Giacometti , Hisao Nakanishi

We study diffusion-limited pair annihilation $A+A\to 0$ on one-dimensional lattices with inhomogeneous nearest neighbour hopping in the limit of infinite reaction rate. We obtain a simple exact expression for the particle concentration…

Statistical Mechanics · Physics 2009-10-31 G. M. Schütz , K. Mussawisade

We study the annihilating random walk with long-range interaction in one dimension. Each particle performs random walks on a one-dimensional ring in such a way that the probability of hopping toward the nearest particle is $W= [1 - \epsilon…

Statistical Mechanics · Physics 2020-10-13 Su-Chan Park

We describe a universal transition mechanism characterizing the passage to an annealed behavior and to a regime where the fluctuations about this behavior are Gaussian, for the long time asymptotics of the empirical average of the expected…

Probability · Mathematics 2007-07-04 Gerard Ben Arous , Stanislav Molchanov , Alejandro F. Ramirez

We study a family of correlated one-dimensional random walks with a finite memory range M.These walks are extensions of the Taylor's walk as investigated by Goldstein, which has a memory range equal to one. At each step, with a probability…

adap-org · Physics 2009-10-31 Roger Bidaux , Nino Boccara

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

We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…

Probability · Mathematics 2011-10-27 Ron Rosenthal

Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler asked the question: for which graphs are two independent walks…

Probability · Mathematics 2011-04-20 Peter Gacs

We study a family of interacting particle systems with annihilating and coalescing reactions. Two types of particles are interspersed throughout a transitive unimodular graph. Both types diffuse as simple random walks with possibly…

Probability · Mathematics 2025-11-04 Sungwon Ahn , Matthew Junge , Hanbaek Lyu , Lily Reeves , Jacob Richey , David Sivakoff

For over 30 years, mode-coupling theory (MCT) has been the de facto theoretic description of dense fluids and the liquid-glass transition. MCT, however, is limited by its ad hoc construction and lacks a mechanism to institute corrections.…

Soft Condensed Matter · Physics 2015-08-12 David D. McCowan

We consider non-homogeneous random walks on the two-dimensional positive quadrant $\mathbb{N}^2$ and the one-dimensional slab $\{0,1,\dots,k\}\times\mathbb{N}$. In the 1960's the following question was asked for $\mathbb{N}^2$: is it true…

Probability · Mathematics 2025-12-18 Rupert Li , Elchanan Mossel , Benjamin Weiss

We perform simulations for one dimensional continuous-time random walks in two dynamic random environments with fast (independent spin-flips) and slow (simple symmetric exclusion) decay of space-time correlations, respectively. We focus on…

Probability · Mathematics 2012-05-23 L. Avena , P. Thomann

We derive a local limit theorem for normal, moderate, and large deviations for symmetric simple random walk on the square lattice in dimensions one and two that is an improvement of existing results for points that are particularly distant…

Probability · Mathematics 2020-05-12 Christian Beneš

This is the second in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. The first…

Discrete Mathematics · Computer Science 2019-11-14 Joel Friedman , David Kohler