Probability Inequalities Related to Markov's Theorem

By B. K. Ghosh. 2002

73 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/c10dad28d927d1cec383e9d0fb514236cef5e6a0

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Medhi Bennis
2. Merouane Debbah
3. Sumudu Samarakoon
4. Walid Saad
5. Jihong Park
6. H. Vincent Poor
7. Anis Elgabli
8. Mingzhe Chen

In Computational Theory and Mathematics

1. Merouane Debbah
2. Walid Saad
3. Medhi Bennis
4. Sumudu Samarakoon

Citations in the corpus

• Distributed Federated Learning for Ultra-Reliable Low-Latency Vehicular Communications (2018, methodology): “As such, the reliability constraint in (5) can be recast as E [ q u ] ≤ ǫq 0 for each VUE u ∈ U using the upper bound condition Pr ( q u ≥ q 0 ) ≤ E [ q u ] /q 0 based on the Markov’s inequality [34].”