Orient every edge among 10 vertices independently and uniformly. How many directed Hamiltonian paths are expected?…
Quant ResearchLevel: AdvancedProbabilistic method
Orient every edge among 10 vertices independently and uniformly. How many directed Hamiltonian paths are expected? What existence claim follows?
Hints
- Use an indicator for each vertex ordering.
- An integer cannot always lie below its noninteger mean.
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