Color each edge of the complete graph on n vertices independently and uniformly in three colors. Find mean and…
Quant ResearchLevel: AdvancedOverlapping graph events
Color each edge of the complete graph on n vertices independently and uniformly in three colors. Find mean and variance of the number of monochromatic triangles.
Hints
- For a shared edge the two triangles must use the same color.
- Pairwise independence is enough for variance addition.
Answer
This answer is part of mentoring
Advanced questions come with a full breakdown and a mock interview with a working quant researcher. The first call is free.
Source and licence: Lehman, Leighton & Meyer — Mathematics for Computer Science (2018-06-06) · CC-BY-SA-3.0 · answer: Quantoros editorial