Expected Number of Surviving Sharks
Problem statement
100 sharks are arranged in a line. Each shark has a distinct, random speed. Each shark competes only with its immediate neighbors in the original line: a shark survives if and only if it is faster than both of its immediate neighbors (a shark at either end needs only to beat its single neighbor), and every other shark is eaten.
What is the expected number of sharks remaining?
Generalize to $n$ sharks.
Show hint
Which tool lets you find an expected count without modeling how the eating unfolds step by step?
Relevant roles: Data Scientist, Applied Scientist and Research Scientist.