Related papers: Left to right maxima in Dyck Paths
It is shown that max-preserving maps (or join-morphisms) on the positive orthant in Euclidean $n$-space endowed with the component-wise partial order give rise to a semiring. This semiring admits a closure operation for maps that generate…
In this paper, we study critical and subcritical branching $\alpha$-stable processes, $\alpha \in (0, 2)$. We obtain the exact asymptotic behaviors of the tails of the maximal positions of all subcritical branching $\alpha$-stable processes…
We show that the one-sided Dyck shift has a unique tail invariant topologically $\sigma$-finite measure (up to scaling). This invariant measure of the one sided Dyck turns out to be a shift-invariant probability. Furthermore, it is one of…
Present and planned dark matter detection experiments search for WIMP-induced nuclear recoils in poorly known background conditions. In this environment, the maximum gap statistical method provides a way of setting more sensitive cross…
Given an assignment of weights w to the edges of a graph G, a matching M in G is called strongly w-maximal if for any matching N the sum of weights of the edges in N\M is at most the sum of weights of the edges in M\N. We prove that if w…
We consider point process convergence for sequences of iid random walks. The objective is to derive asymptotic theory for the largest extremes of these random walks. We show convergence of the maximum random walk to the Gumbel or the…
In this work, we report the emergence of extreme events in a damped and driven velocity-dependent mechanical system. We observe that the extreme events emerge at multiple points. We further notice that the extreme events occur symmetrically…
In a paper by Sapounakis, Tasoulas, and Tsikouras \cite{stt}, the authors count the number of occurrences of patterns of length four in Dyck paths. In this paper we specify in one direction and generalize in another. We only count ballot…
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 the seminal contribution [4] the joint weak convergence of maxima and minima of weakly dependent stationary sequences is derived under some mild asymptotic conditions. In this paper we address additionally the case of incomplete samples…
For a measure preserving dynamical system $(\mathcal{X},f, \mu)$, we consider the time series of maxima $M_n=\max\{X_1,\ldots,X_n\}$ associated to the process $X_n=\phi(f^{n-1}(x))$ generated by the dynamical system for some observable…
Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…
We consider a random walk on $\Z$ that branches at the origin only. In the supercritical regime we establish a law of large number for the maximal position $M_n$. Then we determine all possible limiting law for the sequence $M_n -\alpha n$…
For a strictly stationary sequence of $\mathbb{R}_{+}^{d}$--valued random vectors we derive functional convergence of partial maxima stochastic processes under joint regular variation and weak dependence conditions. The limit process is an…
A directed hypergraph (dihypergraph) consists of a set of vertices and a set of hyperarcs, where each hyperarc is partitioned into a head and a tail. Directed hypergraphs are useful in many applications, including the study of chemical…
Distributions following a power-law are an ubiquitous phenomenon. Methods for determining the exponent of a power-law tail by graphical means are often used in practice but are intrinsically unreliable. Maximum likelihood estimators for the…
It is well known that the set of $m$-Dyck paths with a fixed height and a fixed amount of valleys is counted by the Fu{\ss}-Narayana numbers. In this article, we consider the set of $m$-Dyck paths that start with at least $t$ north steps.…
Gaussian random fields on Euclidean spaces whose variances reach their maximum values at unique points are considered. Exact asymptotic behaviors of probabilities of large absolute maximum of theirs trajectories have been evaluated using…
We consider the class of directed graphs with $N\geq 1$ edges and without loops shorter than $k\geq1$. Using the concept of a labelled graph, we determine graphs from this class that maximize the number of all paths of length $k$. Then we…
We discuss and compare several geometric structures which imply an upper bound to the acceleration of a particle measured in its rest system. While all of them have the same implications on the motion of a point particle, they differ in…