Related papers: Descent pattern avoidance
We investigate the asymptotic risk of a general class of overparameterized likelihood models, including deep models. The recent empirical success of large-scale models has motivated several theoretical studies to investigate a scenario…
We analyze the eigenvalues of the adjacency matrices of a wide variety of random trees. Using general, broadly applicable arguments based on the interlacing inequalities for the eigenvalues of a principal submatrix of a Hermitian matrix and…
One of the main problem in prediction theory of discrete-time second-order stationary processes $X(t)$ is to describe the asymptotic behavior of the best linear mean squared prediction error in predicting $X(0)$ given $ X(t),$ $-n\le…
Considered herein are the family of nonlinear equations with both dispersive and dissipative homogeneous terms appended. Solutions of these equations that start with finite energia decay to zero as time goes to infinity. We present an…
We present some results on the proportion of permutations of length $n$ containing certain mesh patterns as $n$ grows large, and give exact enumeration results in some cases. In particular, we focus on mesh patterns where entire rows and…
We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…
We develop a new, powerful method for counting elements in a multiset. As a first application, we use this algorithm to study the number of occurrences of patterns in a permutation. For patterns of length 3 there are two Wilf classes, and…
We study an unbiased, discrete time random walk on the nonnegative integers, with the origin absorbing. The process has a history-dependent step length: the walker takes steps of length v while in a region which has been visited before, and…
Recently, Tibshirani et al. (2016) proposed a method for making inferences about parameters defined by model selection, in a typical regression setting with normally distributed errors. Here, we study the large sample properties of this…
We introduce a permutation analogue of the celebrated Szemeredi Regularity Lemma, and derive a number of consequences. This tool allows us to provide a structural description of permutations which avoid a specified pattern, a result that…
Asymptotic expansion of a variation with anticipative weights is derived by the theory of asymptotic expansion for Skorohod integrals having a mixed normal limit. The expansion formula is expressed with the quasi-torsion, quasi-tangent and…
We propose two types of universal codes that are suited to two asymptotic regimes when the output alphabet is possibly continuous. The first class has the property that the error probability decays exponentially fast and we identify an…
We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West's notion of shape-Wilf…
We introduce a new boundedness condition for affine permutations, motivated by the fruitful concept of periodic boundary conditions in statistical physics. We study pattern avoidance in bounded affine permutations. In particular, we show…
By considering the nonuniform exponential dichotomy spectrum, we introduce a global asymptotic nonuniform stability conjecture for nonautonomous differential systems, whose restriction to the autonomous case is related to the classical…
We consider Ewens random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$ and to study the asymptotic behaviour as $n\to\infty$. We obtain very precise information on the joint distribution of…
The number of inversion sequences avoiding two patterns $101$ and $102$ is known to be the same as the number of permutations avoiding three patterns $2341$, $2431$, and $3241$. This sequence also counts the number of Schr\"{o}der paths…
We consider deconvolution from repeated observations with unknown error distribution. So far, this model has mostly been studied under the additional assumption that the errors are symmetric. We construct an estimator for the non-symmetric…
A standard approach to computing expectations with respect to a given target measure is to introduce an overdamped Langevin equation which is reversible with respect to the target distribution, and to approximate the expectation by a…
Motivated by a correlation between the distribution of descents over permutations that avoid a consecutive pattern and those avoiding the respective quasi-consecutive pattern, as established in this paper, we obtain a complete $\des$-Wilf…