English
Related papers

Related papers: On the First and the Second Borel-Cantelli Lemmas

200 papers

We discuss two ways to construct standard probability measures, called push-down measures, from internal probability measures. We show that the Wasserstein distance between an internal probability measure and its push-down measure is…

Logic · Mathematics 2020-10-07 Haosui Duanmu , William Weiss

Given an equivalence relation ~ on a set U, there are two abstract notions of an element of the quotient set U/~. The #1 abstract notion is a set S=[u] of equivalent elements of U (an equivalence class); the #2 notion is an abstract entity…

Quantum Physics · Physics 2017-01-30 David Ellerman

The Cohen-Lenstra heuristic is a universal principle that assigns to each group a probability that tells how often this group should occur "in nature". The most important, but not the only, applications are sequences of class groups, which…

Number Theory · Mathematics 2010-05-03 Johannes Lengler

In a recent letter, new representations were proposed for the pair of sequences ($\gamma,\delta$), as defined formally by Bailey in his famous lemma. Here we extend and prove this result, providing pairs ($\gamma,\delta$) labelled by the…

q-alg · Mathematics 2008-02-03 Anne Schilling , S. Ole Warnaar

The perturbation lemma and the homotopy transfer for L-infinity algebras is proved in a elementary way by using a relative version of the ordinary perturbation lemma for chain complexes and the coalgebra perturbation lemma.

K-Theory and Homology · Mathematics 2012-09-14 Marco Manetti

We start by giving a survey to the theory of Borel*(\kappa) sets in the generalized Baire space Baire({\kappa}) = {\kappa}^{\kappa}. In particular we look at the relation of this complexity class to other complexity classes which we denote…

Logic · Mathematics 2012-09-19 Tapani Hyttinen , Vadim Kulikov

Let $X_n=\sum_{i=1}^{\infty}a_i\epsilon_{n-i}$, where the $\epsilon_i$ are i.i.d. with mean 0 and at least finite second moment, and the $a_i$ are assumed to satisfy $|a_i|=O(i^{-\beta})$ with $\beta >1/2$. When $1/2<\beta<1$, $X_n$ is…

Statistics Theory · Mathematics 2008-12-18 Tsung-Lin Cheng , Hwai-Chung Ho

This article introduces three invariance principles under which P is different from NP. In the second part a theorem of convergence is proven. This theorem states that for any language L there exists an infinite sequence of languages from…

Computational Complexity · Computer Science 2007-05-23 Mircea Alexandru Popescu Moscu

A consequence of de Finetti's representation theorem is that for every infinite sequence of exchangeable 0-1 random variables $(X_k)_{k\geq1}$, there exists a probability measure $\mu$ on the Borel sets of $[0,1]$ such that $\bar X_n =…

Probability · Mathematics 2016-01-26 Guillaume Mijoule , Giovanni Peccati , Yvik Swan

Let $X$ be a Polish space and $K$ a separable compact subset of the first Baire class on $X$. For every sequence $\bs$ dense in $\kk$, the descriptive set-theoretic properties of the set \[ \lbf=\{L\in[\nn]: (f_n)_{n\in L} \text{is…

Logic · Mathematics 2008-05-15 Pandelis Dodos

We consider the computation of the mean of sequences in the quantum model of computation. We determine the query complexity in the case of sequences which satisfy a $p$-summability condition for $1\le p<2$. This settles a problem left open…

Quantum Physics · Physics 2013-04-16 Stefan Heinrich , Erich Novak

Let {X,X_n;n\geq 1} be a sequence of i.i.d. mean-zero random variables, and let S_n=\sum_{i=1}^nX_i,n\geq 1. We establish necessary and sufficient conditions for having with probability 1, 0<lim sup_{n\to \infty}|S_n|/\sqrtnh(n)<\infty,…

Probability · Mathematics 2007-05-23 Uwe Einmahl , Deli Li

Let $p>n$ and let $L^1_p(R^n)$ be a homogeneous Sobolev space. For an arbitrary Borel measure $\mu$ on $R^n$ we give a constructive characterization of the space $L^1_p(R^n)+L_p(R^n;\mu)$. We express the norm in this space in terms of…

Functional Analysis · Mathematics 2012-10-03 Pavel Shvartsman

We provide, among other things: (i) a Bousfield--Kan formula for colimits in $\infty$-categories (generalizing the 1-categorical formula for a colimit as a coequalizer of maps between coproducts); (ii) $\infty$-categorical generalizations…

Algebraic Topology · Mathematics 2015-10-15 Aaron Mazel-Gee

We introduce and evaluate a new class of hypothesis testing procedures for moment structures. The methods are valid under weak assumptions and includes the well-known Satorra-Bentler adjustment as a special case. The proposed procedures…

Statistics Theory · Mathematics 2016-10-10 Steffen Grønneberg , Njål Foldnes

A Bernstein-type exponential inequality for (generalized) canonical U-statistics of order 2 is obtained and the Rosenthal and Hoffmann-J{\o}rgensen inequalities for sums of independent random variables are extended to (generalized)…

Probability · Mathematics 2015-01-06 Evarist Giné , Rafał Latała , Joel Zinn

In this paper we improve Bernoulli comparison. The result works for independent Rademacher random variables $(\varepsilon_i)_{i\geq1}$ and states that we can compare $\mathbb{E}\sup_{t\in T}\sum_{i\geq1}\varphi_{i}(t)\varepsilon_i$ with…

Probability · Mathematics 2019-04-03 Witold Bednorz , Rafał Martynek

The author advocates two specific mathematical notations from his popular course and joint textbook, "Concrete Mathematics". The first of these, extending an idea of Iverson, is the notation "[P]" for the function which is 1 when the…

History and Overview · Mathematics 2008-02-03 Donald E. Knuth

Associated to each random variable $Y$ having a finite moment generating function, we introduce a different generalization of the Stirling numbers of the second kind. Some characterizations and specific examples of such generalized numbers…

Number Theory · Mathematics 2018-03-14 José A. Adell , Alberto Lekuona

The CMI Millennium "P vs NP Problem" can be resolved e.g. if one shows at least one counterexample to the conjecture "P is equal to NP". A certain class of problems being such counterexamples is formulated. This implies the rejection of the…

Computational Complexity · Computer Science 2020-05-05 Vasil Penchev