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
Posted Content
Source Localization in Networks: Trees and Beyond
TL;DR: Numerical experiments on tree networks, the ER random graphs and real world networks with different evaluation metrics show that the new source localization algorithm, called the Short-Fat Tree (SFT), outperforms existing algorithms.
Journal Article
The Quicksort algorithm and related topics
TL;DR: The time complexity of the Quicksort algorithm is studied and a complete demonstration of the variance of the number of comparisons required is provided, a known result but one whose detailed proof is not easy to read out of the literature.
Book ChapterDOI
The Evolutionary Process of Image Transition in Conjunction with Box and Strip Mutation
TL;DR: The main idea is to define evolutionary processes for digital image transition, combining different variants of mutation and evolutionary mechanisms, and introduces box and strip mutation operators which are specifically designed for image transition.
Journal ArticleDOI
Incentive analysis of Bitcoin-NG, revisited
TL;DR: This paper proposes a new incentive analysis that takes the network capacity into account, showing that Bitcoin-NG can achieve better incentive compatibility against the microblock mining attack under limited network capacity and leverage a Markov decision process to jointly analyze the incentive of both key blocks and microblocks.
Journal ArticleDOI
Tail probabilities in queueing processes
TL;DR: In this article, the authors apply the tail probability vector to deal with resource management of large scale stochastic networks and provide some effective and efficient algorithms for computing the tail probabilities by means of the matrixgeometric solution, matrix-iterative solution, the matrix-product solution and two types of RG-factorizations.
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.