Related papers: A nonBayesian view of Hempel's paradox of the rave…
Neurosymbolic AI aims to integrate deep learning with symbolic AI. This integration has many promises, such as decreasing the amount of data required to train a neural network, improving the explainability and interpretability of answers…
Classical-realistic analysis of entangled systems have lead to retrodiction paradoxes, which ordinarily have been dismissed on the grounds of counter-factuality. Instead, we claim that such paradoxes point to a deeper logical structure…
In this presentation, I argue that weak measurements empirically support the notion of quantum superpositions as statistical alternatives. In short, weak measurements show that Schroedinger's cat is already dead or alive before the…
How do we compare between hypotheses that are entirely consistent with observations? The marginal likelihood (aka Bayesian evidence), which represents the probability of generating our observations from a prior, provides a distinctive…
Corroboration or confirmation is a prominent philosophical debate of the 20th century. Many philosophers have been involved in this debate most notably the proponents of confirmation led by Hempel and its most powerful criticism by the…
Two-sample hypothesis testing for random graphs arises naturally in neuroscience, social networks, and machine learning. In this paper, we consider a semiparametric problem of two-sample hypothesis testing for a class of latent position…
If a quantum system is prepared and later post-selected in certain states, "paradoxical" predictions for intermediate measurements can be obtained. This is the case both when the intermediate measurement is strong, i.e. a projective…
We survey results on the pebbling numbers of graphs as well as their historical connection with a number-theoretic question of Erd\H os and Lemke. We also present new results on two probabilistic pebbling considerations, first the random…
Let $H$ be a fixed graph whose edges are colored red and blue and let $\beta \in [0,1]$. Let $I(H, \beta)$ be the (asymptotically normalized) maximum number of copies of $H$ in a large red/blue edge-colored complete graph $G$, where the…
This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…
Meta-analysis is an important tool for combining results from multiple studies and has been widely used in evidence-based medicine for several decades. This paper reports, for the first time, an interesting and valuable paradox in…
Statistics is sometimes described as the science of reasoning under uncertainty. Statistical models provide one view of this uncertainty, but what is frequently neglected is the 'invisible' portion of uncertainty: that assumed not to exist…
If $f:\mathbb{N}\rightarrow \mathbb{N}$ is a function, then let us say that $f$ is sublinear if \[\lim_{n\rightarrow +\infty}\frac{f(n)}{n}=0.\] If $G=(V,E)$ is a cubic graph and $c:E\rightarrow \{1,...,k\}$ is a proper $k$-edge-coloring of…
In this paper, we study the task of detecting the edge dependency between two weighted random graphs. We formulate this task as a simple hypothesis testing problem, where under the null hypothesis, the two observed graphs are statistically…
The statement "The earth is flat" is factually inaccurate, but if someone truly believes and argues in its favor, it is not deceptive. Research on deception detection and fact checking often conflates factual accuracy with the truthfulness…
In statistics, there are a variety of methods for performing model selection that all stem from slightly different paradigms of statistical inference. The reasons for choosing one particular method over another seem to be based entirely on…
The reason for recalling this old paper is the ongoing discussion on the attempts of circumventing certain assumptions leading to the Bell theorem (Hess-Philipp, Accardi). If I correctly understand the intentions of these Authors, the idea…
It is demonstrated that the statistical method of the famous Aspect - Bell experiment requires negative probability densities and negative probabilities from "the thing" researched, else that thing doesn't exist. The thing refers here to…
The famous four color theorem states that for all planar graphs, every vertex can be assigned one of 4 colors such that no two adjacent vertices receive the same color. Since Francis Guthrie first conjectured it in 1852, it is until 1976…
An edge colored graph is said to contain rainbow-$F$ if $F$ is a subgraph and every edge receives a different color. In 2007, Keevash, Mubayi, Sudakov, and Verstra\"ete introduced the \emph{rainbow extremal number} $\mathrm{ex}^*(n,F)$, a…