Related papers: On Buffon Machines and Numbers
Inspired by the Japanese game Pachinko, we study simple (perfectly "inelastic" collisions) dynamics of a unit ball falling amidst point obstacles (pins) in the plane. A classic example is that a checkerboard grid of pins produces the…
We develop a likelihood methodology which can be used to search for evidence of burst repetition in the BATSE catalog, and to study the properties of the repetition signal. We use a simplified model of burst repetition in which a number…
The idea behind Poisson approximation to the binomial distribution was used in [J. de la Cal, F. Luquin, J. Approx. Theory, 68(3), 1992, 322-329] and subsequent papers in order to establish the convergence of suitable sequences of positive…
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…
The proposal and study of dependent prior processes has been a major research focus in the recent Bayesian nonparametric literature. In this paper, we introduce a flexible class of dependent nonparametric priors, investigate their…
We consider a Branching Random Walk on $\R$ whose step size decreases by a fixed factor, $0<b<1$, with each turn. This process generates a random probability measure on $\R$, that is, the limit of uniform distribution among the $2^n$…
The empirical probability density function for the conditional distribution of the true value of Poisson distribution parameter on one measurement is constructed by computer experiment. The analysis of the obtained distributions confirms…
We propose a novel continuous testing framework to test the intensities of Poisson Processes. This framework allows a rigorous definition of the complete testing procedure, from an infinite number of hypothesis to joint error rates. Our…
This paper deals with the problem of estimating the volume of the excursion set of a function $f:\mathbb{R}^d \to \mathbb{R}$ above a given threshold, under a probability measure on $\mathbb{R}^d$ that is assumed to be known. In the…
The last success problem is an optimal stopping problem that aims to maximize the probability of stopping on the last success in a sequence of independent $n$ Bernoulli trials. In the classical setting where complete information about the…
Many experiments are concerned with the comparison of counts between treatment groups. Examples include the number of successful signups in conversion rate experiments, or the number of errors produced by software versions in canary…
The problem addressed concerns the determination of the average number of successive attempts of guessing a word of a certain length consisting of letters with given probabilities of occurrence. Both first- and second-order approximations…
We propose a new method for the calculation of the statistical properties, as e.g. the entropy, of unknown generators of symbolic sequences. The probability distribution $p(k)$ of the elements $k$ of a population can be approximated by the…
We study sums of independent random variables that take values $0$, $1/2$, or $1$. We show that the probability mass function of the sum splits into two interleaved parts: one supported on the integers and the other supported on the…
High-dimensional count data poses significant challenges for statistical analysis, necessitating effective methods that also preserve explainability. We focus on a low rank constrained variant of the Poisson log-normal model, which relates…
The toss of a coin is usually regarded as the epitome of randomness, and has been used for ages as a means to resolve disputes in a simple, fair way. Perhaps as ancient as consulting objects such as coins and dice is the art of maliciously…
We study the problem of estimating the distribution of effect sizes (the mean of the test statistic under the alternate hypothesis) in a multiple testing setting. Knowing this distribution allows us to calculate the power (type II error) of…
This paper is a comment on the paper "Quantum Mechanics and Algorithmic Randomness" was written by Ulvi Yurtsever \cite{Yurtsever} and the briefly explanation of the algorithmic randomness of quantum measurements results. There are…
It is shown that an equiprobability hypothesis leads to a scenario in which it is possible to predict the outcome of a single toss of a fair coin with a success probability greater than 50%. We discuss whether this hypothesis might be…
We formulate the statistics of the discrete multicomponent fragmentation event using a methodology borrowed from statistical mechanics. We generate the ensemble of all feasible distributions that can be formed when a single integer…