Related papers: Touchard's Drunkard
Let $\mathcal{M}(n)$ be the subgroup of $GL(n,\mathbb{Z})$ generated by the particular involutions that are identical to the identity, except for a single line where $-1$ and $+1$ alternate. We study the properties of $\mathcal{M}(n)$, and…
The identity by Chaundy and Bullard expresses $1$ as a sum of two truncated binomial series in one variable where the truncations depend on two different non-negative integers. We present basic and elliptic extensions of the…
In this note, we try to analyze and clarify the intriguing interplay between some counting problems related to specific thermalized weighted graphs and random walks consistent with such graphs.
A method is described to count simple diagonal walks on $\mathbb{Z}^2$ with a fixed starting point and endpoint on one of the axes and a fixed winding angle around the origin. The method involves the decomposition of such walks into smaller…
Let $\{\mm_n, n=0,1,...\}$ be the supercritical branching random walk starting with one initial ancestor located at the origin of the real line. For $n=0,1,...$ let $W_n$ be the moment generating function of $\mm_n$ normalized by its mean.…
A survey is presented of known results concerning simple random walk on the class of distance-regular graphs. One of the highlights is that electric resistance and hitting times between points can be explicitly calculated and given strong…
Recent theoretical predictions on DNA mechanical separation induced by pulling forces are numerically tested within a model in which self-avoidance for DNA strands is fully taken into account. DNA strands are described by interacting pairs…
Skew Dyck paths without up-down-left are enumerated. In a second step, the number of contiguous subwords 'up-down-left' are counted. This explains and extends results that were posted in the Encyclopedia of Integer Sequences.
A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in…
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…
Open Quantum Walks (OQWs) are exclusively driven by dissipation and are formulated as completely positive trace preserving (CPTP) maps on underlying graphs. The microscopic derivation of discrete and continuous in time OQWs is presented. It…
This note contains a short and simple proof of Wormald's differential equation method (that yields slightly improved approximation guarantees and error probabilities). This powerful method uses differential equations to approximate the…
We prove an almost sure invariance principle for a random walker among i.i.d. conductances in $\Z^d$, $d\geq 2$. We assume conductances are bounded from above but we dot require they are bounded from below.
Reflected random walk in higher dimension arises from an ordinary random walk (sum of i.i.d. random variables): whenever one of the reflecting coordinates becomes negative, its sign is changed, and the process continues from that modified…
Let $M_n$ be the number of steps of the loop-erasure of a simple random walk on $\mathbb{Z}^2$ from the origin to the circle of radius $n$. We relate the moments of $M_n$ to $Es(n)$, the probability that a random walk and an independent…
We show that the dissipative Abelian sandpile on a graph L can be related to a random walk on a graph which consists of L extended with a trapping site. From this relation it can be shown, using exact results and a scaling assumption, that…
Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…
Explicit formulas for the Gauss decomposition of elliptic Cauchy type matrices are derived in a very simple way. The elliptic Cauchy identity is an immediate corollary.
We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree conditioned to survive when the offspring distribution, $Z$ say, is in the domain of attraction of a stable law with index…
We present a procedure that determines the law of a random walk in an iid random environment as a function of a single "typical" trajectory. We indicate when the trajectory characterizes the law of the environment, and we say how this law…