Related papers: A Reflection Principle for Three Vicious Walkers
In this paper, we consider the problem of avoiding a single vincular pattern of length three by derangements in the flattened sense and find explicit formulas for the generating functions enumerating members of each corresponding avoidance…
Motivated by the diffusion-reaction kinetics on interstellar dust grains, we study a first-passage problem of mortal random walkers in a confined two-dimensional geometry. We provide an exact expression for the encounter probability of two…
We use a reflection argument, introduced by Gessel and Zeilberger, to count the number of k-step walks between two points which stay within a chamber of a Weyl group. We apply this technique to walks in the alcoves of the classical affine…
We extend the Dirichlet principle to non-reversible Markov processes on countable state spaces. We present two variational formulas for the solution of the Poisson equation or, equivalently, for the capacity between two disjoint sets. As an…
We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}^{n}$ that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure…
An obvious way to simulate a L\'evy process $X$ is to sample its increments over time $1/n$, thus constructing an approximating random walk $X^{(n)}$. This paper considers the error of such approximation after the two-sided reflection map…
The random billiard walk is a stochastic process $(L_t)_{t\geq 0}$ in which a laser moves through the Coxeter arrangement of an affine Weyl group in $\mathbb{R}^d$, reflecting at each hyperplane with probability $p\in (0, 1)$ and…
We develop walk-on-sphere for fractional Poisson equations with Dirichilet boundary conditions in high dimensions. The walk-on-sphere method is based on probabilistic represen tation of the fractional Poisson equation. We propose effcient…
We consider the problem of enumerating the permutations containing exactly $k$ occurrences of a pattern of length 3. This enumeration has received a lot of interest recently, and there are a lot of known results. This paper presents an…
We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…
In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…
We examine the Zermelo Fraenkel set theory with Choice (ZFC) enhanced by one of the (structural) reflection principles down to a small cardinal and/or Recurrence Axioms defined below. The strongest forms of reflection principles spotlight…
The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{\'e}vy walks for which the persistence times depend on some internal…
We consider a statistical system in a planar wedge, for values of the bulk parameters corresponding to a first order phase transition and with boundary conditions inducing phase separation. Our previous exact field theoretical solution for…
We present two classes of random walks restricted to the quarter plane whose generating function is not holonomic. The non-holonomy is established using the iterated kernel method, a recent variant of the kernel method. This adds evidence…
Let $W$ be a finite Weyl group and $\widetilde W$ the corresponding affine Weyl group. A random element of $\widetilde W$ can be obtained as a reduced random walk on the alcoves of $\widetilde W$. By a theorem of Lam (Ann. Prob. 2015), such…
We employ the broken-link model to create a barrier with slits in a two-dimensional lattice. The diffraction and interference patterns of the probability distribution of quantum walkers passing through the slits are analyzed. Simulations…
Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind,…
It is a classical result in combinatorics that among lattice paths with 2m steps U=(1,1) and D=(1,-1) starting at the origin, the number of those that do not go below the x-axis equals the number of those that end on the x-axis. A much more…
We work with lattice walks in $\mathbb{Z}^{r+1}$ using step set $\{\pm 1\}^{r+1}$ that finish with $x_{r+1} = 0$. We further impose conditions of avoiding backtracking (i.e. $[v,-v]$) and avoiding consecutive steps (i.e. $[v,v]$) each…