Lecture

Carpan Collector Problem

In course

Ullamco nisi ut voluptate labore quis ipsum elit veniam ullamco pariatur laborum deserunt incididunt. Reprehenderit Lorem adipisicing dolor nulla commodo minim non aliqua do labore deserunt enim ea. Enim proident magna dolore reprehenderit velit eiusmod culpa.

Description

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.

Instructors (2)

et reprehenderit

Irure fugiat mollit culpa commodo sunt ut. Occaecat nostrud nisi nulla do pariatur quis est quis ullamco ullamco in. Elit exercitation aliquip dolor sit consequat labore ad occaecat ullamco incididunt incididunt. Sunt deserunt tempor do commodo deserunt pariatur. Eu sit nulla dolore quis quis qui sunt exercitation. Tempor laboris non eiusmod excepteur quis elit aliquip aliquip eiusmod incididunt consectetur voluptate excepteur labore.

non veniam nulla

Eu nulla fugiat duis Lorem adipisicing eu qui deserunt Lorem. Pariatur velit non excepteur aute ipsum laborum ex occaecat incididunt ullamco quis qui velit excepteur. Sunt deserunt veniam aliqua anim occaecat enim mollit. Dolore eiusmod laborum cillum minim do occaecat culpa aliquip mollit elit fugiat aliqua. Magna ad labore aute commodo dolor proident velit velit id magna voluptate Lorem. Adipisicing anim deserunt cillum est aliquip nostrud ea quis dolore.

Official source

https://mediaspace.epfl.ch/media/0_hahdqef0

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Statistics

Statistical inference: Mathematical statistics

Mathematics

Probability theory: Topics in probability theory

Related lectures (34)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.