相关论文: Estimates of the Discrepancy Function in Exponenti…

We prove that the the discrepancy of arithmetic progressions in the $d$-dimensional grid $\{1, \dots, N\}^d$ is within a constant factor depending only on $d$ of $N^{\frac{d}{2d+2}}$. This extends the case $d=1$, which is a celebrated…

Motivated by the results presented in a companion paper, here we give a simple analytical expression for the matter n-point functions in the Zel'dovich approximation (ZA) both in real and in redshift space (including the angular case). We…

We give a shorter proof of a slightly weaker version of a theorem of Nets Katz and the author. We prove that if a set of $L$ lines in $\mathbb{R}^3$ contains at most $L^{1/2}$ lines in any low degree algebraic surface, then the number of…

The $L_{\infty}$ star discrepancy is a measure for the regularity of a finite set of points taken from $[0,1)^d$. Low discrepancy point sets are highly relevant for Quasi-Monte Carlo methods in numerical integration and several other…

Manski's celebrated maximum score estimator for the discrete choice model, which is an optimal linear discriminator, has been the focus of much investigation in both the econometrics and statistics literatures, but its behavior under…

We study the irregularities of distribution on two-point homogeneous spaces. Our main result is the following: let $d$ be the real dimension of a two point homogeneous space $\mathcal{M}$, let $\left( \{ a_{j}\} _{j=1}^{N},\{ x_{j}\}…

Motivated by the Koml\'os conjecture in combinatorial discrepancy, we study the discrepancy of random matrices with $m$ rows and $n$ independent columns drawn from a bounded lattice random variable. It is known that for $n$ tending to…

We propose a deep neural network architecture and a training algorithm for computing approximate Lyapunov functions of systems of nonlinear ordinary differential equations. Under the assumption that the system admits a compositional…

Let $(\varphi_i)_{i=1}^n$ be mutually orthogonal functions on a probability space such that $\|\varphi_i\|_\infty \leq 1 $ for all $i \in [n]$. Let $\alpha > 0$. Let $\Phi(u) = u^2 \log^{\alpha}(u)$ for $u \geq u_{0}$, and $\Phi(u) =…

We study occupancy counts for the critical nearest-neighbor branching random walk on the $d$-dimensional lattice, conditioned on non-extinction. For $d\geq 3$, Lalley and Zheng (2011) showed that the properly scaled joint distribution of…

Large-scale sequential data is often exposed to some degree of inhomogeneity in the form of sudden changes in the parameters of the data-generating process. We consider the problem of detecting such structural changes in a high-dimensional…

This paper shows that the logarithm of the epsilon-error capacity (average error probability) for n uses of a discrete memoryless channel is upper bounded by the normal approximation plus a third-order term that does not exceed 1/2 log n +…

Central limit theorems (CLTs) for high-dimensional random vectors with dimension possibly growing with the sample size have received a lot of attention in the recent times. Chernozhukov et al. (2017) proved a Berry--Esseen type result for…

In this work, we propose a dissipativity-based method for Lipschitz constant estimation of 1D convolutional neural networks (CNNs). In particular, we analyze the dissipativity properties of convolutional, pooling, and fully connected layers…

In this paper, we study the metrical theory of the growth rate of digits in L\"{u}roth expansions. More precisely, for $ x\in \left( 0,1 \right] $, let $ \left[ d_1\left( x \right) ,d_2\left( x \right) ,\cdots \right] $ denote the…

We study point-wise estimates for the modified Riesz potential. We show that the point-wise estimates imply embeddings into Orlicz spaces from the L^1_p-space where the functions are defined in non-smooth domains. The Orlicz functions…

Upper bounds for the $L_p$-discrepancies of point distributions in compact metric measure spaces for $0<p\le\infty$ have been established in the paper [6] by Brandolini, Chen, Colzani, Gigante and Travaglini. In the present paper we show…

In this work we investigate families of translation invariant differentiation bases $B$ of rectangles in $R^n$, for which $L\log^{n-1}L(R^n)$ is the largest Orlicz space that $B$ differentiates. In particular, we improve on techniques…

Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…

A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of…