Related papers: A Conditional Extension of the Park-Pham Theorem
One of the prominent open problems in combinatorics is the discrepancy of set systems where each element lies in at most $t$ sets. The Beck-Fiala conjecture suggests that the right bound is $O(\sqrt{t})$, but for three decades the only…
Probabilities of causation are fundamental to individual-level explanation and decision making, yet they are inherently counterfactual and not point-identifiable from data in general. Existing bounds either disregard available covariates,…
In classical extreme value theory probabilities of extreme events are estimated assuming all the components of a random vector to be in a domain of attraction of an extreme value distribution. In contrast, the conditional extreme value…
Previously, Erd\H{o}s, Kierstead and Trotter investigated the dimension of random height~$2$ partially ordered sets. Their research was motivated primarily by two goals: (1)~analyzing the relative tightness of the F\"{u}redi-Kahn upper…
Statistical inference for extreme values of random events is difficult in practice due to low sample sizes and inaccurate models for the studied rare events. If prior knowledge for extreme values is available, Bayesian statistics can be…
In this paper we consider the inference rules of System P in the framework of coherent imprecise probabilistic assessments. Exploiting our algorithms, we propagate the lower and upper probability bounds associated with the conditional…
A framework for causal inference from two-level factorial designs is proposed. The framework utilizes the concept of potential outcomes that lies at the center stage of causal inference and extends Neyman's repeated sampling approach for…
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…
By well known results of probability theory, any sequence of random variables with bounded second moments has a subsequence satisfying the central limit theorem and the law of the iterated logarithm in a randomized form. In this paper we…
The paper aims at reconsidering the famous Le Cam LAN theory. The main features of the approach which make it different from the classical one are as follows: (1) the study is nonasymptotic, that is, the sample size is fixed and does not…
In combinatorial problems it is sometimes possible to define a $G$-equivariant mapping from a space $X$ of configurations of a system to a Euclidean space $\mathbb{R}^m$ for which a coincidence of the image of this mapping with an…
It is often claimed that Bayesian methods, in particular Bayes factor methods for hypothesis testing, can deal with optional stopping. We first give an overview, using elementary probability theory, of three different mathematical meanings…
For statistical decision problems with finite parameter space, it is well-known that the upper value (minimax value) agrees with the lower value (maximin value). Only under a generalized notion of prior does such an equivalence carry over…
For N=1,2,..., let S_N be a simple random sample of size n=n_N from a population A_N of size N, where 0<=n<=N. Then with f_N=n/N, the sampling fraction, and 1_A the inclusion indicator that A is in S_N, for any H a subset of A_N of size k>=…
In this paper we study the exponential decay of posterior probability of a set of sources and conditioning by rare sources for both uniform and general prior distributions of sources. The decay rate is determined by $L$-divergence and rare…
The coupling constants of fixed points in the $\epsilon$ expansion at one loop are known to satisfy a quadratic bound due to Rychkov and Stergiou. We refer to fixed points that saturate this bound as extremal fixed points. The theories…
A new method of deriving comparative statics information using generalized compensated derivatives is presented which yields constraint-free semidefiniteness results for any differentiable, constrained optimization problem. More generally,…
Given a knowledge base KB containing first-order and statistical facts, we consider a principled method, called the random-worlds method, for computing a degree of belief that some formula Phi holds given KB. If we are reasoning about a…
Non-deductive reasoning systems are often {\em representation dependent}: representing the same situation in two different ways may cause such a system to return two different answers. Some have viewed this as a significant problem. For…
A central question in random matrix theory is universality. When an emergent phenomena is observed from a large collection of chosen random variables it is natural to ask if this behavior is specific to the chosen random variable or if the…