Concentration Inequalities and Martingale Inequalities: A Survey
From MaRDI portal
Publication:3431007
DOI10.1080/15427951.2006.10129115zbMath1111.60010MaRDI QIDQ3431007
Publication date: 5 April 2007
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2006.10129115
Related Items
Unnamed Item, Metamodel construction for sensitivity analysis, On martingale tail sums in affine two-color urn models with multiple drawings, Concentration inequalities for nonlinear matroid intersection, On the Method of Typical Bounded Differences, Balls into bins via local search: Cover time and maximum load, Bin sizes in time-inhomogeneous infinite Polya processes, On extinction time of a generalized endemic chain-binomial model, Robustness of power-law networks: its assessment and optimization, Tightened exponential bounds for discrete-time conditionally symmetric martingales with bounded jumps, Limiting shapes of birth-and-death processes on Young diagrams, Near-optimal PAC bounds for discounted MDPs, Noncommutative martingale concentration inequalities, On the Kolmogorov inequalities for quadratic forms of dependent uniformly bounded random variables, Concentration inequalities and laws of large numbers under epistemic and regular irrelevance, Exponential inequalities for martingales and asymptotic properties of the free energy of directed polymers in a random environment, Counting loopy graphs with given degrees, Improving multi-armed bandit algorithms in online pricing settings, Deviation inequalities for martingales with applications, Laws of large numbers for epidemic models with countably many types, Mod-discrete expansions, Packing spanning graphs from separable families, On the Hamiltonicity of random bipartite graphs, The scaling window for a random graph with a given degree sequence, Connectivity of inhomogeneous random graphs, An exponential inequality and the convergence rate of the strong law of large numbers in the unbounded forecasting game, Local Limit Approximations for Markov Population Processes, Techniques for analyzing dynamic random graph models of web-like networks: An overview
