Probability Refresher - Discrete Math - Lecture Slides, Slides of Discrete Mathematics

Some concept of Discrete Math are Unique Path, Addition Rule, Clay Mathematics, Complexity Theory, Correspondence Principle, Discrete Mathematics, Group Theory, Random Variable, Major Concepts. Main points of this lecture are: Probability Refresher, Random Variable, Real-Valued, Function, Probability Refresher, Home, Drunk, Probability, Abstraction, Student

Typology: Slides

2012/2013

Uploaded on 04/27/2013

emee
emee 🇮🇳

4.3

(30)

134 documents

1 / 49

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Introduction to Discrete
Mathematics
Docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31

Partial preview of the text

Download Probability Refresher - Discrete Math - Lecture Slides and more Slides Discrete Mathematics in PDF only on Docsity!

Introduction to Discrete

Mathematics

Probability Refresher

What’s a Random Variable?

A Random Variable is a real-valued function on a sample space S

E[X+Y] = E[X] + E[Y]

Random Walks

Lecture 12 (October 10, 2007)

How to walk

home drunk

Abstraction of Student Life

Like finite automata, but instead of a determinisic or non-deterministic action, we have a probabilistic action

Example questions: “What is the probability of reaching goal on string Work,Eat,Work?”

No new ideas

Solve HW problem

Eat

Wait

Work

Work

Hungry

Simpler:

Random Walks on Graphs

At any node, go to one of the neighbors of the

node with equal probability

Simpler:

Random Walks on Graphs

At any node, go to one of the neighbors of the

node with equal probability

Simpler:

Random Walks on Graphs

At any node, go to one of the neighbors of the

node with equal probability

0 n

k

Random Walk on a Line

You go into a casino with $k, and at each time step, you bet $1 on a fair game

You leave when you are broke or have $n

Question 1: what is your expected amount of

money at time t?

Let Xt be a R.V. for the amount of $$$ at time t

0 n

k

Random Walk on a Line

You go into a casino with $k, and at each time step, you bet $1 on a fair game

You leave when you are broke or have $n

Xt = k + δ 1 + δ 2 + ... + δt,

(δi is RV for change in your money at time i)

So, E[X (^) t] = k

E[δi] = 0

Random Walk on a Line

Question 2: what is the probability that you

leave with $n?

E[Xt] = k

E[Xt] = E[Xt| Xt = 0] × Pr(Xt = 0)

  • E[Xt | Xt = n] × Pr(Xt = n)
  • E[ X (^) t | neither] × Pr(neither)

As t →∞, Pr(neither) → 0, also something (^) t < n

Hence Pr(Xt = n) → k/n

k = n × Pr(Xt = n)

  • (somethingt) × Pr(neither)

0 n

k

Another Way To Look At It

You go into a casino with $k, and at each time step, you bet $1 on a fair game

You leave when you are broke or have $n

Question 2: what is the probability that you

leave with $n?

= probability that I hit green before I hit red

Random Walks and

Electrical Networks

Same as equations for voltage if edges all have same resistance!

p (^) x = Pr(reach green first starting from x)

pgreen = 1, p (^) red = 0

And for the rest p (^) x = Average (^) y ∈ Nbr(x) (p (^) y )

0 n

k

Another Way To Look At It

You go into a casino with $k, and at each time step, you bet $1 on a fair game

You leave when you are broke or have $n

Question 2: what is the probability that you

leave with $n?

voltage(k) = k/n = Pr[ hitting n before 0 starting at k] !!!