Related papers: Stochastic domination for iterated convolutions an…
We address the fundamental problem of selection under uncertainty by modeling it from the perspective of Bayesian persuasion. In our model, a decision maker with imperfect information always selects the option with the highest expected…
In this paper we study the behaviour of the domination number of the Erd\H{o}s-R\'enyi random graph $\mathcal{G}(n,p)$. Extending a result of Wieland and Godbole we show that the domination number of $\mathcal{G}(n,p)$ is equal to one of…
A competition model on $\mathbb{Z}_+^{2}$ governed by directed last passage percolation is considered. A stochastic domination argument between subtrees of the last passage percolation is put forward.
In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a full classification of the related maximisation and…
We study stochastic ordering of system lifetimes with dependent and heterogeneous components whose marginal distributions are obtained through transformations of a common baseline. The dependence structure is modeled via Archimedean…
In this paper we begin an exploration of several domination-related parameters (among which are the total, restrained, total restrained, paired, outer connected and total outer connected domination numbers) in the generalized lexicographic…
Let $\mu$ and $\nu$ be probability measures on $\mathbb{R}$ with compact support, and let $\mu \boxplus \nu$ denote their additive free convolution. We show that for $z \in \mathbb{R}$ greater than the sum of essential suprema of $\mu$ and…
A point $p \in \mathbb{R}^d$ is said to dominate another point $q \in \mathbb{R}^d$ if the coordinate of $p$ is greater than or equal to the coordinate of $q$ in every dimension. A set of points in $\mathbb{R}^d$ is dominance-free if any…
Optimization problems with stochastic dominance constraints provide a possibility to shape risk by selecting a benchmark random outcome with a desired distribution. The comparison of the relevant random outcomes to the respective benchmarks…
The quantization scheme in probability theory deals with finding a best approximation of a given probability distribution by a probability distribution that is supported on finitely many points. In this paper, first we state and prove a…
We prove stochastic stability of chaotic maps for a general class of Markov random perturbations (including singular ones) satisfying some kind of mixing conditions. One of the consequences of this statement is the proof of Ulam's…
We extend the discrete majorization theory by working with non-normalized Lorenz curves. Then we prove two generalizations of the Muirhead theorem. These not only use elementary transfers but also local increases. Together these operations…
Majorization and trumping are two partial orders which have proved useful in quantum information theory. We show some relations between these two partial orders and generalized Dirichlet polynomials, Mellin transforms, and completely…
We show that combining randomized measurement protocols with importance sampling allows for characterizing entanglement in significantly larger quantum systems and in a more efficient way than in previous work. A drastic reduction of…
We introduce a transport-majorization argument that establishes a majorization in the convex order between two densities, based on control of the gradient of a transportation map between them. As applications, we give elementary derivations…
I defend an analog of probabilism that characterizes rationally coherent estimates for chances. Specifically, I demonstrate the following accuracy-dominance result for stochastic theories in the C*-algebraic framework: supposing an…
Given a probability measure $\mu$ over ${\mathbb R}^n$, it is often useful to approximate it by the convex combination of a small number of probability measures, such that each component is close to a product measure. Recently, Ronen Eldan…
Consider all $k$-element subsets and $\ell$-element subsets $(k>\ell )$ of an $n$-element set as vertices of a bipartite graph. Two vertices are adjacent if the corresponding $\ell$-element set is a subset of the corresponding $k$-element…
We use majorization and confidence intervals as a convenient tool to compare the uncertainty in photon number for different quantum light states. To this end majorization is formulated in terms of confidence intervals. As a suitable case…
We consider probabilistic theories in which the most elementary system, a two-dimensional system, contains one bit of information. The bit is assumed to be contained in any complete set of mutually complementary measurements. The…