The infamous upper tail
From MaRDI portal
Recommendations
Cites work
- A sharp concentration inequality with applications
- Concentration of measure and isoperimetric inequalities in product spaces
- Concentration of multivariate polynomials and its applications
- Counting extensions
- New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
- On the concentration of multivariate polynomials with small expectation
- Poisson approximation for large deviations
- Random graphs with monochromatic triangles in every edge coloring
- The deletion method for upper tail estimates
Cited in
(84)- Ore-type versions of Brooks' theorem
- Tails in harnesses
- Concentration inequalities using the entropy method
- Upper tails for arithmetic progressions in random subsets
- Total equitable list coloring
- Upper tails for subgraph counts in random graphs
- A note on the equitable choosability of complete bipartite graphs
- On list equitable total colorings of the generalized theta graph
- Proportional 2-choosability with a bounded palette
- Regular graphs with many triangles are structured
- On the equitable choosability of the disjoint union of stars
- Concentration inequalities on the multislice and for sampling without replacement
- Equitable distinguishing chromatic number
- Upper tails via high moments and entropic stability
- A simple characterization of proportionally 2-choosable graphs
- Concentration and consistency results for canonical and curved exponential-family models of random graphs
- Localization in random geometric graphs with too many edges
- Large deviations of subgraph counts for sparse Erdős-Rényi graphs
- Maximizing the expected number of components in an online search of a graph
- On the missing log in upper tail estimates
- Bivariate fluctuations for the number of arithmetic progressions in random sets
- Upper tail bounds for stars
- Proportional choosability: a new list analogue of equitable coloring
- Upper tails and independence polynomials in random graphs
- Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
- An Ore-type theorem on equitable coloring
- The deletion method for upper tail estimates
- Nonlinear large deviations
- Proportional choosability of complete bipartite graphs
- The missing log in large deviations for triangle counts
- Upper tails for triangles
- Combinatorial estimates by the switching method
- Equitable coloring of random graphs
- Sub-Gaussian tails for the number of triangles in G( n, p)
- A concentration result with application to subgraph count
- Tight upper tail bounds for cliques
- On replica symmetry of large deviations in random graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Moderate deviations of subgraph counts in the Erdős-Rényi random graphs \(G(n,m)\) and \(G(n,p)\)
- Combinatorial theorems in sparse random sets
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- Moderate deviations via cumulants
- Tail area revisited
- Equitable and list equitable colorings of planar graphs without 4-cycles
- Limit behaviors of random connected graphs driven by a Poisson process
- Colorful triangle counting and a \textsc{MapReduce} implementation
- Noncommutative martingale concentration inequalities
- Concentration inequalities for non-Lipschitz functions with bounded derivatives of higher order
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
- Upper tail bounds for cycles
- Almost all Steiner triple systems are almost resolvable
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
- A refinement of a result of Corrádi and Hajnal
- A counterexample to the DeMarco-Kahn upper tail conjecture
- A fast algorithm for equitable coloring
- A Farey Tail
- When does the \(K_{4}\)-free process stop?
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
- On the variational problem for upper tails in sparse random graphs
- Concentration and moment inequalities for polynomials of independent random variables
- Equitable colorings of Kronecker products of graphs
- Substructures in Latin squares
- Applications of Stein's method for concentration inequalities
- On the upper tail problem for random hypergraphs
- Upper tail for homomorphism counts in constrained sparse random graphs
- Counting extensions revisited
- Moderate deviations in cycle count
- Bounds on Ramsey games via alterations
- The upper tail problem for induced 4‐cycles in sparse random graphs
- Large deviations in random latin squares
- Upper Tail Large Deviations of Regular Subgraph Counts in Erdős‐Rényi Graphs in the Full Localized Regime
- Equitable list coloring of sparse graphs
- Local central limit theorem for triangle counts in sparse random graphs
- A large deviation principle for block models
- The average-case complexity of counting cliques in Erdős-Rényi hypergraphs
- Moderate deviations of triangle counts in the Erdős-Rényi random graph G (n, m): the lower tail
- Moderate deviations of triangle counts in sparse Erdős-Rényi random graphs G(n, m) and G(n, p)
- Moderate deviations of triangle counts -- the lower tail (extended abstract)
- Large deviations of the empirical spectral measure of supercritical sparse Wigner matrices
- Large deviation principles for graphon sampling
- Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
- Equitable colorings of Cartesian products of graphs
- On equitable -coloring of graphs with low average degree
- \(t\)-wise independence with local dependencies
This page was built for publication: The infamous upper tail
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537625)
