相关论文: The maximum negative hypergeometric distribution

Gaussian mixture models are widely used in Statistics. A fundamental aspect of these distributions is the study of the local maxima of the density, or modes. In particular, it is not known how many modes a mixture of $k$ Gaussians in $d$…

This paper focuses on the maximal distribution on sublinear expectation space and introduces a new type of random fields with the maximally distributed finite-dimensional distribution. The corresponding spatial maximally distributed white…

Let $Y$ be a nonnegative random variable with mean $\mu$ and finite positive variance $\sigma^2$, and let $Y^s$, defined on the same space as $Y$, have the $Y$ size biased distribution, that is, the distribution characterized by…

Let $\{B(\xi_n,r_n)\}_{n\ge1}$ be a sequence of random balls whose centers $\{\xi_n\}_{n\ge1}$ is a stationary process, and $\{r_n\}_{n\ge1}$ is a sequence of positive numbers decreasing to 0. Our object is the random covering set…

Fix a positive integer $n$, a real number $p\in (0,1]$, and a (perhaps random) hypergraph $\mathcal{H}$ on $[n]$. We introduce and investigate the following random multigraph model, which we denote $\mathbb{G}(n,p\, ; \,\mathcal{H})$: begin…

Motivated by the need, in some Bayesian likelihood free inference problems, of imputing a multivariate counting distribution based on its vector of means and variance-covariance matrix, we define a generic multivariate discrete…

Consider a graph G with n nodes and m edges, which represents a social network, and assume that initially each node is blue or white. In each round, all nodes simultaneously update their color to the most frequent color in their…

If you color a table using k colors, and throw a needle randomly on it, for some proper definition, you get a certain probability that the endpoints will fall on different colors. How can one make this probability maximal? This problem is…

We show that the maximum and the minimum mass of merging neutron stars can be estimated with upcoming gravitational wave observations. We simulate populations of binary neutron star signals and model their mass distribution including upper…

We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…

We define $g$-expectation of a distribution as the infimum of the $g$-expectations of all the terminal random variables sharing that distribution. We present two special cases for nonlinear $g$ where the $g$-expectation of distributions can…

Among the variety of statistical intervals, highest-density regions (HDRs) stand out for their ability to effectively summarize a distribution or sample, unveiling its distinctive and salient features. An HDR represents the minimum size set…

We consider the distribution of the sum and the maximum of a collection of independent exponentially distributed random variables. The focus is laid on the explicit form of the density functions (pdf) of non-i.i.d. sequences. Those are…

The histogram is widely used as a simple, exploratory display of data, but it is usually not clear how to choose the number and size of bins. We construct a confidence set of distribution functions that optimally address the two main tasks…

We study the probability distribution of the number of common zeros of a system of $m$ random $n$-variate polynomials over a finite commutative ring $R$. We compute the expected number of common zeros of a system of polynomials over $R$.…

We study global distribution of zeros for a wide range of ensembles of random polynomials. Two main directions are related to almost sure limits of the zero counting measures, and to quantitative results on the expected number of zeros in…

Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability…

For a set $A \subset \mathbb{N}$ we characterize in terms of its density when there exists an infinite set $B \subset \mathbb{N}$ and $t \in \{0,1\}$ such that $B+B \subset A-t$, where $B+B : =\{b_1+b_2\colon b_1,b_2 \in B\}$. Specifically,…

An urn model of Diaconis and some generalizations are discussed. A convergence theorem is proved that implies for Diaconis' model that the empirical distribution of balls in the urn converges with probability one to the uniform…

We consider the unbalanced allocation of $m$ balls into $n$ bins by a randomized algorithm using the "power of two choices". For each ball, we select a set of bins at random, then place the ball in the fullest bin within the set.…