Pages that link to "Item:Q4459588"

The following pages link to Divide and conquer martingales and the number of triangles in a random graph (Q4459588):

Displaying 33 items.

• Colorful triangle counting and a \textsc{MapReduce} implementation (Q413300) (← links)
• Concentration inequalities for non-Lipschitz functions with bounded derivatives of higher order (Q495552) (← links)
• Applications of Stein's method for concentration inequalities (Q606639) (← links)
• The symmetry in the martingale inequality (Q1612953) (← links)
• Moment inequalities for functions of independent random variables (Q1775439) (← links)
• Upper tails for subgraph counts in random graphs (Q1881736) (← links)
• Regular graphs with many triangles are structured (Q2073296) (← links)
• Upper tails via high moments and entropic stability (Q2165741) (← links)
• Concentration and consistency results for canonical and curved exponential-family models of random graphs (Q2176626) (← links)
• Nonlinear large deviations: beyond the hypercube (Q2192741) (← links)
• Large deviations of subgraph counts for sparse Erdős-Rényi graphs (Q2196617) (← links)
• Nonlinear large deviation bounds with applications to Wigner matrices and sparse Erdős-Rényi graphs (Q2212598) (← links)
• Limit laws for the number of triangles in the generalized random graphs with random node weights (Q2307413) (← links)
• Stein's method for concentration inequalities (Q2369871) (← links)
• Upper tails and independence polynomials in random graphs (Q2404638) (← links)
• Nonlinear large deviations (Q2629111) (← links)
• An introduction to large deviations for random graphs (Q2822847) (← links)
• The missing log in large deviations for triangle counts (Q2904593) (← links)
• Upper tails for triangles (Q2904594) (← links)
• Sub-Gaussian Tails for the Number of Triangles in<i>G</i>(<i>n, p</i>) (Q3068819) (← links)
• A concentration result with application to subgraph count (Q3119051) (← links)
• Tight upper tail bounds for cliques (Q3145838) (← links)
• On replica symmetry of large deviations in random graphs (Q3192375) (← links)
• Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs (Q5014516) (← links)
• Upper Tail Bounds for Cycles (Q5130906) (← links)
• On the Method of Typical Bounded Differences (Q5366890) (← links)
• The <i>C</i>_ℓ‐free process (Q5495878) (← links)
• On the variational problem for upper tails in sparse random graphs (Q5739097) (← links)
• Upper tail for homomorphism counts in constrained sparse random graphs (Q6074661) (← links)
• (Q6086224) (← links)
• Exponential inequalities for the number of subgraphs in the Erdös-Rényi random graph (Q6101707) (← links)
• The upper tail problem for induced 4‐cycles in sparse random graphs (Q6119225) (← links)
• Upper Tail Large Deviations of Regular Subgraph Counts in Erdős‐Rényi Graphs in the Full Localized Regime (Q6139107) (← links)