English
Related papers

Related papers: Walks on the slit plane

200 papers

In this article, we consider the number of collisions of three independent simple random walks on a subgraph of the two-dimensional square lattice obtained by removing all horizontal edges with vertical coordinate not equal to 0 and then,…

Probability · Mathematics 2024-10-08 David A. Croydon , Umberto De Ambroggio

We study the simple random walk on stochastic hyperbolic half planar triangulations constructed in Angel and Ray [3]. We show that almost surely the walker escapes the boundary of the map in positive speed and that the return probability to…

Probability · Mathematics 2014-08-20 Omer Angel , Asaf Nachmias , Gourab Ray

We review the existence of the infinite length self-avoiding walk in the half plane and its relationship to bridges. We prove that this probability measure is also given by the limit as $\beta \rightarrow \beta_c-$ of the probability…

Probability · Mathematics 2015-05-19 Ben Dyhr , Michael Gilbert , Tom Kennedy , Gregory F. Lawler , Shane Passon

An overview is presented of recent work on some statistical problems on multiparticle random walks. We consider a Euclidean, deterministic fractal or disordered lattice and N >> 1 independent random walkers initially (t=0) placed onto the…

Statistical Mechanics · Physics 2007-05-23 Luis Acedo , Santos B. Yuste

We consider the proportion of generalized visible lattice points in the plane visited by random walkers. Our work concerns the visible lattice points in random walks in three aspects: (1) generalized visibility along curves; (2) one random…

Number Theory · Mathematics 2020-09-09 Kui Liu , Xianchang Meng

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 a random walk on the Manhattan lattice. The walker must follow the orientations of the bonds in this lattice, and the walker is not allowed to visit a site more than once. When both possible steps are allowed, the walker chooses…

Probability · Mathematics 2018-11-14 Tom Kennedy

Feller's book An Introduction to Probability Theory and Its Application discusses statistics corresponding to sequences of coin tosses, with a dollar being won or lost depending on the outcome of each toss. This is equivalent to analyzing…

Combinatorics · Mathematics 2017-12-06 Anthony Zaleski

For a homogeneous random walk in the quarter plane with nearest-neighbor transitions, starting from some state $(i_0,j_0)$, we study the event that the walk reaches the vertical axis, before reaching the horizontal axis. We derive an exact…

Probability · Mathematics 2013-06-18 Johan S. H. van Leeuwaarden , Kilian Raschel

We consider lattice walks in $\R^k$ confined to the region $0<x_1<x_2...<x_k$ with fixed (but arbitrary) starting and end points. The walks are required to be "reflectable", that is, we assume that the number of paths can be counted using…

Combinatorics · Mathematics 2010-12-17 Thomas Feierl

In this paper we consider an irreducible random walk on the integer lattice $\mathbb{Z}$ that is in the domain of normal attraction of a strictly stable process with index $\alpha\in (1, 2)$ and obtain the asymptotic form of the…

Probability · Mathematics 2018-08-07 Kohei Uchiyama

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…

Probability · Mathematics 2021-12-08 David A. Croydon , Daisuke Shiraishi

In probability theory, reinforced walks are random walks on a lattice (or more generally a graph) that preferentially revisit neighboring `locations' (sites or bonds) that have been visited before. In this paper, we consider walks with…

Statistical Mechanics · Physics 2009-11-13 Jacob G. Foster , Peter Grassberger , Maya Paczuski

We consider a continuous-time branching random walk on $\mathbb{Z}$ in a random non homogeneous environment. Particles can walk on the lattice points or disappear with random intensities. The process starts with one particle at initial time…

Probability · Mathematics 2023-12-12 Vladimir Kutsenko , Stanislav Molchanov , Elena Yarovaya

We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…

Probability · Mathematics 2023-02-14 E. Filichkina , E. Yarovaya

This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. At each step, a nondeterministic walk draws a random set of steps from a predefined set of sets and explores all possible extensions in parallel.…

Combinatorics · Mathematics 2018-12-18 Elie De Panafieu , Mohamed Lamine Lamali , Michael Wallner

The algebraic area probability distribution of closed planar random walks of length N on a square lattice is considered. The generating function for the distribution satisfies a recurrence relation in which the combinatorics is encoded. A…

Statistical Mechanics · Physics 2015-05-13 Stefan Mashkevich , Stéphane Ouvry

In this paper, we study a family of lattice walks which are related to the Hadamard conjecture. There is a bijection between paths of these walks which originate and terminate at the origin and equivalence classes of partial Hadamard…

Probability · Mathematics 2010-03-23 Warwick de Launey , David A. Levin

Relations between the mean values of distributions of flipped spins on periodic Heisenberg XX chain and some aspects of enumerative combinatorics are discussed. The Bethe vectors, which are the state-vectors of the model, are considered…

Mathematical Physics · Physics 2022-11-30 C. Malyshev , N. M. Bogoliubov

We study three different random walk models on several two-dimensional lattices by Monte Carlo simulations. One is the usual nearest neighbor random walk. Another is the nearest neighbor random walk which is not allowed to backtrack. The…

Probability · Mathematics 2016-06-22 Tom Kennedy
‹ Prev 1 3 4 5 6 7 10 Next ›