中文
相关论文

相关论文: Fluctuations of random Motzkin paths II

200 篇论文

We consider Motzkin paths of length $L$, not fixed at zero at both end points, with constant weights on the edges and general weights on the end points. We investigate, as the length $L$ tends to infinity, the limit behaviors of (a)…

概率论 · 数学 2023-09-12 Wlodzimierz Bryc , Yizao Wang

It is known that after scaling a random Motzkin path converges to a Brownian excursion. We prove that the fluctuations of the counting processes of the ascent steps, the descent steps and the level steps converge jointly to linear…

概率论 · 数学 2019-12-30 Włodzimierz Bryc , Yizao Wang

We study Motzkin paths of length $L$ with general weights on the edges and end points. We investigate the limit behavior of the initial and final segments of the random Motzkin path viewed as a pair of processes starting from each of the…

概率论 · 数学 2025-03-12 Wlodzimierz Bryc , Alexey Kuznetsov , Jacek Wesolowski

The amplitude of Motzkin paths was recently introduced, which is basically twice the height. We analyze this parameter using generating functions.

组合数学 · 数学 2021-04-22 Helmut Prodinger

We show that the length of a path in $ \mathbf{R}^2 $ can be computed if and only if its variation in every direction can.

经典分析与常微分方程 · 数学 2018-06-22 Matthew Hendtlass

We consider transient nearest-neighbor random walks in random environment on Z. For a set of environments whose probability is converging to 1 as time goes to infinity, we describe the fluctuations of the hitting time of a level n, around…

We say that a permutation $\pi$ is a Motzkin permutation if it avoids 132 and there do not exist $a<b$ such that $\pi_a<\pi_b<\pi_{b+1}$. We study the distribution of several statistics in Motzkin permutations, including the length of the…

组合数学 · 数学 2007-05-23 Sergi Elizalde , Toufik Mansour

In this paper, we study (1,2) and (2,1) random walks in varying environments on the lattice of positive half line. We assume that the transition probabilities at site $n$ are asymptotically constants as $n\rightarrow\infty.$ For (1,2)…

概率论 · 数学 2022-06-22 Hua-Ming Wang , Lanlan Tang

We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.

组合数学 · 数学 2007-05-23 Robert Parviainen

Various notions of fluctuations exist depending on the way one chooses to measure them. We discuss two extreme cases (continuous measurement versus long inter-measurement times) and we see their relation with entropy production and with…

统计力学 · 物理学 2009-11-05 C. Maes , K. Netocny

We give several bijections among restricted Motzkin paths, explaining why various parameters on these paths are equidistributed. For example, the number of doublerise-free Motzkin paths of length n is the same as the number of peak-free…

组合数学 · 数学 2007-05-23 David Callan

We introduce a framework to identify Fluctuation Relations for vector-valued observables in physical systems evolving through a stochastic dynamics. These relations arise from the particular structure of a suitable entropic functional and…

统计力学 · 物理学 2025-10-22 Raphael Chetrite , Stefano Marcantoni

We propose a simple, geometrically-motivated construction of smooth random paths in the plane. The construction is such that, with probability one, the paths have finite curvature everywhere (and the realizations are visually pleasing when…

概率论 · 数学 2018-11-06 Clément Berenfeld , Ery Arias-Castro

A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.

组合数学 · 数学 2021-12-22 Vsevolod Chernyshev , Anton Tolchennikov

We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set $\mathbb N^{[k]}$, the set of all increasing $k$-tuples in $\mathbb N$. These graphs…

概率论 · 数学 2016-10-05 Pietro Majer , Matteo Novaga

Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind,…

组合数学 · 数学 2016-11-16 Benjamin Hackl , Clemens Heuberger , Helmut Prodinger , Stephan Wagner

Let $R$ be a finite ring. The commuting probability of $R$ is the probability that any two randomly chosen elements of $R$ commute. In this paper, we obtain some bounds for commuting probability of $R$.

环与代数 · 数学 2017-02-08 Jutirekha Dutta , Dhiren Kumar Basnet

We consider a class of graph-valued stochastic processes in which each vertex has a type that fluctuates randomly over time. Collectively, the paths of the vertex types up to a given time determine the probabilities that the edges are…

概率论 · 数学 2022-09-07 Peter Braunsteins , Frank den Hollander , Michel Mandjes

In this paper, we study the fluctuations of sums of random variables with distribution defined as a mixture of light-tail and truncated heavy-tail distributions. We focus on the case when both the mixing coefficient and the truncation level…

概率论 · 数学 2017-03-31 Vladimir Panov

Consider a transient near-critical (1,2) random walk on the positive half line. We give a criteria for the finiteness of the number of the skipped points (the points never visited) by the random walk. This result generalizes (partially) the…

概率论 · 数学 2017-07-21 Hua-Ming Wang
‹ 上一页 1 2 3 10 下一页 ›