Related papers: A constraint on extensible quadrature rules

We study the rate of growth of ergodic sums along a sequence (a_n) of times: S_N f(x)=f(T^{a_1}x) + ... + f(T^{a_N}x). We characterize the maximal rate of growth of these ergodic sums and identify a number of sequences such as (2^n) that…

Let $\alpha$ be a Steinhaus or a Rademacher random multiplicative function. For a wide class of multiplicative functions $f$ we show that the sum $\sum_{n \le x}\alpha(n) f(n)$, normalised to have mean square $1$, has a non-Gaussian…

A class of numerical quadrature rules is derived, with equally-spaced nodes, and unit weights except at a few points at each end of the series, for which "corrections" (not using any further information about the integrand) are added to the…

We investigate when the exponential sum $S_f(x,\alpha) := \sum_{n\le x}f(n)\mathrm{e}(n\alpha)$ is bounded, for a multiplicative function $f$ and $\alpha\in\mathbb{R}$. We show that under natural assumptions, $S_f(x,\alpha)$ is bounded only…

We prove that smooth convex $\alpha$-noncollapsed ancient mean curvature flow satisfies a quantitative curvature estimate $H(y,t)\leq CH(x,t)(H(x,t)|x-y|+1)^2$ for any pair of $x,y$. In other words, the rescaled curvature grows at most…

Let $f\in \ell^2(\mathbb Z)$. Define the average of $ f$ over the square integers by $ A_N f(x):=\frac{1}{N}\sum_{k=1}^N f(x+k^2) $. We show that $ A_N$ satisfies a local scale-free $ \ell ^{p}$-improving estimate, for $ 3/2 < p \leq 2$:…

A sequence $(s_n)$ of integers is good for the mean ergodic theorem if for each invertible measure preserving system $(X,\mathcal{B},\mu,T)$ and any bounded measurable function $f$, the averages $ \frac1N \sum_{n=1}^N f(T^{s_n}x)$ converge…

We study the typical growth rate of the number of words of length n which can be extended to beta-expansions of x. In the general case we give a lower bound for the growth rate, while in the case that the Bernoulli convolution associated to…

An algorithm is proposed, analyzed, and tested for solving continuous nonlinear-equality-constrained optimization problems where the objective and constraint functions are defined by expectations or averages over large, finite numbers of…

We consider the generalization ability of algorithms for learning to rank at a query level, a problem also called subset ranking. Existing generalization error bounds necessarily degrade as the size of the document list associated with a…

Multi-layer feedforward networks have been used to approximate a wide range of nonlinear functions. An important and fundamental problem is to understand the learnability of a network model through its statistical risk, or the expected…

This paper concerns the evolution of a closed convex hypersurface in ${\mathbb{R}}^{n+1}$, in direction of its inner unit normal vector, where the speed is given by a smooth function depending only on the mean curvature, and satisfies some…

Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…

We consider a growing network, whose growth algorithm is based on the preferential attachment typical for scale-free constructions, but where the long-range bonds are disadvantaged. Thus, the probability to get connected to a site at…

A symmetrized lattice of $2n$ points in terms of an irrational real number $\alpha$ is considered in the unit square, as in the theorem of Davenport. If $\alpha$ is a quadratic irrational, the square of the $L^2$ discrepancy is found to be…

It is known that for a $\rho$-weighted $L_q$-approximation of single variable functions $f$ with the $r$th derivatives in a $\psi$-weighted $L_p$ space, the minimal error of approximations that use $n$ samples of $f$ is proportional to…

We show that repulsive random variables can yield Monte Carlo methods with faster convergence rates than the typical $N^{-1/2}$, where $N$ is the number of integrand evaluations. More precisely, we propose stochastic numerical quadratures…

In this paper, we consider approximating expansions for the distribution of integer valued random variables, in circumstances in which convergence in law cannot be expected. The setting is one in which the simplest approximation to the…

We investigate the probability of observing a given pattern of $n$ rises and falls in a random stationary data series. The data are modelled as a sequence of $n+1$ independent and identically distributed random numbers. This probabilistic…

We show that a real bounded sequence $(x_n)$ is Ces\`aro convergent to $\ell$ if and only if the sequence of averages with indices in $[\alpha^k,\alpha^{k+1})$ converges to $\ell$ for all $\alpha>1$. If, in addition, the sequence $(x_n)$ is…