Related papers: A constraint on extensible quadrature rules
Let $ (G_n)_{n=0}^{\infty} $ be a non-degenerate linear recurrence sequence with power sum representation $ G_n = a_1(n) \alpha_1^n + \cdots + a_t(n) \alpha_t^n $. In this paper we will prove a function field analogue of the well known…
This brief pedagogical note re-proves a simple theorem on the convergence, in $L_2$ and in probability, of time averages of non-stationary time series to the mean of expectation values. The basic condition is that the sum of covariances…
Consider a family of smooth immersions $F(\cdot,t): M^n\to \mathbb{R}^{n+1}$ of closed hypersurfaces in $\mathbb{R}^{n+1}$ moving by the mean curvature flow $\frac{\partial F(p,t)}{\partial t} = -H(p,t)\cdot \nu(p,t)$, for $t\in [0,T)$. In…
We discuss a recursive family of iterative methods for the numerical approximation of roots of nonlinear functions in one variable. These methods are based on Newton-Cotes closed quadrature rules. We prove that when a quadrature rule with…
An important consideration for variable selection in interaction models is to design an appropriate penalty that respects hierarchy of the importance of the variables. A common theme is to include an interaction term only after the…
In this article we recover the distribution function (and possible density) of an arbitrary random variable that is subject to an additive measurement error. This problem is also known as deconvolution and has a long tradition in…
We give a level one result for the "symmetry integral", say $I_f(N,h)$, of essentially bounded $f:\N \to \R$; i.e., we get a kind of "square-root cancellation" \thinspace bound for the mean-square (in $N<x\le 2N$) of the "symmetry"…
In this paper we consider the fractional parts of a general sequence, for example the sequence $\alpha \sqrt{n}$ or $\alpha n^2$. We give a general method, which allows one to show that long-range correlations (correlations where the…
We determine the scaling limit for permutations conditioned to have longest decreasing subsequence of length at most $d$. These permutations are also said to avoid the pattern $(d+1)d \cdots 2 1$ and they can be written as a union of $d$…
The alternate row and column scaling algorithm applied to a positive $n\times n$ matrix $A$ converges to a doubly stochastic matrix $S(A)$, sometimes called the \emph{Sinkhorn limit} of $A$. For every positive integer $n$, a two parameter…
Let n points be placed independently in d-dimensional space according to the densities $f(x) = A_d e^{-\lambda \|x\|^{\alpha}}, \lambda > 0, x \in \Re^d, d \geq 2.$ Let $d_n$ be the longest edge length for the nearest neighbor graph on…
This paper develops the process of using Richardson Extrapolation to improve the Kernel Density Estimation method, resulting in a more accurate (lower Mean Squared Error) estimate of a probability density function for a distribution of data…
We study the following growth model on a regular d-ary tree. Points at distance n adjacent to the existing subtree are added with probabilities proportional to alpha^{-n}, where alpha<1 is a positive real parameter. The heights of these…
We investigate lower bounds for the variance in arithmetic progressions of certain multiplicative functions "close" to $1$. Specifically, we consider $\alpha_N$-fold divisor functions, when $\alpha_N$ is a sequence of positive real numbers…
We study convergence properties of sparse averages of partial sums of Fourier series of continuous functions. By sparse averages, we are considering an increasing sequences of integers $n_0 < n_1 < n_2 < ...$ and looking at…
Assume that $X$ is a connected $(q+1)$-regular undirected graph of finite order $n$. Let $A$ denote the adjacency matrix of $X$. Let $\lambda_1=q+1>\lambda_2\geq \lambda_3\geq \ldots \geq \lambda_n$ denote the eigenvalues of $A$. The…
Kernel quadrature is widely used to approximate integrals of smooth functions, with worst-case error typically decaying at the minimax rate $n^{-\alpha/d}$ for smoothness $\alpha$ in dimension $d$. Existing rate-optimal methods often depend…
We introduce a new method for performing clustering with the aim of fitting clusters with different scatters and weights. It is designed by allowing to handle a proportion $\alpha$ of contaminating data to guarantee the robustness of the…
We give improved estimates for the non-perturbative parameters appearing in the heavy quark expansion for inclusive decays. While the parameters appearing in low orders of this expansion can be extracted from data, the number of parameters…
We provide an upper bound as a random variable for the functions of estimators in high dimensions. This upper bound may help establish the rate of convergence of functions in high dimensions. The upper bound random variable may converge…