Tail bounds for sums of geometric and exponential variables
From MaRDI portal
(Redirected from Publication:1650280)
Abstract: We give explicit bounds for the tail probabilities for sums of independent geometric or exponential variables, possibly with different parameters.
Cites work
- scientific article; zbMATH DE number 1713116 (Why is no real title available?)
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- Concentration inequalities. A nonasymptotic theory of independence
Cited in
(42)- Successive shortest paths in complete graphs with random edge weights
- How fast can we reach a target vertex in stochastic temporal graphs?
- Fragile complexity of comparison-based algorithms
- Activated Random Walks on \(\mathbb{Z}^d\)
- The Swendsen–Wang dynamics on trees
- Activated random walk on a cycle
- Schnyder woods, \(\mathrm{SLE}_{16}\), and Liouville quantum gravity
- Bounds for the t-tail area
- Some improved tail bounds for the sum of variables with geometric distribution
- Probabilistic analysis of optimization problems on sparse random shortest path metrics
- Tail bounds for sums of independent two-sided exponential random variables
- scientific article; zbMATH DE number 7650111 (Why is no real title available?)
- Running time analysis of broadcast consensus protocols
- How fast can we reach a target vertex in stochastic temporal graphs?
- The String of Diamonds Is Tight for Rumor Spreading
- First passage percolation in hostile environment is not monotone
- Tail bounds for the O'Connell-Yor polymer
- Fluctuation bounds for continuous time branching processes and evolution of growing trees with a change point
- Scaling limit of triangulations of polygons
- Optimal mean-based algorithms for trace reconstruction
- Irreversible Markov dynamics and hydrodynamics for KPZ states in the stochastic six vertex model
- Balanced Allocation: Patience Is Not a Virtue
- Greedy Algorithm Almost Dominates in Smoothed Contextual Bandits
- An exponential timestepping algorithm for diffusion with discontinuous coefficients
- Lower bounds for superpatterns and universal sequences
- scientific article; zbMATH DE number 1040052 (Why is no real title available?)
- Haldane's formula in Cannings models: the case of moderately weak selection
- On broadcasting time in the model of travelling agents
- Stochastic analysis of rumor spreading with multiple pull operations
- Interlacing and scaling exponents for the geodesic watermelon in last passage percolation
- Upper tail analysis of bucket sort and random tries
- Upper tail analysis of bucket sort and random tries
- On simple back-off in unreliable radio networks
- Reverse iterative volume sampling for linear regression
- Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates
- Random volumes in \(d\)-dimensional polytopes
- Extensive condensation in a model of preferential attachment with fitness
- GHS algorithm on a graph with random weights
- Optimal differentially private learning of thresholds and quasi-concave optimization
- Formation of large-scale random structure by competitive erosion
- Scaling features of two special Markov chains involving total disasters
- Tail bounds for sum of gamma variables and related inferences
This page was built for publication: Tail bounds for sums of geometric and exponential variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650280)
