Related papers: Limit theorems for the Multiplicative Binomial Dis…
Let $n$ be a large integer and $M_n$ be a random $n$ by $n$ matrix whose entries are i.i.d. Bernoulli random variables (each entry is $\pm 1$ with probability 1/2). We show that the probability that $M_n$ is singular is at most $(3/4…
The key result of this paper is to characterize all the multivariate symmetric Bernoulli distributions whose sum is minimal under convex order. In doing so, we automatically characterize extremal negative dependence among Bernoulli random…
We study asymptotic behavior of the moments $M_k(\lambda)$ of the sum $X_1+\dots+X_{N_\lambda}$, where $N_\lambda$ follows the Poisson probability distribution with mean value $\lambda$ and $\{X_j\}$ is a family of i.i.d. random variables…
Consider the problem of drawing random variates $(X_1,\ldots,X_n)$ from a distribution where the marginal of each $X_i$ is specified, as well as the correlation between every pair $X_i$ and $X_j$. For given marginals, the…
To conduct Bayesian inference with large data sets, it is often convenient or necessary to distribute the data across multiple machines. We consider a likelihood function expressed as a product of terms, each associated with a subset of the…
A novel multinomial theorem for commutative idempotents is shown to lead to new results about the moments, central moments, factorial moments, and their generating functions for any random variable $X = \sum_{i} Y_i $ expressible as a sum…
We analyze various data of multiplicity distributions by means of the Modified Negative Binomial Distribution (MNBD) and its KNO scaling function, since this MNBD explains the oscillating behavior of the cumulant moment observed in e^+e^-…
We leverage proof techniques Fourier analysis and an existing result in coding theory to derive new bounds for the problem of non-interactive simulation of binary random variables. Previous bounds in the literature were derived by applying…
Benford's law describes a common phenomenon among many naturally occurring data sets and distributions in which the leading digits of the data are distributed with the probability of a first digit of $d$ base $B$ being…
We give an algorithm for properly learning Poisson binomial distributions. A Poisson binomial distribution (PBD) of order $n$ is the discrete probability distribution of the sum of $n$ mutually independent Bernoulli random variables. Given…
This article proposes a bivariate Simplex distribution for modeling continuous outcomes constrained to the interval $(0,1)$, which can represent proportions, rates, or indices. We derive analytical expressions to calculate the dependence…
A fractional binomial distribution, introduced by Hino and Namba (2024) via the generalized binomial theorem, is a fractional variant of the classical binomial distribution. Building upon previous work that established limit theorems, such…
In this work, we propose learnable Bernoulli dropout (LBD), a new model-agnostic dropout scheme that considers the dropout rates as parameters jointly optimized with other model parameters. By probabilistic modeling of Bernoulli dropout,…
The quasi-likelihood estimator and the Bayesian type estimator of the volatility parameter are in general asymptotically mixed normal. In case the limit is normal, the asymptotic expansion was derived in Yoshida (1997) as an application of…
This paper introduces a new concept of stochastic dependence among many random variables which we call conditional neighborhood dependence (CND). Suppose that there are a set of random variables and a set of sigma algebras where both sets…
Benford's Law (BL) or the Significant Digit Law defines the probability distribution of the first digit of numerical values in a data sample. This Law is observed in many naturally occurring datasets. It can be seen as a measure of…
The Bernoulli convolution with parameter $\lambda\in(0,1)$ is the measure on $\bf R$ that is the distribution of the random power series $\sum\pm\lambda^n$, where $\pm$ are independent fair coin-tosses. This paper surveys recent progress on…
This paper presents a framework for binary autoregressive time series in which each observation is a Bernoulli variable whose success probability evolves with past outcomes and probabilities, in the spirit of GARCH-type dynamics,…
Let $\lambda$ be a partition of the positive integer $n$, selected uniformly at random among all such partitions. Corteel et al. (1999) proposed three different procedures of sampling parts of $\lambda$ at random. They obtained limiting…
Dropout represents a typical issue to be addressed when dealing with longitudinal studies. If the mechanism leading to missing information is non-ignorable, inference based on the observed data only may be severely biased. A frequent…