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
Journal ArticleDOI
Linear controller design for chance constrained systems
TL;DR: The objective is to find a state feedback gain that minimizes a quadratic stage cost function, while observing chance constraints on the input and/or the state, in a linear control law for a linear system with stationary additive disturbances.
Journal ArticleDOI
A time optimized scheme for top-k list maintenance over incomplete data streams
TL;DR: This paper adopts the principles of Optimal Stopping Theory and introduces a scheme that determines, in the appropriate time, when the OE decides to initiate the maintenance process of the top-k list, and attempts to minimize the number of the necessary processing tasks over the list of objects.
Journal ArticleDOI
Non-backtracking random walks mix faster
TL;DR: In this article, the mixing rate of a non-backtracking random walk on a regular expander was shown to be up to twice as fast as that of a simple random walk.
Proceedings ArticleDOI
Robust Incentive Tree Design for Mobile Crowdsensing
TL;DR: RIT is designed as a Robust Incentive Tree mechanism for mobile crowdsensing which combines the advantages of auctions and incentive trees and it is proved that RIT is truthful and sybil-proof with probability at least H, for any given H in (0,1).
Proceedings ArticleDOI
Unpredictable Software-based Attestation Solution for node compromise detection in mobile WSN
TL;DR: USAS is presented: Unpredictable Software-based Attestation Solution, a node compromise detection algorithm in mWSNs that deploys dynamic node attestation chains to decrease checksum computation time by almost 48% for selective attested nodes.
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.