scientific article; zbMATH DE number 4170917
From MaRDI portal
zbMATH Open0712.05012MaRDI QIDQ3496342FDOQ3496342
Authors: Colin McDiarmid 
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
isoperimetric inequalitysymmetric groupAzuma's inequalitybounded difference methodbounded martingale difference sequencesmartingale result
Cited In (only showing first 100 items - show all)
- An inequality for tail probabilities of martingales with bounded differences
- A randomized algorithm for the joining protocol in dynamic distributed networks
- Linear extensions and comparable pairs in partial orders
- Random \(k\)-dimensional orders: Width and number of linear extensions
- Near-optimal, distributed edge colouring via the nibble method
- Title not available (Why is that?)
- Class-prior estimation for learning from positive and unlabeled data
- Pure exploration in finitely-armed and continuous-armed bandits
- Near-optimal distributed edge coloring
- Learning and generalization with the information bottleneck
- On the Method of Typical Bounded Differences
- Strongly consistent model selection for densities
- Approximation algorithm for the multicovering problem
- Lifshits tails for squared potentials
- Some theoretical properties of GANs
- A local Vapnik-Chervonenkis complexity
- On the stabbing number of a random Delaunay triangulation
- Rademacher complexity for Markov chains: applications to kernel smoothing and Metropolis-Hastings
- On complexity, representation and approximation of integral multicommodity flows
- Higher order concentration for functions of weakly dependent random variables
- An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm
- Parsimonious flooding in geometric random-walks
- Consistency of the \(k\)-nearest neighbor classifier for spatially dependent data
- A note on the large random inner-product kernel matrices
- Approximating Nash Equilibria in Tree Polymatrix Games
- Convergence rates of learning algorithms by random projection
- On the \(k\)-orientability of random graphs
- A note on the chromatic number of a dense random graph
- Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
- Title not available (Why is that?)
- Pseudorandom correlation functions from variable-density LPN, revisited
- Modularity of Erdős‐Rényi random graphs
- Non-asymptotic tests of model performance
- Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝)
- Estimating beta-mixing coefficients via histograms
- Universal consistency of delta estimators
- Coexistence results for catalysts
- Some new copula based distribution-free tests of independence among several random variables
- Threshold dominating cliques in random graphs and interval routing
- Title not available (Why is that?)
- Annealed and quenched limit theorems for random expanding dynamical systems
- Title not available (Why is that?)
- Sharp concentration of the equitable chromatic number of dense random graphs
- A sharp threshold in proof complexity yields lower bounds for satisfiability search
- Fast and optimal simulations between CRCW PRAMs
- Optimal sampling algorithms for block matrix multiplication
- Thermodynamical approach to the longest common subsequence problem
- Non-concentration of the chromatic number of a random graph
- QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations
- Subdivisions of a large clique in \(C_6\)-free graphs
- Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning
- Bounds for tail probabilities of martingales using skewness and kurtosis
- Learning from MOM's principles: Le Cam's approach
- Long arithmetic progressions in critical sets
- No outliers in the spectrum of the product of independent non-Hermitian random matrices with independent entries
- Close-to-optimal and near-optimal broadcasting in random graphs
- Model selection by bootstrap penalization for classification
- Stability in large Bayesian games with heterogeneous players
- Randomised broadcasting: memory vs. randomness
- Stability for \(t\)-intersecting families of permutations
- Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models
- A central limit theorem and improved error bounds for a hybrid-Monte Carlo sequence with applications in computational finance
- Vertex reinforced non-backtracking random walks: an example of path formation
- Rigorous verification, validation, uncertainty quantification and certification through concentration-of-measure inequalities
- On an anti-Ramsey threshold for random graphs
- Complete partitions of graphs
- Concentration Inequalities for Statistical Inference
- Giant vacant component left by a random walk in a random \(d\)-regular graph
- Robustness and generalization
- On sparse approximations to randomized strategies and convex combinations
- Density estimation by the penalized combinatorial method
- Stability analysis of learning algorithms for ontology similarity computation
- List-ranking on interconnection networks.
- Learning sparse gradients for variable selection and dimension reduction
- A spectral algorithm for learning hidden Markov models
- On the power of two choices: balls and bins in continuous time
- An affine invariant \(k\)-nearest neighbor regression estimate
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
- Achlioptas process phase transitions are continuous
- The structure of popular difference sets
- Comparing a large number of multivariate distributions
- Approximation analysis of gradient descent algorithm for bipartite ranking
- Generalization bounds for averaged classifiers
- Universal smoothing factor selection in density estimation: theory and practice. (With discussion)
- Isomorphic bisections of cubic graphs
- On domination of tail probabilities of (super)martingales: explicit bounds
- Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms.
- The cook-book approach to the differential equation method
- Deviation inequalities for separately Lipschitz functionals of iterated random functions
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees
- Nearest-neighbor entropy estimators with weak metrics
- Statistical properties of kernel principal component analysis
- Selection of a metric for the nearest neighbor entropy estimators
- Linear eigenvalue statistics of random matrices with a variance profile
- Probabilistic analysis of the generalised assignment problem
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- Generalization performance of bipartite ranking algorithms with convex losses
- A Hoeffding-type inequality for ergodic time series
- Voting rules that are unbiased but not transitive-symmetric
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3496342)
