Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture discusses the Carpan collector problem, focusing on the collection of different objects uniformly at random. It covers the expected time to complete the collection, waiting times, and propositions related to the problem. The lecture also includes a proof sketch and approximations for the scenario where all objects in the collection have been chosen by a certain time. The instructor, Olivier Leveque, provides insights into the Gumbel distribution and its application in this context.