Related papers: Generating Functions for Asymmetric Random Walk Pr…
A random walk generated by a sum of independent identity distributed random variables with positive expectation is considered. The limiting distributions for the first- passage -time of a step-function boundary are derived.
We consider the branching random walk in random environment with a random absorption wall. When we add this barrier, we discuss some topics related to the survival probability. We assume that the random environment is i.i.d., $S_i$ is a…
In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…
This short note shows that the recently proposed generating function for loop hafnians -- originally derived using quantum-optical methods for a restricted class of matrices -- is in fact valid for arbitrary symmetric matrices. The proof…
In the present paper, we use difference Galois theory to study the nature of the generating function counting walks with small steps in the quarter plane. These series are trivariate formal power series $Q(x,y,t)$ that count the number of…
We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the $3.12^2$ lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the…
Nearest neighbor random walks in the quarter plane that are absorbed when reaching the boundary are studied. The cases of positive and zero drift are considered. Absorption probabilities at a given time and at a given site are made…
Exact reflection and transmission coefficients for supersymmetric shape-invariant potentials barriers are calculated by an analytical continuation of the asymptotic wave functions obtained via the introduction of new generalized ladder…
We study nearest-neighbors walks on the two-dimensional square lattice, that is, models of walks on $\mathbb{Z}^2$ defined by a fixed step set that is a subset of the non-zero vectors with coordinates 0, 1 or $-1$. We concern ourselves with…
Using a simple transfer matrix approach we have derived very long series expansions for the perimeter generating function of punctured staircase polygons (staircase polygons with a single internal staircase hole). We find that all the terms…
We consider a random walk model in a one-dimensional environment, formed by several zones of finite width with the fixed transition probabilities. It is also assumed that the transitions to the left and right neighboring points have unequal…
We consider in this paper subdiffusion in a system with a thin membrane. The subdiffusion parameters are the same in both parts of the system separated by the membrane. Using the random walk model with discrete time and space variables the…
The problem of implementing a class of functions with particular conditions by using monotonic multilayer functions is considered. A genetic algorithm is used to create monotonic functions of a certain class, and these are implemented with…
We consider planar lattice walks that start from a prescribed position, take their steps in a given finite subset of Z^2, and always stay in the quadrant x >= 0, y >= 0. We first give a criterion which guarantees that the length generating…
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…
Polymers in confined spaces lose conformational entropy. This induces a net repulsive entropic force on the walls of the confining space. A model for this phenomenon is a lattice walk between confining walls, and in this paper a model of an…
A plateau in a Motzkin path is a sequence of three steps: an up step, a horizontal step, then a down step. We find three different forms for the bivariate generating function for plateaus in Motzkin paths, then generalize to longer…
The exponential generating function of ordinary generating functions of diagonal sequences of general Sheffer triangles is computed by an application of Lagrange's theorem. For the special Jabotinsky type this is already known. An analogous…
The analysis of the return probability is one of the most essential and fundamental topics in the study of classical random walks. In this paper, we study the return probability of quantum and correlated random walks in the one-dimensional…
A step-reinforced random walk is a discrete-time non-Markovian process with long range memory. At each step, with a fixed probability p, the positively step-reinforced random walk repeats one of its preceding steps chosen uniformly at…