Related papers: The 5-Way Scale
Many psychologists do not realize that exploratory use of the popular multiway analysis of variance (ANOVA) harbors a multiple comparison problem. In the case of two factors, three separate null hypotheses are subject to test (i.e., two…
Previous parallel sorting algorithms do not scale to the largest available machines, since they either have prohibitive communication volume or prohibitive critical path length. We describe algorithms that are a viable compromise and…
Combining several independent measurements of the same physical quantity is one of the most important tasks in metrology. Small samples, biased input estimates, not always adequate reported uncertainties, and unknown error distribution make…
This paper proposes a novel framework to test for slope heterogeneity between time-varying coefficients in panel data models. Our test not only allows us to detect whether the coefficient functions are the same across all units or not, but…
By repeated trials, one can determine the fairness of a classical coin with a confidence which grows with the number of trials. A quantum coin can be in a superposition of heads and tails and its state is most generally a density matrix.…
Tossing a coin is the most elementary Monte Carlo experiment. In a computer the coin is replaced by a pseudo random number generator. It can be shown analytically and by exact enumerations that popular random number generators are not…
In this note we compare two measures of the complexity of a class $\mathcal F$ of Boolean functions studied in (unconditional) pseudorandomness: $\mathcal F$'s ability to distinguish between biased and uniform coins (the coin problem), and…
As counterfactual examples become increasingly popular for explaining decisions of deep learning models, it is essential to understand what properties quantitative evaluation metrics do capture and equally important what they do not…
We examine the problem of searching sequentially for a desired real value (a key) within a sorted unbalanced three-dimensional finite real array. This classic problem can be viewed as determining the correct dimensional threshold function…
We study quantum walk on a ladder with combination of conventional and split-step protocols. The two components of the walk resulting from periodic boundary conditions can be made to have three kinds of probability distributions. Two of…
We discuss the practical problems arising when constructing any (new or old) scales on slide rules, i.e. realizing the theory in the practice. This might help anyone in planning and realizing (mainly the magnitude and labeling of) new…
Suppose that the vertices of the Euclidean lattice Z^d are endowed with a random scenery, obtained by tossing a fair coin at each vertex. A random walker, starting from the origin, replaces the coins along its path by i.i.d. biased coins.…
This paper looks into the gain or loss from rolling a fair die multiple times and choosing the highest or lowest number as the outcome over rolling the die just once. Specifically, this paper gives a general formula for the expected value…
Weak supervision enables efficient development of training sets by reducing the need for ground truth labels. However, the techniques that make weak supervision attractive -- such as integrating any source of signal to estimate unknown…
Decoherence transforms a ballistic quantum walk into a diffusive classical random walk. After each step the environment measures the particle's path and the outside world gets to know the which-way information. The relation between the…
Statistical tests that compare classification algorithms are univariate and use a single performance measure, e.g., misclassification error, $F$ measure, AUC, and so on. In multivariate tests, comparison is done using multiple measures…
Money laundering is a global phenomenon with wide-reaching social and economic consequences. Cryptocurrencies are particularly susceptible due to the lack of control by authorities and their anonymity. Thus, it is important to develop new…
Secure multi-party computation is an area in cryptography which studies how multiple parties can compare their private information without revealing it. Besides digital protocols, many unconventional protocols for secure multi-party…
Suppose that attached to each site z in Z is a coin with bias theta(z), and only finitely many of these coins have non-zero bias. Allow a simple random walker to generate observations by tossing, at each move, the coin attached to its…
Researchers have found that fake news spreads much times faster than real news. This is a major problem, especially in today's world where social media is the key source of news for many among the younger population. Fact verification,…