Related papers: Variations on the Sensitivity Conjecture

New cases of the multiplicity conjecture are considered.

Sensitivity analysis informs causal inference by assessing the sensitivity of conclusions to departures from assumptions. The consistency assumption states that there are no hidden versions of treatment and that the outcome arising…

We discuss various recent advances on weak forms of the Twin Prime Conjecture.

The sensitivities revealed by a sensitivity analysis of a probabilistic network typically depend on the entered evidence. For a real-life network therefore, the analysis is performed a number of times, with different evidence. Although…

This is a collection of variants of Schanuel's conjecture and the known dependencies between them. It was originally written in 2007, and made available for a time on my webpage. I have been asked by a few people to make it available again…

We give a counterexample to a recently conjectured variant of the Penrose inequality.

With the advance of efficient analytical methods for sensitivity analysis ofprobabilistic networks, the interest in the sensitivities revealed by real-life networks is rekindled. As the amount of data resulting from a sensitivity analysis…

The Sensitivity Conjecture is a long-standing problem in theoretical computer science that seeks to fit the sensitivity of a Boolean function into a unified framework formed by the other complexity measures of Boolean functions, such as…

We discuss the (twisted) weak positivity theorem. We also treat some applications.

We survey recent developments on the Restriction conjecture.

We survey some old and new results on strong variants of Chang's Conjecture and related topics.

We propose and discuss sensitivity metrics for reliability analysis, which are based on the value of information. These metrics are easier to interpret than other existing sensitivity metrics in the context of a specific decision and they…

We review a combinatoric approach to the Hodge Conjecture for Fermat Varieties and announce new cases where the conjecture is true.

We study \L o\'s's theorem in a choiceless context. We introduce some variants of \L o\'s's theorem. These variants seem weaker than \L o\'s's theorem, but we prove that these are equivalent to \L o\'s's theorem.

Some asymptotic notions for random variables are discussed. In particular, different versions of O and o for sequences of random variables are studied. The results are elementary and more or less well-known, but collected here for future…

In this paper, we give a survey of the recent develpoments of the DDVV conjecture.

We derive a novel sensitivity analysis of input variables for predictive epistemic and aleatoric uncertainty. We use Bayesian neural networks with latent variables as a model class and illustrate the usefulness of our sensitivity analysis…

We explore several variations on the recently discovered phenomena of murmurations for elliptic curves and modular forms.

We provide a proof of a variant of the Landau-Siegel Zeros conjecture.

Causal inference with observational studies often suffers from unmeasured confounding, yielding biased estimators based on the unconfoundedness assumption. Sensitivity analysis assesses how the causal conclusions change with respect to…