Related papers: Balanced weighted Motzkin paths: Pearson structure…
In this paper the totally asymmetric exclusion process (TASEP) with parallel update on an open lattice of size $L$ is considered in the maximum-current region. A formal expression for the generating function for the weight of configurations…
In this paper, I derive a generating function for discrete Motzkin paths of step size +2,+1,-1, restricted between two absorbing parallel lines, and generalized to arbitrary step weights. This continues off work of similar problems…
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…
We consider SDEs of the form $dX_t = |f(X_t)|/t^{\gamma} dt+1/t^{\gamma} dB_t$, where $f(x)$ behaves comparably to $|x|^k$ in a neighborhood of the origin, for $k\in [1,\infty)$. We show that there exists a threshold value…
We consider a generalised version of Motzkin paths, where horizontal steps have length $\ell$, with $\ell$ being a fixed positive integer. We first give the general functional equation for the area-length generating function of this model.…
We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which,…
We consider a conditioned Galton-Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given length. We give two proofs of this result, one probabilistic and…
The 1+1 dimensional corner growth model with exponential weights is a centrally important exactly solvable model in the Kardar-Parisi-Zhang class of statistical mechanical models. While significant progress has been made on the fluctuations…
The goal of this paper is to analyse the asymptotic behavior of the cycle process and the total number of cycles of weighted and generalized weighted random permutations which are relevant models in physics and which extend the Ewens…
An explicit Fredholm determinant formula is derived for the multipoint distribution of the height function of the totally asymmetric simple exclusion process (TASEP) with arbitrary right-finite initial condition. The method is by solving…
In this work, we develop the discrete solvability analysis for perturbed saddle-point problems in Banach spaces with forcing terms regularised by means of a projector constructed using the adjoint of a weighted Cl\'ement…
Using the generalized method of steepest descents for the case of two coalescing saddle points, we derive an asymptotic expression for the bivariate generating function of Dyck paths, weighted according to their length and their area in the…
We present a posteriori error analysis in the supremum norm for the symmetric interior penalty discontinuous Galerkin method for the elliptic obstacle problem. We construct discrete barrier functions based on appropriate corrections of the…
In this paper we study first-passage percolation in the configuration model with empirical degree distribution that follows a power-law with exponent $\tau \in (2,3)$. We assign independent and identically distributed (i.i.d.)\ weights to…
We construct a class of novel tamed schemes that can preserve the original Lyapunov functional for super-linear stochastic PDEs (SPDEs), including the stochastic Allen--Cahn equation, driven by multiplicative or additive noise, and provide…
New geometric and computational analyses of power-weighted shortest-path distances (PWSPDs) are presented. By illuminating the way these metrics balance density and geometry in the underlying data, we clarify their key parameters and…
We develop a unified PDE-probabilistic framework for pointwise gradient and Hessian estimates of Markov semigroups associated with stochastic differential equations with singular and unbounded coefficients. Under mild local structural…
We consider a Markovian load balancing model on a fully-connected network, where calls have Poisson arrivals and exponential durations. The endpoints of each call are uniform over all the links of the network. Each call is routed either…
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…
This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. At each step, a nondeterministic walk draws a random set of steps from a predefined set of sets and explores all possible extensions in parallel.…