Upper tails for subgraph counts in random graphs

From MaRDI portal
Revision as of 11:56, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1881736

DOI10.1007/BF02771528zbMath1055.05136WikidataQ105583332 ScholiaQ105583332MaRDI QIDQ1881736

Krzysztof Oleszkiewicz, Svante Janson, Andrzej Ruciński

Publication date: 15 October 2004

Published in: Israel Journal of Mathematics (Search for Journal in Brave)




Related Items (51)

Nonlinear large deviationsThe missing log in large deviations for triangle countsUpper tails for trianglesOn replica symmetry of large deviations in random graphsCombinatorial theorems in sparse random setsUpper tails via high moments and entropic stabilityUpper tails and independence polynomials in random graphsApplications of Stein's method for concentration inequalitiesLocalization in random geometric graphs with too many edgesUpper tails for arithmetic progressions in random subsetsThreshold functions for small subgraphs in simple graphs and multigraphsUpper tail for homomorphism counts in constrained sparse random graphsLarge deviations for subcomplex counts and Betti numbers in multiparameter simplicial complexesThreshold functions for small subgraphs: an analytic approachExponential inequalities for the number of subgraphs in the Erdös-Rényi random graphNonlinear large deviations: beyond the hypercubeThe upper tail problem for induced 4‐cycles in sparse random graphsUpper Tail Large Deviations of Regular Subgraph Counts in Erdős‐Rényi Graphs in the Full Localized RegimeLarge deviations of subgraph counts for sparse Erdős-Rényi graphsUpper tails for counting objects in randomly induced subhypergraphs and rooted random graphsDetecting local network motifsUnnamed ItemNonlinear large deviation bounds with applications to Wigner matrices and sparse Erdős-Rényi graphsUpper Tail Bounds for CyclesOn the number of weakly connected subdigraphs in random \(k\)NN digraphsOn the KŁR conjecture in random graphsConcentration inequalities for non-Lipschitz functions with bounded derivatives of higher orderThe Average-Case Complexity of Counting Cliques in Erdös--Rényi HypergraphsOn limits of sparse random graphsWhen does the K4‐free process stop?Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independenceOn the variational problem for upper tails in sparse random graphsCLT-related large deviation bounds based on Stein's methodMoment inequalities for functions of independent random variablesThe lower tail: Poisson approximation revisitedOn the missing log in upper tail estimatesBivariate fluctuations for the number of arithmetic progressions in random setsSub-Gaussian Tails for the Number of Triangles inG(n, p)Many \(T\) copies in \(H\)-free graphsA counterexample to the DeMarco‐Kahn upper tail conjectureVertex Ramsey properties of randomly perturbed graphsLimit laws for the number of triangles in the generalized random graphs with random node weightsAn introduction to large deviations for random graphsUpper tail bounds for starsDivide and conquer martingales and the number of triangles in a random graphAn improved upper bound on the density of universal random graphsRegular graphs with many triangles are structuredA concentration result with application to subgraph countOn a Conjecture of Nagy on Extremal DensitiesRate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random GraphsTight upper tail bounds for cliques



Cites Work




This page was built for publication: Upper tails for subgraph counts in random graphs