English
Related papers

Related papers: On the upper bound in Varadhan's Lemma

200 papers

Motivated by Varadhan's theorem, we introduce Varadhan functions, variances, and means on compact Riemannian manifolds as smooth approximations to their Fr\'echet counterparts. Given independent and identically distributed samples, we prove…

Probability · Mathematics 2026-01-07 Yueqi Cao

Fatou's lemma states under appropriate conditions that the integral of the lower limit of a sequence of functions is not greater than the lower limit of the integrals. This note describes similar inequalities when, instead of a single…

Probability · Mathematics 2013-11-25 Eugene A. Feinberg , Pavlo O. Kasyanov , Nina V. Zadoianchuk

Fatou's lemma is a classic fact in real analysis that states that the limit inferior of integrals of functions is greater than or equal to the integral of the inferior limit. This paper introduces a stronger inequality that holds uniformly…

Functional Analysis · Mathematics 2015-04-09 Eugene A. Feinberg , Pavlo O. Kasyanov , Michael Z. Zgurovsky

A non-classical formulation of the central limit theorem is given for sequences of independent random variables with finite second moments. Singular sequences whose members all have a degenerate or normal distribution are excluded from…

Probability · Mathematics 2025-01-29 Alexander Shmyrov , Vasily Shmyrov

Given a bounded class of functions G and independent random variables X1, . . . , Xn, we provide an upper bound for the expectation of the supremum of the empirical process over elements of G having a small variance. Our bound applies in…

Probability · Mathematics 2015-09-08 Yannick Baraud

The classic Fatou lemma states that the lower limit of a sequence of integrals of functions is greater or equal than the integral of the lower limit. It is known that Fatou's lemma for a sequence of weakly converging measures states a…

Probability · Mathematics 2019-06-19 Eugene A. Feinberg , Pavlo O. Kasyanov , Yan Liang

We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…

Logic in Computer Science · Computer Science 2008-10-22 Alberto Momigliano , Frank Pfenning

We give a proof of Varadhan estimates for a degenerated jump process with independent increments with more and more jumps which become smaller and smaller. The proof uses the Malliavin Calculus of Bismut type for jump process in semi-group…

Probability · Mathematics 2010-07-06 Rémi Léandre

Verifying lower-semicontinuity of integral functionals in the weak topology of Sobolev spaces is a central theme in the calculus of variations. For integral functionals with $p$-growth, quasiconvexity is a necessary condition for weak…

Analysis of PDEs · Mathematics 2025-01-06 Cy Maor

This paper challenges the prevailing practice of accepting standardized factor loadings as low as .50 in confirmatory factor analysis. Drawing on the logic of Average Variance Extracted (AVE) and communality, the author argues for a…

Methodology · Statistics 2026-05-13 M. Murat Yaslioglu , Duygu Toplu Yaslioglu

A highly strong upper estimate in the modified asymptotic formula for sums of the primes' reciprocals is proved to be necessary (as well as sufficient) in order the Ramanujan inequality holds true. Some other criteria in similar terms are…

Number Theory · Mathematics 2022-01-11 Gennadiy Kalyabin

This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base…

Logic in Computer Science · Computer Science 2022-02-18 Lawrence S. Moss , Thomas F. Icard

We find an explicit upper bound for general $L$-functions on the critical line, assuming the Generalized Riemann Hypothesis, and give as illustrative examples its application to some families of $L$-functions and Dedekind zeta functions.…

Number Theory · Mathematics 2009-06-24 Vorrapan Chandee

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

Logic · Mathematics 2015-08-20 M. Malliaris , S. Shelah

We show weak lower semi-continuity of functionals assuming the new notion of a "convexly constrained" $\mathcal A$-quasiconvex integrand. We assume $\mathcal A$-quasiconvexity only for functions defined on a set $K$ which is convex.…

Analysis of PDEs · Mathematics 2021-02-01 Jack W. D. Skipper , Emil Wiedemann

In this article we establish two fundamental results for the sublevel set persistent homology for stationary processes indexed by the positive integers. The first is a strong law of large numbers for the persistence diagram (treated as a…

Probability · Mathematics 2025-08-22 Andrew M. Thomas

We prove an extension of Yuan's Lemma to more than two matrices, as long as the set of matrices has rank at most 2. This is used to generalize the main result of [A. Baccari and A. Trad. On the classical necessary second-order optimality…

Optimization and Control · Mathematics 2017-07-20 Gabriel Haeser

We are interested in the upper bound of the lifespan of solutions of semilinear wave equations from above. For the sub-critical case in high dimensions, it has been believed that the basic tools of its analysis are Kato's lemma on ordinary…

Analysis of PDEs · Mathematics 2018-03-01 Hiroyuki Takamura

We derive an upper bound for the mean of the supremum of the empirical process indexed by a class of functions that are known to have variance bounded by a small constant $\delta$. The bound is expressed in the uniform entropy integral of…

Statistics Theory · Mathematics 2010-12-30 Aad van der Vaart , Jon A. Wellner

We give a proof of Szemeredi's regularity lemma in the special case of a graph with bounded VC dimension and show that it is possible to obtain "merely" doubly exponential bounds on the size of the partition in this case.

Combinatorics · Mathematics 2013-04-24 Henry Towsner
‹ Prev 1 2 3 10 Next ›