中文
相关论文

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

200 篇论文

In the 1970s, William Tutte developed a clever algebraic approach, based on certain "invariants", to solve a functional equation that arises in the enumeration of properly colored triangulations. The enumeration of plane lattice walks…

组合数学 · 数学 2025-04-11 Olivier Bernardi , Mireille Bousquet-Mélou , Kilian Raschel

We prove that on any transitive graph $G$ with infinitely many ends, a self-avoiding walk of length $n$ is ballistic with extremely high probability, in the sense that there exist constants $c,t>0$ such that $\mathbb{P}_n(d_G(w_0,w_n)\geq…

组合数学 · 数学 2026-01-14 Florian Lehner , Christian Lindorfer , Christoforos Panagiotis

We consider planar lattice walks that start from (0,0), remain inthe first quadrant i, j >= 0, and are made of three types of steps: North-East, West and South. These walks are known to have remarkable enumerative and probabilistic…

组合数学 · 数学 2008-05-05 Mireille Bousquet-Mélou

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…

组合数学 · 数学 2015-11-19 Axel Bacher , Manuel Kauers , Rika Yatchak

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…

组合数学 · 数学 2026-05-13 Élie de Panafieu , Michael Wallner

We interpret walks in the first quadrant with steps {(1,1),(1,0),(-1,0), (-1,-1)} as a generalization of Dyck words with two sets of letters. Using this language, we give a formal expression for the number of walks in the steps above…

组合数学 · 数学 2011-04-20 Arvind Ayyer

We compute the average shape of trajectories of some one--dimensional stochastic processes x(t) in the (t,x) plane during an excursion, i.e. between two successive returns to a reference value, finding that it obeys a scaling form. For…

统计力学 · 物理学 2009-11-10 Francesca Colaiori , Andrea Baldassarri , Claudio Castellano

We consider singular (aka genus $0$) walks in the quarter plane and their associated generating functions $Q(x,y,t)$, which enumerate the walks starting from the origin, of fixed endpoint (encoded by the spatial variables $x$ and $y$) and…

组合数学 · 数学 2025-04-21 Alin Bostan , Lucia Di Vizio , Kilian Raschel

We consider inhomogeneous lattice walk models in a half-space and in the quarter plane. For the models in a half-space, we show by a generalization of the kernel method to linear systems of functional equations that their generating…

组合数学 · 数学 2018-11-19 Manfred Buchacher , Manuel Kauers

In this paper we explore the asymptotic enumeration of three-dimensional excursions confined to the positive octant. As shown in [29], both the exponential growth and the critical exponent admit universal formulas, respectively in terms of…

组合数学 · 数学 2019-12-25 B Bogosel , V Perrollaz , K. Raschel , A Trotignon

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…

组合数学 · 数学 2016-10-21 Alin Bostan , Frédéric Chyzak , Mark van Hoeij , Manuel Kauers , Lucien Pech

In the present paper we study the nature of the trivariate generating series of weighted walks in the quarter plane. Combining the results of this paper to previous ones, we complete the proof of the following theorem. The series satisfies…

组合数学 · 数学 2024-10-22 Thomas Dreyfus

The class of random walks in one dimension, returning to the origin, restricted by the requirement that any site visited (different from the origin) is visited an even number of times, is analyzed in the present note. We call this class the…

概率论 · 数学 2007-05-23 G. M. Cicuta , M. Contedini

We work with lattice walks in $\mathbb{Z}^{r+1}$ using step set $\{\pm 1\}^{r+1}$ that finish with $x_{r+1} = 0$. We further impose conditions of avoiding backtracking (i.e. $[v,-v]$) and avoiding consecutive steps (i.e. $[v,v]$) each…

组合数学 · 数学 2021-11-11 John Machacek

We investigate the asymptotic variance of Gaussian nodal excursions in the Euclidean space, focusing on the case where the spectral measure has incommensurable atoms. This study requires to establish fine recurrence properties in 0 for the…

概率论 · 数学 2022-09-22 Raphaël Lachièze-Rey

We continue the enumeration of plane lattice walks with small steps avoiding the negative quadrant, initiated by the first author in 2016. We solve in detail a new case, namely the king model where all eight nearest neighbour steps are…

组合数学 · 数学 2025-04-11 Mireille Bousquet-Mélou , Michael Wallner

Models of spatially homogeneous walks in the quarter plane ${\bf Z}_+^{2}$ with steps taken from a subset $\mathcal{S}$ of the set of jumps to the eight nearest neighbors are considered. The generating function $(x,y,z)\mapsto Q(x,y;z)$ of…

组合数学 · 数学 2012-11-06 Irina Kurkova , Kilian Raschel

In this paper, we are interested in the asymptotic behaviour of the sequence of processes $(W_n(s,t))_{s,t\in[0,1]}$ with \begin{equation*} W_n(s,t):=\sum_{k=1}^{\lfloor nt\rfloor}\big(1_{\{\xi_{S_k}\leq s\}}-s\big) \end{equation*} where…

概率论 · 数学 2019-12-17 Nadine Guillotin-Plantard , Francoise Pene , Martin Wendler

In many recent studies on random walks with small jumps in the quarter plane, it has been noticed that the so-called "group" of the walk governs the behavior of a number of quantities, in particular through its "order". In this paper, when…

概率论 · 数学 2014-07-03 Guy Fayolle , Kilian Raschel

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…

组合数学 · 数学 2018-11-08 Tonia Bell , Shakuan Frankson , Nikita Sachdeva , Myka Terry