English
Related papers

Related papers: A Conditional Extension of the Park-Pham Theorem

200 papers

In this paper, we develop necessary and sufficient conditions for the validity of a martingale approximation for the partial sums of a stationary process in terms of the maximum of consecutive errors. Such an approximation is useful for…

Probability · Mathematics 2011-02-11 Mikhail Gordin , Magda Peligrad

Let $B(n,p)$ denote a binomial random variable with parameters $n$ and $p$. Chv\'{a}tal's theorem says that for any fixed $n\geq 2$, as $m$ ranges over $\{0,\ldots,n\}$, the probability $q_m:=P(B(n,m/n)\leq m)$ is the smallest when $m$ is…

Probability · Mathematics 2024-01-15 Ze-Chun Hu , Peng Lu , Qian-Qian Zhou , Xing-Wang Zhou

The classical Artin--Whaples approximation theorem allows to simultaneously approximate finitely many different elements of a field with respect to finitely many pairwise inequivalent absolute values. Several variants and generalizations…

Commutative Algebra · Mathematics 2021-02-16 Sylvy Anscombe , Philip Dittmann , Arno Fehm

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

Logic in Computer Science · Computer Science 2012-10-10 Domenico Cantone , Cristiano Longo

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. Let $f(n,a)$ be the maximum number of sets in a…

Combinatorics · Mathematics 2020-04-14 Brianna Amaral , Lucien Dalton , Drew Polakowski , Annie Raymond , Bertram Thomas

``Behind every limit theorem, there is an inequality'' said Kolmogorov. We say ``for every inequality, there is an approximate inequality under approximate regularity conditions.'' Suppose $X, X'$ are independent and identically distributed…

Statistics Theory · Mathematics 2026-04-17 Manit Paul , Arun Kumar Kuchibhotla

We give a finite-sample analysis of predictive inference procedures after model selection in regression with random design. The analysis is focused on a statistically challenging scenario where the number of potentially important…

Statistics Theory · Mathematics 2009-08-26 Hannes Leeb

Starting with a likelihood or preference order on worlds, we extend it to a likelihood ordering on sets of worlds in a natural way, and examine the resulting logic. Lewis earlier considered such a notion of relative likelihood in the…

Artificial Intelligence · Computer Science 2016-08-31 J. Y. Halpern

Let $ V_{n} = X_{1,n} + X_{2,n} + \cdots + X_{n,n}$ where $X_{i,n}$ are Bernoulli random variables which take the value $1$ with probability $b(i;n)$. Let $\lambda_{n} = \sum\limits_{i=1}^{n} b(i;n) $, $\lambda = \lim\limits_{n \to \infty}…

Probability · Mathematics 2018-12-18 Italo Simonelli , Lucia D. Simonelli

This paper studies the problem of upper bounding the number of independent sets in a graph, expressed in terms of its degree distribution. For bipartite regular graphs, Kahn (2001) established a tight upper bound using an…

Combinatorics · Mathematics 2021-04-01 Igal Sason

This paper presents a new approach to conditional inference, based on the simulation of samples conditioned by a statistics of the data. Also an explicit expression for the approximation of the conditional likelihood of long runs of the…

Applications · Statistics 2012-02-07 Michel Broniatowski , Virgile Caron

Farkas' lemma is an ubiquitous tool in optimisation, as it provides necessary and sufficient conditions to have $b \in A(P)$, where $P$ is a closed convex cone, $A$ is a (continuous) linear mapping and $b$ is a fixed vector. The standard…

Optimization and Control · Mathematics 2026-03-13 Camille Pouchol , Emmanuel Trélat , Christophe Zhang

It is now a well-known fact that the correlations arising from local dichotomic measurements on an entangled quantum state may exhibit intrinsically non-classical features. In this paper we delve into a comprehensive study of random…

One reason why standard formulations of the central limit theorems are not applicable in high-dimensional and non-stationary regimes is the lack of a suitable limit object. Instead, suitable distributional approximations can be used, where…

Statistics Theory · Mathematics 2024-12-20 Fabian Mies

We investigate an extension of ZFC set theory (in an extended language) that stipulates the existence of a proper class of indiscernibles over the universe. One of the main results of the paper shows that the purely set-theoretical…

Logic · Mathematics 2022-03-11 Ali Enayat

We propose a new class of extreme-value copulas which are extreme-value limits of conditional normal models. Conditional normal models are generalizations of conditional independence models, where the dependence among observed variables is…

Methodology · Statistics 2021-02-16 Pavel Krupskii , Marc G. Genton

The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in…

Combinatorics · Mathematics 2019-07-03 Zhen Cui , Ze-Chun Hu

When the historical data are limited, the conditional probabilities associated with the nodes of Bayesian networks are uncertain and can be empirically estimated. Second order estimation methods provide a framework for both estimating the…

Machine Learning · Statistics 2022-08-09 Conrad D. Hougen , Lance M. Kaplan , Federico Cerutti , Alfred O. Hero

Proving a conjecture of Talagrand, a fractional version of the 'expectation-threshold' conjecture of Kalai and the second author, we show for any increasing family $F$ on a finite set $X$ that $p_c (F) =O( q_f (F) \log \ell(F))$, where…

Combinatorics · Mathematics 2019-12-11 Keith Frankston , Jeff Kahn , Bhargav Narayanan , Jinyoung Park

Motivated by the pervasiveness of strong inapproximability results for Max-CSPs, we introduce a relaxed notion of an approximate solution of a Max-CSP. In this relaxed version, loosely speaking, the algorithm is allowed to replace the…

Computational Complexity · Computer Science 2012-04-26 Per Austrin , Johan Håstad