Related papers: Approximation by uniformly distributed sequences
Teramoto et al. defined a new measure called the gap ratio that measures the uniformity of a finite point set sampled from $\cal S$, a bounded subset of $\mathbb{R}^2$. We generalize this definition of measure over all metric spaces by…
We introduce the notion of uniform exactness, or uniform amenability at infinity, for discrete groups and prove it for a wide class of groups containing free groups and their limit groups. This shows a novel strong convergence phenomenon…
In this dissertation, we show that the Central Limit Theorem and the Invariance Principle for Discrete Fourier Transforms discovered by Peligrad and Wu can be extended to the quenched setting. We show that the random normalization…
The aim of the present article is to introduce a concept which allows to generalise the notion of Poissonian pair correlation, a second-order equidistribution property, to higher dimensions. Roughly speaking, in the one-dimensional setting,…
Let \Gamma be a geometrically finite tree lattice. We prove a Khintchine-Sullivan type theorem for the Hausdorff measure of the points at infinity of the tree that are well approximated by the parabolic fixed points of G. Using Bruhat-Tits…
We extend a theorem of Maa, Pearl, and Bartoszynski, which links equality of interpoint distance distributions to equality of underlying multivariate distributions, beyond the restrictive class of homogeneous, translation-invariant distance…
In this paper we consider permutations of sequences of partitions, obtaining a result which parallels von Neumann's theorem on permutations of dense sequences and uniformly distributed sequences of points.
We consider a stationary Poisson hyperplane process with given directional distribution and intensity in $d$-dimensional Euclidean space. Generalizing the zero cell of such a process, we fix a convex body $K$ and consider the intersection…
Let $K\subset\mathbb R^d$ be a compact subset equipped with a $\delta$-Ahlfors regular measure $\mu$. For any $\tau>1/d$ and any ``inhomogeneous'' vector $\boldsymbol{\theta}\in\mathbb R^d$, let $W_d(\psi_\tau,\boldsymbol{\theta})$ denote…
The proof by Ullmo and Zhang of Bogomolov's conjecture about points of small height in abelian varieties made a crucial use of an equidistribution property for ``small points'' in the associated complex abelian variety. We study the…
A new finite form of de Finetti's representation theorem is established using elementary information-theoretic tools. The distribution of the first $k$ random variables in an exchangeable vector of $n\geq k$ random variables is close to a…
This paper develops the metric theory of simultaneous inhomogeneous Diophantine approximation on a planar curve with respect to multiple approximating functions. Our results naturally generalize the homogeneous Lebesgue measure and Hausdor?…
We present a procedure for averaging one-parameter random unitary groups and random self-adjoint groups. Central to this is a generalization of the notion of weak convergence of a sequence of measures and the corresponding generalization of…
Let $\cal C$ be a non--degenerate planar curve and for a real, positive decreasing function $\psi$ let $\cal C(\psi)$ denote the set of simultaneously $\psi$--approximable points lying on $\cal C$. We show that $\cal C$ is of Khintchine…
A distributional symmetry is invariance of a distribution under a group of transformations. Exchangeability and stationarity are examples. We explain that a result of ergodic theory provides a law of large numbers: If the group satisfies…
Let (X_n,Y_n) be i.i.d. random vectors. Let W(x) be the partial sum of Y_n just before that of X_n exceeds x>0. Motivated by stochastic models for neural activity, uniform convergence of the form $\sup_{c\in I}|a(c,x)\operatorname…
This paper deals with a modifed iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under…
In this work we reproduce the characterization of $\Gg^s$-sets from the euclidean setting [J. London Math. Soc. 49:267-280,1994] to more general metric spaces. These sets have Hausdorff dimension at least $s$ and are closed by countable…
This paper studies the universal approximation property of deep neural networks for representing probability distributions. Given a target distribution $\pi$ and a source distribution $p_z$ both defined on $\mathbb{R}^d$, we prove under…
We propose a method to derive the stationary size distributions of a system, and the degree distributions of networks, using maximisation of the Gibbs-Shannon entropy. We apply this to a preferential attachment-type algorithm for systems of…