English
Related papers

Related papers: Failure of uniform laws of large numbers for subdi…

200 papers

We establish general versions of a variety of results for quasiconvex, lower-semicontinuous, and law-invariant functionals. Our results extend well-known results from the literature to a large class of spaces of random variables. We…

Pricing of Securities · Quantitative Finance 2021-01-21 Fabio Bellini , Pablo Koch-Medina , Cosimo Munari , Gregor Svindland

We prove a law of large numbers in terms of complete convergence of independent random variables taking values in increments of monotone functions, with convergence uniform both in the initial and the final time. The result holds also for…

Probability · Mathematics 2016-12-30 Tetsuya Hattori

We give a simple proof of a recent result by J. Schleischitz dealing with a counterexample to the uniform Littlewood conjecture. Our construction is based on simple properties of Fibonacci numbers.

Number Theory · Mathematics 2026-05-27 Nikolay Moshchevitin

In this paper, we consider the sublinear expectation on bounded random variables. With the notion of uncorrelatedness for random variables under the sublinear expectation, a weak law of large numbers is obtained. With the notion of…

Probability · Mathematics 2023-11-17 Wenhao Li , Chuanfeng Sun

In this paper, under some weaker conditions, we give three laws of large numbers under sublinear expectations (capacities), which extend Peng's law of large numbers under sublinear expectations in [8] and Chen's strong law of large numbers…

Probability · Mathematics 2012-02-10 Feng Hu

In the article the necessary and sufficient conditions for a representation of Lipschitz function of two variables as a difference of two convex functions are formulated. An algorithm of this representation is given. The outcome of this…

Optimization and Control · Mathematics 2025-02-07 Igor Proudnikov

Duffin and Schaeffer provided a famous counterexample to show that Khintchine's theorem fails without monotonicity assumption. Given any monotonically decreasing approximation function with divergent series, we construct…

Number Theory · Mathematics 2025-04-24 Sam Chow , Manuel Hauke , Andrew Pollington , Felipe A. Ramírez

For $p\ge 1$ let $\varphi_p(x)=x^2/2$ if $|x|\le 1$ and $\varphi_p(x)=1/p|x|^p-1/p+1/2$ if $|x|>1$. For a random variable $\xi$ let $\tau_{\varphi_p}(\xi)$ denote $\inf\{a\ge 0:\;\forall_{\lambda\in\mathbb{R}}\;…

Probability · Mathematics 2021-09-22 Krzysztof Zajkowski

We provide a uniform law for the weak convergence of additive functionals of partial sum processes to the local times of linear fractional stable motions, in a setting sufficiently general for statistical applications. Our results are…

Statistics Theory · Mathematics 2016-02-02 James A. Duffy

Let the random variable $Z_{n,k}$ denote the number of increasing subsequences of length $k$ in a random permutation from $S_n$, the symmetric group of permutations of $\{1,...,n\}$. In a recent paper [Random Structures Algorithms 29 (2006)…

Probability · Mathematics 2009-09-29 Ross G. Pinsky

Let $U\subseteq\mathbb{R}^{n}$ be open and convex. We show that every (not necessarily Lipschitz or strongly) convex function $f:U\to\mathbb{R}$ can be approximated by real analytic convex functions, uniformly on all of $U$. In doing so we…

Functional Analysis · Mathematics 2012-01-17 D. Azagra

This work concerns about stochastic Burgers type equations with reflection. First of all, by means of the equicontinuous uniform Laplace principle, we prove the Freidlin-Wentzell uniform large deviation principle for these equations…

Probability · Mathematics 2025-06-19 Huijie Qiao

Schaeffer's regularity theorem for scalar conservation laws can be loosely speaking formulated as follows. Assume that the flux is uniformly convex, then for a generic smooth initial datum the admissible solution is smooth outside a locally…

Analysis of PDEs · Mathematics 2015-05-05 Laura Caravenna , Laura Spinolo

We derive two upper bounds for the probability of deviation of a vector-valued Lipschitz function of a collection of random variables from its expected value. The resulting upper bounds can be tighter than bounds obtained by a direct…

Probability · Mathematics 2021-03-02 Dimitrios Katselis , Xiaotian Xie , Carolyn L. Beck , R. Srikant

We consider the problems of \emph{learning} and \emph{testing} real-valued convex functions over Gaussian space. Despite the extensive study of function convexity across mathematics, statistics, and computer science, its learnability and…

Data Structures and Algorithms · Computer Science 2025-11-17 Renato Ferreira Pinto , Cassandra Marcussen , Elchanan Mossel , Shivam Nadimpalli

We establish generic uniform convergence guarantees for Gaussian data in terms of the Rademacher complexity of the hypothesis class and the Lipschitz constant of the square root of the scalar loss function. We show how these guarantees…

Machine Learning · Statistics 2023-06-26 Lijia Zhou , Zhen Dai , Frederic Koehler , Nathan Srebro

Let $\pi$ be a cuspidal automorphic representation of a general linear group over the rational numbers. We establish a subconvex bound for the standard $L$-function of $\pi$ in the $t$-aspect. More generally, we address the spectral aspect…

Number Theory · Mathematics 2023-01-25 Paul D. Nelson

The paper presents fundamental metrical theorems for a class of continued fraction-like expansions known as $\theta$-expansions. We first prove Khinchine's Weak Law of Large Numbers for the sum of digits, followed by the Diamond-Vaaler…

Number Theory · Mathematics 2026-01-21 Andreas Rusu , Gabriela Ileana Sebe , Dan Lascu

Subdifferentials (in the sense of convex analysis) of matrix-valued functions defined on $\mathbb{R}^d$ that are convex with respect to the L\"{o}wner partial order can have a complicated structure and might be very difficult to compute…

Optimization and Control · Mathematics 2024-07-22 M. V. Dolgopolik

For many standard models of random structure, first-order logic sentences exhibit a convergence phenomenon on random inputs. The most well-known example is for random graphs with constant edge probability, where the probabilities of…

Logic in Computer Science · Computer Science 2025-04-24 Sam Adam-Day , Michael Benedikt , Alberto Larrauri
‹ Prev 1 2 3 10 Next ›