Probability asymptotics: notes on notation
arXiv:1108.3924
Abstract
Some asymptotic notions for random variables are discussed. In particular, different versions of O and o for sequences of random variables are studied. The results are elementary and more or less well-known, but collected here for future use and easy reference.
arXiv comment10 pages
Cited by in corpus (15)
- Sparse graphs using exchangeable random measures
- Bootstrap percolation on the random graph
- Phase transitions for modified Erdös-Rényi processes
- Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities
- Bootstrap percolation on a graph with random and local connections
- Preferential attachment without vertex growth: emergence of the giant component
- Cutting resilient networks -- complete binary trees
- Some compact notations for concentration inequalities and user-friendly results
- Majority bootstrap percolation on the random graph G(n,p)
- Longest and shortest cycles in random planar graphs
- Near-critical SIR epidemic on a random graph with given degrees
- Simply generated trees, conditioned Galton--Watson trees, random allocations and condensation
- The giant component and 2-core in sparse random outerplanar graphs
- Supplementary Material for CDC Submission No. 1461
- On the Strength of Connectivity of Inhomogeneous Random K-out Graphs