Related papers: Stochastic domination for iterated convolutions an…
By using path integrals, the stochastic process associated to the time evolution of the quantum probability density is formally rewritten in terms of a stochastic differential equation, given by Newton's equation of motion with an…
We give a precise functional comparison between classical and free convolutions. If $\mu$ and $\nu$ are compactly supported probability measures, we show that the expectation of $f$ over the classical convolution $\mu * \nu$ is at least the…
Majorization is a basic concept in matrix theory that has found applications in numerous settings over the past century. Power majorization is a more specialized notion that has been studied in the theory of inequalities. On the other hand,…
Let $\nu$ be a Borel probability measure on a $d$-dimensional Euclidean space $\mathbb{R}^d$, $d\geq 1$, with a compact support, and let $(p_0, p_1, p_2, \ldots, p_N)$ be a probability vector with $p_j>0$ for $0\leq j\leq N$. Let $\{S_j:…
Consider Plurality with random tie-breaking. This paper uses standard axiomatic extensions of preferences over elements to preferences over sets (Kelly, Gardenfors, Responsiveness) to characterize all better-replies of a voter under…
In this follow-up to [M.G.~Cornet, P.~Torres, arXiv:2308.15603], where the $k$-tuple domination number and the 2-packing number in Kneser graphs $K(n,r)$ were studied, we are concerned with two variations, the $k$-domination number,…
The domination problem and several of its variants (total domination, 2-domination and secure domination) are considered. These problems have various real-world applications, but are NP-hard to solve to provable optimality, making fast…
The validity of the strong law of large numbers for multiple sums $S_n$ of independent identically distributed random variables $Z_k$, $k\leq n$, with $r$-dimensional indices is equivalent to the integrability of $|Z|(\log^+|Z|)^{r-1}$,…
We cosider random dynamical systems with randomly chosen jumps. The choice of deterministic dynamical system and jumps depends on a position. We proove the existence of an exponentially attractive invariant measure and the strong law of…
Evaluating large language models across many benchmarks is expensive, yet many benchmarks are highly correlated. We formalize the selection of a small, informative subset as submodular maximization under a multivariate Gaussian model.…
The general notion of a stochastic ordering is that one probability distribution is smaller than a second one if the second attaches more probability to higher values than the first. Motivated by recent work on barycentric maps on spaces of…
We discuss a new stochastic ordering for the sequence of independent random variables. It generalizes the stochastic precedence order that is defined for two random variables to the case $n>2$. All conventional stochastic orders are…
In this paper, we consider U-statistics whose data is a strictly stationary sequence which can be expressed as a functional of an i.i.d. one. We establish a strong law of large numbers, a bounded law of the iterated logarithms and a central…
Let a sequence of iid. random variables $\xi_1,...,\xi_n$ be given on a measurable space $(X,\cal X)$ with distribution $\mu$ together with a function $f(x_1,...,x_k)$ on the product space $(X^k,{\cal X}^k)$. Let $\mu_n$ denote the…
Given a graph $G$ and some initial labelling $\sigma : V(G) \to \{Red, Blue\}$ of its vertices, the \textit{majority dynamics model} is the deterministic process where at each stage, every vertex simultaneously replaces its label with the…
In this paper, we study "robust" dominating sets of random graphs that retain the domination property even if a small \emph{deterministic} set of edges are removed. We motivate our study by illustrating with examples from wireless networks…
We study the algorithmic decidability of the domination number in the Erdos-Renyi random graph model $G(n,p)$. We show that for a carefully chosen edge probability $p=p(n)$, the domination problem exhibits a strong irreducible property.…
Through Monte Carlo Simulation, the well-known majority-vote model has been studied with noise on directed random graphs. In order to characterize completely the observed order-disorder phase transition, the critical noise parameter $q_c$,…
In many branches of engineering, Banach contraction mapping theorem is employed to establish the convergence of certain deterministic algorithms. Randomized versions of these algorithms have been developed that have proved useful in…
In quantum experiments the acquisition and representation of basic experimental information is governed by the multinomial probability distribution. There exist unique random variables, whose standard deviation becomes asymptotically…