Related papers: A distribution on triples with maximum entropy mar…
The maximum entropy principle (MEP) is a method for obtaining the most likely distribution functions of observables from statistical systems, by maximizing entropy under constraints. The MEP has found hundreds of applications in ergodic and…
We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained…
For coprime positive integers $a, b, c$, where $a+b=c$, $\gcd(a,b,c)=1$ and $1\leq a < b$, the famous $abc$ conjecture (Masser and Oesterl\`e, 1985) states that for $\varepsilon > 0$, only finitely many $abc$ triples satisfy $c >…
Given a probability distribution P, what is the minimum amount of bits needed to store a value x sampled according to P, such that x can later be recovered (except with some small probability)? Or, what is the maximum amount of uniform…
A conjecture by Deutsch, Kitaev, and Remmel states that the triples of permutation statistics $(S_{10}, S_{12}, S_{17})$ and $(S_{12}, S_{10} ,S_{17})$ are equidistributed over the symmetric group $\mathfrak{S}_n$. Here, $S_{10}$ enumerates…
The class of selfdecomposable distributions in free probability theory was introduced by Barndorff-Nielsen and the third named author. It constitutes a fairly large subclass of the freely infinitely divisible distributions, but so far…
We study solutions to the equation $a+b=c$, where $a,b,c$ form a triple of coprime natural numbers. The $abc$ conjecture asserts that, for any $\epsilon>0$, such triples satisfy $\mathrm{rad}(abc) \ge c^{1-\epsilon}$ with finitely many…
An equivalent condition for the product of elements of an independent random sample on a compact algebraic group converging in distribution to some random variable as the sample size increases is obtained. Namely, a limit distribution…
In this paper three new characterizing theorems of exponential distribution are presented. They are based on equidistribution of some functions of order statistics. All of them include the median of sample of size three.
On a compact group the Haar probability measure plays the role of uniform distribution. The entropy and rate distortion theory for this uniform distribution is studied. New results and simplified proofs on convergence of convolutions on…
In this paper we study the problem of computing max-entropy distributions over a discrete set of objects subject to observed marginals. Interest in such distributions arises due to their applicability in areas such as statistical physics,…
Let $\BS_1,...,\BS_n$ be independent identically distributed random variables each having the standardized Bernoulli distribution with parameter $p\in(0,1)$. Let $m_*(p):=(1+p+2p^2)/(2\sqrt{p-p^2}+4p^2)$ if $0<p\le 1/2$ and $m_*(p):=1$ if…
Let $X_1,..., X_N\in\R^n$ be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability at least $1 - 3 \exp(-c\sqrt{n}\r)$ one has $ \sup_{x\in…
We address the question of the infinitude of twin and cousin prime pairs from a probabilistic perspective. Our approach partitions the set of integer numbers greater than $2$ in finite intervals of the form $[p_{n-1}^2,p_n^2)$, $p_{n-1}$…
We prove a conjecture dating back to a 1978 paper of D.R.\ Musser~\cite{musserirred}, namely that four random permutations in the symmetric group $\mathcal{S}_n$ generate a transitive subgroup with probability $p_n > \epsilon$ for some…
The relationship between three probability distributions and their maximizable entropy forms is discussed without postulating entropy property. For this purpose, the entropy I is defined as a measure of uncertainty of the probability…
Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…
Let $C$ be an $[n,k]$ linear code chosen uniformly at random over a finite field $\mathbb{F}_q$ of size $q$. The following asymptotic probability of $C$ being maximum distance separable (MDS) as $q,n,k\to\infty$ is known: If…
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…
Maximum entropy models are increasingly being used to describe the collective activity of neural populations with measured mean neural activities and pairwise correlations, but the full space of probability distributions consistent with…