The Second-Moment Phenomenon for Monochromatic Subgraphs
From MaRDI portal
Publication:5220473
DOI10.1137/18M1184461zbMath1435.05070arXiv1711.01465OpenAlexW3013588920MaRDI QIDQ5220473
Somabha Mukherjee, Bhaswar B. Bhattacharya, Sumit Mukherjee
Publication date: 26 March 2020
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.01465
Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Extremal combinatorics (05D99)
Related Items (max. 100)
A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs ⋮ Asymptotic distribution of Bernoulli quadratic forms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classical and free fourth moment theorems: universality and thresholds
- A non-uniform birthday problem with applications to discrete logarithms
- Universal limit theorems in graph coloring problems with connections to extremal combinatorics
- A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm
- Exchangeable pairs and Poisson approximation
- Two moments suffice for Poisson approximations: The Chen-Stein method
- Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
- Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
- The matching, birthday and the strong birthday problem: a contemporary review
- Monochromatic subgraphs in randomly colored graphons
- Universality of the mean-field for the Potts model
- Characterizations of discrete compound Poisson distributions
- Multicollision Attacks on Some Generalized Sequential Hash Functions
This page was built for publication: The Second-Moment Phenomenon for Monochromatic Subgraphs
