相关论文: Partially directed paths in a wedge

We analyze a class of linear partial differential equations that arise as deterministic descriptions of the scaling limits of L\'evy walks, in which transport is driven by a convex combination of fractional material derivatives and a source…

The moving mesh PDE (MMPDE) method for variational mesh generation and adaptation is studied theoretically at the discrete level, in particular the nonsingularity of the obtained meshes. Meshing functionals are discretized geometrically and…

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…

Returning walks on a lattice are sequences of moves that start at a given lattice site and return to the same site after $n$ steps. Determining the total number of returning walks of a given length $n$ is a typical graph-theoretical problem…

Random walks are a series of up, down, and level steps that enumerate distinct paths from $(0,0)$ to $(2n,0)$, where $n$ is the semi-length of the path. We used these paths to analyze Catalan, Schr\"{o}der, and Motzkin number sequences…

We continue the investigations of lattice walks in the three dimensional lattice restricted to the positive octant. We separate models which clearly have a D-finite generating function from models for which there is no reason to expect that…

Many recent papers deal with the enumeration of 2-dimensional walks with prescribed steps confined to the positive quadrant. The classification is now complete for walks with steps in $\{0, \pm 1\}^2$: the generating function is D-finite if…

Consider a single walker on the slit plane, that is, the square grid Z^2 without its negative x-axis, who starts at the origin and takes his steps from a given set S. Mireille Bousquet-Melou conjectured that -- excluding pathological cases…

We consider a transient Brownian motion reflected obliquely in a two-dimensional wedge. A precise asymptotic expansion of Green's functions is found in all directions. To this end, we first determine a kernel functional equation connecting…

We consider a variation of Dyck paths, where additionally to steps $(1,1)$ and $(1,-1)$ down-steps $(1,-j)$, for $j\ge2$ are allowed. We give credits to Emeric Deutsch for that. The enumeration of such objects living in a strip is…

This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. The main difference to classical walks is that its nondeterministic steps consist of sets of steps from a predefined set such that all possible…

The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…

In the past fifteen years, the enumeration of lattice walks with steps takenin a prescribed set S and confined to a given cone, especially the firstquadrant of the plane, has been intensely studied. As a result, the generating functions…

We analyze some enumerative and asymptotic properties of Dyck paths under a line of slope 2/5.This answers to Knuth's problem \\#4 from his "Flajolet lecture" during the conference "Analysis of Algorithms" (AofA'2014) in Paris in June…

Let F(m; n1, n2) denote the number of lattice walks from (0,0) to (n1,n2), always staying in the first quadrant {(n_1,n_2); n1 >= 0, n2 >= 0} and having exactly m steps, each of which belongs to the set {E=(1,0), W=(-1,0), NE=(1,1),…

We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…

We show that the series of all walks between any two vertices of any (possibly weighted) directed graph $\mathcal{G}$ is given by a universal continued fraction of finite depth and breadth involving the simple paths and simple cycles of…

There was recent interest in Motzkin paths without peaks (peak: up-step followed immediately by down-step); additional results about this interesting family is worked out. The new results are the enumeration of such paths that live in a…

We study planar walks that start from a given point (i\_0, j\_0), take their steps in a finite set S, and are confined in the first quadrant of the plane. Their enumeration can be attacked in a systematic way: the generating function Q(x,…

Skew Dyck are a variation of Dyck paths, where additionally to steps $(1,1)$ and $(1,-1)$ a south-west step $(-1,-1)$ is also allowed, provided that the path does not intersect itself. Replacing the south-west step by a red south-east step,…