Related papers: Dvoretzky covering problem for general measures
Suppose A is a finite set equipped with a probability measure P and let M be a ``mass'' function on A. We give a probabilistic characterization of the most efficient way in which A^n can be almost-covered using spheres of a fixed radius. An…
We impose the uniform probability measure on the set of all discrete Gelfand-Tsetlin patterns of depth $n$ with the particles on row $n$ in deterministic positions. These systems equivalently describe a broad class of random tilings models,…
We study the general moment problem for measures on the real line, with polynomials replaced by more general spaces of entire functions. As a particular case, we describe measures that are uniquely determined by a restriction of their…
We analyze the problem of global reconstruction of functions as accurately as possible, based on partial information in the form of a truncated power series at some point, and additional analyticity properties. This situation occurs…
The predictability problem for systems with different characteristic time scales is investigated. It is shown that even in simple chaotic dynamical systems, the leading Lyapunov exponent is not sufficient to estimate the predictability…
We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…
In the paper [P. Cannarsa, C. Mendico, Asymptotic analysis for Hamilton-Jacobi- Bellman equations on Euclidean space, (2021) Arxiv], we proved the existence of the limit as the time horizon goes to infinity of the averaged value function of…
We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure,…
We derive a central limit theorem for the probability distribution of the sum of many critically correlated random variables. The theorem characterizes a variety of different processes sharing the same asymptotic form of anomalous scaling…
The probability operator is derived from first principles for an equilibrium quantum system. It is also shown that the superposition states collapse into a mixture of states giving the conventional von Neumann trace form for the quantum…
We analyze in full mathematical rigor the most general quartically perturbed invariant probability measure for a random tensor. Using a version of the Loop Vertex Expansion (which we call the mixed expansion) we show that the cumulants…
We obtain a recurrence relation in $d$ for the average singular value $% \alpha (d)$ of a complex valued $d\times d$\ matrix $\frac{1}{\sqrt{d}}X$ with random i.i.d., N( 0,1) entries, and use it to show that $\alpha (d)$ decreases…
Nowadays we have many methods allowing to exploit the regularising properties of the linear part of a nonlinear dispersive equation (such as the KdV equation, the nonlinear wave or the nonlinear Schroedinger equations) in order to prove…
This paper establishes an abstract Korovkin-type approximation theorem in general spaces, extending the framework of approximation theory to accommodate broader contexts. A critical result supporting this theorem is the proof that any…
We prove that, if dichotomy occurs when the concentration-compactness principle is used, the dichotomizing sequence can be choosen so that a nontrivial part of it concentrates. Iterating this argument leads to a profile decomposition for…
We introduce a 'uniform tension-reduction' (UTR) model, which allows to represent the probabilities associated with an arbitrary measurement situation and use it to explain the emergence of quantum probabilities (the Born rule) as 'uniform'…
We study some new universal aspects of diffusion in chaotic systems, especially such having very large Lyapunov coefficients on the chaotic (indecomposable, topologically transitive) component. We do this by discretizing the chaotic…
This work revolves around the two following questions: Given a convex body $C\subset\mathbb{R}^d$, a positive integer $k$ and a finite set $S\subset\mathbb{R}^d$ (or a finite Borel measure $\mu$ on $\mathbb{R}^d$), how many homothets of $C$…
In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the…
We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of…