中文
相关论文

相关论文: Non-D-finite excursions in the quarter plane

200 篇论文

We study, in d-dimensions, the random walker with geometrically shrinking step sizes at each hop. We emphasize the integrated quantities such as expectation values, cumulants and moments rather than a direct study of the probability…

统计力学 · 物理学 2009-11-11 Tonguc Rador

We consider Gessel walks in the plane starting at the origin $(0, 0)$ remaining in the first quadrant $i, j \geq 0$ and made of West, North-East, East and South-West steps. Let $F(m; n_1, n_2)$ denote the number of these walks with exact…

组合数学 · 数学 2009-03-03 Sun Ping

We consider a certain sequence of random walks. The state space of the n-th random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to…

概率论 · 数学 2010-11-16 Leonid Petrov

An ordinary plane of a finite set of points in real 3-space with no three collinear is a plane intersecting the set in exactly three points. We prove a structure theorem for sets of points spanning few ordinary planes. Our proof relies on…

组合数学 · 数学 2020-02-25 Aaron Lin , Konrad Swanepoel

This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks in the quarter plane are characterized by the fact that the one-step transition probabilities…

网络与互联网体系结构 · 计算机科学 2019-07-11 Ioannis Dimitriou

Ternary paths consist of an up-step of one unit, a down-step of two units, never go below the $x$-axis, and return to the $x$-axis. This paper addresses the enumeration of partial ternary paths, ending at a given level $i$, reading the path…

组合数学 · 数学 2020-09-30 Helmut Prodinger

We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n has the order of square root of n. Moment or symmetry assumptions are not necessary. In removing…

概率论 · 数学 2007-05-23 Rainer Siegmund-Schultze , Heinrich von Weizsaecker

The random walk to be considered takes place in the d- spherical dual of the group U(n + 1), for a fixed finite dimensional irreducible representation d of U(n). The transition matrix comes from the three term recursion relation satisfied…

表示论 · 数学 2010-10-06 F. A. Grünbaum I. Pacharoni , J. Tirao

In this article we consider transient random walks on HNN extensions of finitely generated groups. We prove that the rate of escape w.r.t. some generalised word length exists. Moreover, a central limit theorem with respect to the…

概率论 · 数学 2021-01-01 Lorenz A. Gilch

The exponential functional of simple, symmetric random walks with negative drift is an infinite polynomial $Y = 1 + \xi_1 + \xi_1 \xi_2 + \xi_1 \xi_2 \xi_3 + ...$ of independent and identically distributed non-negative random variables. It…

组合数学 · 数学 2010-08-10 Tamas Szabados , Balazs Szekely

A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that have been counted so far in that they can wind around their…

组合数学 · 数学 2025-09-26 Mireille Bousquet-Mélou

We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…

概率论 · 数学 2025-07-08 Viet Hung Hoang , Kilian Raschel

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…

概率论 · 数学 2015-08-18 Andrea Collevecchio , Kais Hamza , Meng Shi

For a homogeneous random walk in the quarter plane with nearest-neighbor transitions, starting from some state $(i_0,j_0)$, we study the event that the walk reaches the vertical axis, before reaching the horizontal axis. We derive an exact…

概率论 · 数学 2013-06-18 Johan S. H. van Leeuwaarden , Kilian Raschel

Prudent walks are self-avoiding walks on the square lattice which never step into the direction of an already occupied vertex. We study the closed version of these walks, called prudent polygons, where the last vertex is adjacent to the…

组合数学 · 数学 2010-01-26 Uwe Schwerdtfeger

We extend results of Y. Benoist and J.-F. Quint concerning random walks on homogeneous spaces of simple Lie groups to the case where the measure defining the random walk generates a semigroup which is not necessarily Zariski dense, but…

动力系统 · 数学 2016-11-21 David Simmons , Barak Weiss

In this paper, we consider fixed edgelength $n$-step random walks in $\mathbb{R}^d$. We give an explicit construction for the closest closed equilateral random walk to almost any open equilateral random walk based on the geometric median,…

统计力学 · 物理学 2019-10-28 Jason Cantarella , Kyle Chapman , Philipp Reiter , Clayton Shonkwiler

We survey distributional properties of $\mathbb{R}^d$-valued cocycles of finite measure preserving ergodic transformations (or, equivalently, of stationary random walks in $\mathbb{R}^d$) which determine recurrence or transience.

动力系统 · 数学 2007-05-23 Klaus Schmidt

We consider discrete (time and space) random walks confined to the quarter plane, with jumps only in directions $(i,j)$ with $i+j \geq 0$ and small negative jumps, i.e., $i,j \geq -1$. These walks are called singular, and were recently…

概率论 · 数学 2022-08-02 Viet Hung Hoang , Kilian Raschel , Pierre Tarrago

Consider the following computational problem: given a regular digraph $G=(V,E)$, two vertices $u,v \in V$, and a walk length $t\in \mathbb{N}$, estimate the probability that a random walk of length $t$ from $u$ ends at $v$ to within $\pm…

计算复杂性 · 计算机科学 2021-11-04 Edward Pyne , Salil Vadhan