Open AccessBook
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Michael Mitzenmacher,Eli Upfal +1 more
Reads0
Chats0
TLDR
Preface 1. Events and probability 2. Discrete random variables and expectation 3. Moments and deviations 4. Chernoff bounds 5. Balls, bins and random graphs 6. Probabilistic method 7. Markov chains and random walks 8. Continuous distributions and the Poisson processAbstract:
Preface 1. Events and probability 2. Discrete random variables and expectation 3. Moments and deviations 4. Chernoff bounds 5. Balls, bins and random graphs 6. The probabilistic method 7. Markov chains and random walks 8. Continuous distributions and the Poisson process 9. Entropy, randomness and information 10. The Monte Carlo method 11. Coupling of Markov chains 12. Martingales 13. Pairwise independence and universal hash functions 14. Balanced allocations References.read more
Citations
More filters
Proceedings ArticleDOI
Polar Codes for the Deletion Channel: Weak and Strong Polarization
TL;DR: This paper presents the first proof of polarization for the deletion channel with a constant deletion rate and a regular hidden-Markov input distribution, and proves a weak polarization theorem for standard polar codes on the delete channel.
Journal ArticleDOI
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets
TL;DR: A novel methodology to identify a meaningful support threshold s* for a dataset, such that the number of itemsets with support at least s* represents a substantial deviation from what would be expected in a random dataset.
Journal ArticleDOI
On the Throughput of Two-Way Relay Networks Using Network Coding
TL;DR: This paper derives the closed-form expression of the network throughput under certain traffic load in a slotted ALOHA network with basic medium access control and explores how the maximum throughput can be achieved in a two-way relay wireless network.
Proceedings ArticleDOI
Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers
TL;DR: This work considers Internet-based master-worker computations, where a master processor assigns, across the Internet, a computational task to a set of untrusted worker processors, and collects their responses; examples of such computations are the ¿@home¿ projects such as SETI.
Journal ArticleDOI
Multicast Throughput for Hybrid Wireless Networks under Gaussian Channel Model
TL;DR: According to the different scenarios in terms of m, n, and nd, the optimal scheme from the three categories of strategies is selected, and the achievable multicast throughput based on the optimal decision is derived.
References
More filters
Journal ArticleDOI
The power of two choices in randomized load balancing
TL;DR: This work uses a limiting, deterministic model representing the behavior as n/spl rarr//spl infin/ to approximate the behavior of finite systems and provides simulations that demonstrate that the method accurately predicts system behavior, even for relatively small systems.