Related papers: Descent pattern avoidance
In this paper, we study parametric nonlinear regression under the Harris recurrent Markov chain framework. We first consider the nonlinear least squares estimators of the parameters in the homoskedastic case, and establish asymptotic theory…
The problem of estimating a linear functional based on observational data is canonical in both the causal inference and bandit literatures. We analyze a broad class of two-stage procedures that first estimate the treatment effect function,…
Expectile regression is a useful tool for exploring the relation between the response and the explanatory variables beyond the conditional mean. This article develops a continuous threshold expectile regression for modeling data in which…
The objects of our interest are the so-called $A$-permutations, which are permutations whose cycle length lie in a fixed set $A$. They have been extensively studied with respect to the uniform or the Ewens measure. In this paper, we extend…
We prove an asymptotic formula for the number of orientations with given out-degree (score) sequence for a graph $G$. The graph $G$ is assumed to have average degrees at least $n^{1/3 + \varepsilon}$ for some $\varepsilon > 0$, and to have…
We consider a random permutation drawn from the set of 132-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{\lambda(\sigma)/2}$ where…
The general theoretical approach to the asymptotic extraction of the signal series from the perturbed signal with the help of Singular Spectrum Analysis (briefly, SSA) was already outlined in Nekrutkin 2010, SII, v. 3, 297--319. In this…
This paper demonstrates how new principles of compressed sensing, namely asymptotic incoherence, asymptotic sparsity and multilevel sampling, can be utilised to better understand underlying phenomena in practical compressed sensing and…
We give multiple proofs of two formulas concerning the enumeration of permutations avoiding a monotone consecutive pattern with a certain value for the inverse peak number or inverse left peak number statistic. The enumeration in both cases…
We obtain exact asymptotic results for the disorder averaged persistence of a Brownian particle moving in a biased Sinai landscape. We employ a new method that maps the problem of computing the persistence to the problem of finding the…
In this paper we introduce {\em weak ascent sequences}, a class of number sequences that properly contains ascent sequences. We show how these sequences uniquely encode each of the following objects: permutations avoiding a particular…
We study the matrix completion problem when the observation pattern is deterministic and possibly non-uniform. We propose a simple and efficient debiased projection scheme for recovery from noisy observations and analyze the error under a…
We use the well-known isomorphism between operator algebras and function spaces equipped with a star product to study the asymptotic properties of certain matrix sequences in which the matrix dimension $D$ tends to infinity. Our approach is…
The problem of least squares regression of a $d$-dimensional unknown parameter is considered. A stochastic gradient descent based algorithm with weighted iterate-averaging that uses a single pass over the data is studied and its convergence…
A permutation is \it separable \rm if it can be obtained from the singleton permutation by iterating direct sums and skew sums. Equivalently, it is separable if and only it avoids the patterns 2413 and 3142. Under the uniform probability on…
This paper deals with the asymptotic statistical properties of a class of redescending M-estimators in linear models with increasing dimension. This class is wide enough to include popular high breakdown point estimators such as…
The theory of dependency graphs is a powerful toolbox to prove asymptotic normality of sums of random variables. In this article, we introduce a more general notion of weighted dependency graphs and give normality criteria in this context.…
Asymptotic equivalence theory developed in the literature so far are only for bounded loss functions. This limits the potential applications of the theory because many commonly used loss functions in statistical inference are unbounded. In…
In this paper, we find distribution of descents over $(n-3)$- and $(n-4)$-stack-sortable permutations in terms of Eulerian polynomials. Our results generalize the enumeration results by Claesson, Dukes, and Steingr\'{\i}msson on $(n-3)$-…
We prove asymptotic results for 2-dimensional random matching problems. In particular, we obtain the leading term in the asymptotic expansion of the expected quadratic transportation cost for empirical measures of two samples of independent…