Related papers: Geometry Of The Expected Value Set And The Set-Val…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
In many applications of machine learning, a large number of variables are considered. Motivated by machine learning of interacting particle systems, we consider the situation when the number of input variables goes to infinity. First, we…
We consider the number of edge crossings in a random graph drawing generated by projecting a random geometric graph on some compact convex set $W\subset \mathbb{R}^d$, $d\geq 3$, onto a plane. The positions of these crossings form the…
We study the problem of reconstructing a convex body using only a finite number of measurements of outer normal vectors. More precisely, we suppose that the normal vectors are measured at independent random locations uniformly distributed…
The Central Limit Theorem (CLT) is one of the most fundamental results in statistics. It states that the standardized sample mean of a sequence of $n$ mutually independent and identically distributed random variables with finite first and…
We study sufficient conditions for the belonging of random process to certain Besov space and for the Central Limit Theorem (CLT) in these spaces. We investigate also the non-asymptotic tail behavior of normed sums of centered random…
Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric…
The Gauss-Minkowski correspondence in $\mathbb{R}^2$ states the existence of a homeomorphism between the probability measures $\mu$ on $[0,2\pi]$ such that $\int_0^{2\pi} e^{ix}d\mu(x)=0$ and the compact convex sets (CCS) of the plane with…
The goal of machine learning is to find models that minimize prediction error on data that has not yet been seen. Its operational paradigm assumes access to a dataset $S$ and articulates a scheme for evaluating how well a given model…
The Chernoff bound is a well-known tool for obtaining a high probability bound on the expectation of a Bernoulli random variable in terms of its sample average. This bound is commonly used in statistical learning theory to upper bound the…
Optimization problems, generalized equations, and the multitude of other variational problems invariably lead to the analysis of sets and set-valued mappings as well as their approximations. We review the central concept of set-convergence…
We consider "randomized" statistics constructed by using a finite number of observations a random field at randomly chosen points. We generalize the invariance principle (the functional CLT), the Glivenko--Cantelli theorem, the theorem…
We study sums of locally dependent scores associated with general marked (i.e., labeled) Euclidean point processes. We introduce geometric mixing conditions on the underlying point process and a Lipschitz-"localization" condition on the…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
We consider a random tree and introduce a metric in the space of trees to define the ``mean tree'' as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and…
We consider a finite sequence of random points in a finite domain of a finite-dimensional Euclidean space. The points are sequentially allocated in the domain according to a model of cooperative sequential adsorption. The main peculiarity…
Lower and upper bounds are explored for the uniform (Kolmogorov) and $L^2$-distances between the distributions of weighted sums of dependent summands and the normal law. The results are illustrated for several classes of random variables…
There is a widespread recent interest in using ideas from statistical physics to model certain types of problems in economics and finance. The main idea is to derive the macroscopic behavior of the market from the random local interactions…
We consider eigenvalues of generalized Wishart processes as well as particle systems, of which the empirical measures converge to deterministic measures as the dimension goes to infinity. In this paper, we obtain central limit theorems to…
A finite point process is characterized by the distribution of the number of points (the size) of the process. In some applications, for example, in the context of packet flows in modern communication networks, it is of interest to infer…