Quantifying Distinctions / The Random Walk

Speaker:  Yash Mehta

Date: 14th November 2017 (Tuesday)

Time: 09:15 pm – 10:15 pm

Venue: Lecture Hall I, Department of Mathematics

Abstract:

The talk will basically consist of two different solutions of the random walk problem, and one of the key techniques used in one of the proofs would be used to provide a method to estimate the number of “types” of an entity in a region. Basic proofs will be outlined along the way (some might be skipped depending on the availability of time). Actual examples of its utilisation will be discussed at the end.

Prerequisites: Basic arithmetic, elementary ideas of calculus and limits.

Area: Probability Theory

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s