Related papers: Stochastic domination for iterated convolutions an…

Let $X_1, X_2,\ldots, X_n$ (resp. $Y_1, Y_2,\ldots, Y_n$) be independent random variables such that $X_i$ (resp. $Y_i$) follows generalized exponential distribution with shape parameter $\theta_i$ and scale parameter $\lambda_i$ (resp.…

We consider the following convolution equation or equivalently stochastic difference equation $$\lam _k = \mu _k*\phi (\lam _{k-1}), k \in \Z \eqno (1) $$ for a given bi-sequence $(\mu _k)$ of probability measures on $\R ^d$ and a linear…

Let ($X,Y)$ be a random vector with distribution function $F(x,y),$ and $(X_{1},Y_{1}),(X_{2},Y_{2}),...,(X_{n},Y_{n})$ are independent copies of ($X,Y).$ Let $X_{i:n}$ be the $i$th order statistics constructed from the sample…

Kwapien and Woyczynski asked in their monograph (1992) whether their notion of superstrong domination is inherited when taking sums of independent symmetric random vectors (one vector dominates another if, essentially, tail probabilities of…

In this paper, we concentrate on counting and testing dominant polynomials with integer coefficients. A polynomial is called dominant if it has a simple root whose modulus is strictly greater than the moduli of its remaining roots. In…

We present three methods to construct majorizing measures in various settings. These methods are based on direct constructions of increasing sequences of partitions through a simple exhaustion procedure rather than on the construction of…

In quantum operations, probabilities characterise both the degree of the success of a state transformation and, as density operator eigenvalues, the degree of mixedness of the final state. We give a unified treatment of pure-to-pure state…

Stochastic dominance serves as a general framework for modeling a broad spectrum of decision preferences under uncertainty, with risk aversion as one notable example, as it naturally captures the intrinsic structure of the underlying…

The use of Kolmogorov-Smirnov-type statistics for testing stochastic dominance goes back to McFadden (1989). In this paper we extend the approach of Barret and Donald (2003) to the bivariate case, without the assumption of absolute…

The dominated convergence theorem implies that if (f_n) is a sequence of functions on a probability space taking values in the interval [0,1], and (f_n) converges pointwise a.e., then the sequence of integrals converges to the integral of…

We investigate the domination polynomial of the co-maximal graph $\Gamma(\mathbb{Z}_n)$ related to the ring of integers modulo $n$. Explicit formulas are derived for \( n = p^{n_1} \) and \( n = p^{n_1}q^{n_2} \), demonstrating that the…

We consider recent work linking majorization and trumping, two partial orders that have proven useful with respect to the entanglement transformation problem in quantum information, with general Dirichlet polynomials, Mellin transforms, and…

We prove for the contact process on $Z^d$, and many other graphs, that the upper invariant measure dominates a homogeneous product measure with large density if the infection rate $\lambda$ is sufficiently large. As a consequence, this…

In the Monte Carlo (MC) method statistical noise is usually present. Statistical noise may become dominant in the calculation of a distribution, usually by iteration, but is less Important in calculating integrals. The subject of the…

In this paper, we consider the evolution of an (infinitely large) population under recombination and additional evolutionary forces, modelled by a measure-valued ordinary differential equation. We provide a stochastic representation for the…

We commence the study of domination in the incidence graphs of combinatorial designs. Let $D$ be a combinatorial design and denote by $\gamma(D)$ the domination number of the incidence (Levy) graph of $D$. We obtain a number of results…

We prove a multivariate version of Bernstein's inequality about the probability that degenerate $U$-statistics take a value larger than some number $u$. This is an improvement of former estimates for the same problem which yields an…

Let $(T,d)$ be a metric space and $\phi:\mathbb{R}_+\to \mathbb{R}$ an increasing, convex function with $\phi(0)=0$. We prove that if $m$ is a probability measure $m$ on $T$ which is majorizing with respect to $d,\phi$, that is,…

Stochastic approximation algorithm is a useful technique which has been exploited successfully in probability theory and statistics for a long time. The step sizes used in stochastic approximation are generally taken to be deterministic and…

Here, we leverage recent advances in information theory to develop a novel method to characterise the dominant character of the high-order dependencies of quantum systems. To this end, we introduce the Q-information: an…