Concentration Inequalities and Martingale Inequalities: A Survey
From MaRDI portal
Publication:3431007
DOI10.1080/15427951.2006.10129115zbMath1111.60010OpenAlexW2002240881MaRDI 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
A note on the H index in random networks, Bin sizes in time-inhomogeneous infinite Polya processes, Counting Hamilton cycles in Dirac hypergraphs, The power of two choices for random walks, On Azuma-type inequalities for Banach space-valued martingales, Mesoscopic scales in hierarchical configuration models, Packing spanning graphs from separable families, On the Hamiltonicity of random bipartite graphs, Deviation inequalities for martingales with applications, Laws of large numbers for epidemic models with countably many types, On extinction time of a generalized endemic chain-binomial model, The scaling window for a random graph with a given degree sequence, Local Limit Approximations for Markov Population Processes, Improving multi-armed bandit algorithms in online pricing settings, Robustness of power-law networks: its assessment and optimization, Connectivity of inhomogeneous random graphs, Robust Learning of Consumer Preferences, Semantics-aware influence maximization in social networks, On the nature of the Swiss cheese in dimension 3, Tightened exponential bounds for discrete-time conditionally symmetric martingales with bounded jumps, Competition-based generalized self-profit maximization in dual-attribute network, Time-uniform Chernoff bounds via nonnegative supermartingales, Concentration inequalities and laws of large numbers under epistemic and regular irrelevance, Precision-aware deterministic and probabilistic error bounds for floating point summation, Limiting shapes of birth-and-death processes on Young diagrams, Unnamed Item, Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions, Edge ideals of Erdős-Rényi random graphs: linear resolution, unmixedness and regularity, Sharp thresholds in adaptive random graph processes, Techniques for analyzing dynamic random graph models of web-like networks: An overview, On the Method of Typical Bounded Differences, Metamodel construction for sensitivity analysis, Unnamed Item, Rainbow structures in locally bounded colorings of graphs, Packing and counting arbitrary Hamilton cycles in random digraphs, Mod-discrete expansions, Near-optimal PAC bounds for discounted MDPs, Quenched asymptotics for interacting diffusions on inhomogeneous random graphs, Probabilistic Error Analysis for Inner Products, Egalitarian Steiner triple systems for data popularity, Noncommutative martingale concentration inequalities, Strong law of large numbers for the capacity of the Wiener sausage in dimension four, An exponential inequality and the convergence rate of the strong law of large numbers in the unbounded forecasting game, Balls into bins via local search: Cover time and maximum load, On the Kolmogorov inequalities for quadratic forms of dependent uniformly bounded random variables, On martingale tail sums in affine two-color urn models with multiple drawings, Profit maximization problem with coupons in social networks, General rumor blocking: an efficient random algorithm with martingale approach, A note on the majority dynamics in inhomogeneous random graphs, Exponential inequalities for martingales and asymptotic properties of the free energy of directed polymers in a random environment, Deviations for the capacity of the range of a random walk, Sampling Lower Bounds: Boolean Average-Case and Permutations, Metastability for the contact process on the preferential attachment graph, Concurrent disjoint set union, Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits, Counting loopy graphs with given degrees, Limits of sparse configuration models and beyond: graphexes and multigraphexes, Concentration and Moment Inequalities for Polynomials of Independent Random Variables, Fourier decay for self-similar measures, Quenched invariance principle for random walks on dynamically averaging random conductances, Finer estimates on the \(2\)-dimensional matching problem, Rainbow matchings in k‐partite hypergraphs, Concentration inequalities for nonlinear matroid intersection, List-Decoding with Double Samplers, Generalized self-profit maximization and complementary-profit maximization in attribute networks, Unnamed Item, Unnamed Item, Correlations of random classifiers on large data sets, Minimum budget for misinformation detection in online social networks with provable guarantees
