相关论文: Partially directed paths in a wedge
We consider three directed walkers on the square lattice, which move simultaneously at each tick of a clock and never cross. Their trajectories form a non-crossing configuration of walks. This configuration is said to be osculating if the…
Given a random walk $(S_n)$ with typical step distributed according to some fixed law and a fixed parameter $p \in (0,1)$, the associated positively step-reinforced random walk is a discrete-time process which performs at each step, with…
In this paper, we are concerned with stochastic Volterra equations with singular kernels and H\"older continuous coefficients. We first establish the well-posedness of these equations by utilising the Yamada-Watanabe approach. Then, we aim…
Let $W$ be a finite Weyl group and ${\hat{W}}$ be the corresponding affine Weyl group. We show that a large element in ${\hat{W}}$, randomly generated by (reduced) multiplication by simple generators, almost surely has one of $|W|$-specific…
We derive the length and area generating function of planar height-restricted forward-moving discrete paths of increments +1, 0, or -1 with arbitrary starting and ending points, the so-called Motzkin meanders, and the more general…
In a recent preprint, Lai worked out the quotient of generating functions of weighted lozenge tilings of two "half hexagons with lateral dents" which differ only in width. Lai achieved this by using "graphical condensation" (i.e.,…
We consider a time-continuous branching random walk on a one-dimensional lattice on which there is one center (lattice point) of particle generation, called branching source. The generation of particles in the branching source is described…
One can define a random walk on a hypercubic lattice in a space of integer dimension $D$. For such a process formulas can be derived that express the probability of certain events, such as the chance of returning to the origin after a given…
This work considers lattice walks restricted to the quarter plane, with steps taken from a set of cardinality three. We present a complete classification of the generating functions of these walks with respect to the classes algebraic,…
We examine the conjectured asymptotic shape of the three dimensional corner growth model [Olejarz et. al.,PRL, 108, 016102 (2012)] by mapping the model onto a restricted solid on solid model on a triangular lattice. By choosing appropriate…
Gessel and Zeilberger generalized the reflection principle to handle walks confined to Weyl chambers, under some restrictions on the allowable steps. For those models that are invariant under the Weyl group action, they express the counting…
A formalism of arithmetic partial differential equations (PDEs) is being developed in which one considers several arithmetic differentiations at one fixed prime. In this theory solutions can be defined in algebraically closed p-adic fields.…
We investigate solutions to the functional equation $f(f(x)) = e^x$, which can be interpreted as the problem of finding a half iterate of the exponential map. While no elementary solution exists, we construct and analyze non-elementary…
The object of the present investigation is an ensemble of self-avoiding and directed graphs belonging to eight-branching Cayley tree (Bethe lattice) generated by the Fucsian group of a Riemann surface of genus two and embedded in the…
In this work, we establish a general relationship between the enumeration of weighted directed paths and skew Schur functions, extending work by Bousquet-M\'elou, who expressed generating functions of discrete excursions in terms of…
We consider random walks on quasi one dimensional lattices, as introduced in \cite{FS}. This mathematical setting covers a large class of discrete kinetic models for non-cooperative molecular motors on periodic tracks. We derive general…
The goal of this paper is to study the family of snake polyominoes. More precisely, we focus our attention on the class of partially directed snakes. We establish functional equations and length generating functions of two dimensional,…
In this work, we present a simple and efficient generator of polymeric linear chains, based on a random self-avoiding walk process. The chains are generated using a discrete process of growth, in cubic networks and in a finite time, without…
We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…
The relative importance of the intrinsic and extrinsic factors determining the variety of geometric shapes exhibited by dendritic trees remains unclear. This question was addressed by developing a model of the growth of dendritic trees…