Related papers: Compressibility and probabilistic proofs
The Simulation Argument has gained significant traction in the public arena. It has offered a hypothesis based on probabilistic analysis of its assumptions that we are likely to exist within a computer simulation. This has been derived from…
We give a version of the Borel-Cantelli lemma. As an application, we prove an almost sure local central limit theorem. As another application, we prove a dynamical Borel-Cantelli lemma for systems with sufficiently fast decay of…
We introduce a multiscale test statistic based on local order statistics and spacings that provides simultaneous confidence statements for the existence and location of local increases and decreases of a density or a failure rate. The…
We provide an introduction to logarithmic potential theory in the complex plane that particularly emphasizes its usefulness in the theory of polynomial and rational approximation. The reader is invited to explore the notions of Fekete…
We present and examine a result related to uncertainty reasoning, namely that a certain plausibility space of Cox's type can be uniquely embedded in a minimal ordered field. This, although a purely mathematical result, can be claimed to…
We completely characterize $\Delta$- and local subexponentialities of positive-half compound Poisson distributions and extend the characterization on two-sided distributions. Moreover, $\Delta$-subexponentiality of infinitely divisible…
The Lopsided Lov\'{a}sz Local Lemma (LLLL) is a powerful probabilistic principle which has been used in a variety of combinatorial constructions. While originally a general statement about probability spaces, it has recently been…
We give a probalistic proof of the famous Meinardus' asymptotic formula for the number of weighted partitions with weakened one of the three Meinardus' conditions, and extend the resulting version of the theorem to other two classis types…
The law of likelihood underlies a general framework, known as the likelihood paradigm, for representing and interpreting statistical evidence. As stated, the law applies only to simple hypotheses, and there have been reservations about…
We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…
We develop the basic model theory of local positive logic, a new logic that mixes positive logic (where negation is not allowed) and local logic (where models omit types of infinite distant pairs). We study several basic model theoretic…
We investigate the computational complexity of admissibility of inference rules in infinite-valued {\L}ukasiewicz propositional logic (\L). It was shown in [13] that admissibility in {\L} is checkable in PSPACE. We establish that this…
The paper provides new upper and lower bounds for the multivariate Laplace approximation under weak local assumptions. Their range of validity is also given. An application to an integral arising in the extension of the Dixon's identity is…
We give a simple statistical proof of a binomial identity, by evaluating the Laplace transform of the maximum of n independent exponential random variables in two different ways. As a by product, we obtain a simple proof of an interesting…
Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…
Probability-like parameters appearing in some statistical models, and their prior distributions, are reinterpreted through the notion of `circumstance', a term which stands for any piece of knowledge that is useful in assigning a…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
We propose a new algorithmic framework, called "partial rejection sampling", to draw samples exactly from a product distribution, conditioned on none of a number of bad events occurring. Our framework builds (perhaps surprising) new…
We examine a new approach to modeling uncertainty based on plausibility measures, where a plausibility measure just associates with an event its plausibility, an element is some partially ordered set. This approach is easily seen to…
The resampling algorithm of Moser \& Tardos is a powerful approach to develop constructive versions of the Lov\'{a}sz Local Lemma (LLL). We generalize this to partial resampling: when a bad event holds, we resample an appropriately-random…