Professional Documents
Culture Documents
.........................................................................
Department of Mathematics
Dissertation
future performance....................
1
In making this submission I declare that the information
.........................................................................
Contents.
Abstract.
1. Introduction
3. An alternative theorem.
2
Abstract:
3
value. These are applications that Bayes’ theorem cannot do
on its own.
Introduction:
4
lending money to potential borrowers. Bayes’ theorem
profitability.
5
betting. [2] The Bayes model remains an useful model for
6
Chapter 2: The uses of Bayes’
theorem.
coin that is known to be fair. And there are times when past
𝑝 𝑏 𝑎)𝑝(𝑎)
𝑝 𝑎 𝑏 =
𝑝(𝑏)
occurrences.
7
For example say you have a disease which has a frequency of
one in 100. And you have a 90% accurate test for the disease.
If the test is positive, how likely are you to have the disease?
So p(a|b)= 0.9*0.01/.108=1/12.
𝑓 𝑦 𝑥)𝑓(𝑥)
𝑓 𝑥 𝑦 =
𝑓 𝑦 𝑠 ) 𝑓 𝑠 𝑑𝑠
8
Chapter 3: An alternative theorem.
One question that can be asked is, when there are two
more then the other (a). Then what is the probability that
more often?
9
.............................................................. ...........
10
If we fix t and m, what value of n will maximize the
after t flips?
....... .............................................................
.....
tails after n flips, then at the probability that given this, that
............................................................... ..........
!! !!! !!!
tails after n flips is where a = and b = .
(!! ∗ !! ∗ ! ! ) ! !
11
To have the same number of heads and tails after t flips, there
!–!!!
has to be =
!
!!!!!
0.5t - a heads and = 0.5t - b tails.
!
! – ! ! ∗ ! !.!! ! ! ∗ ( ! – ! ) !.!! ! !
!.!! ! ! ! ∗ !.!! – ! !
!–!!! !–!!!
!–! !∗! ! ∗(!–!) !
= !–!–! !–!!!
!∗ !
! !
12
This can be used to estimate to true probability of heads
Let L(a, b) mean that after a flips there have been b heads.
And Let L(a, b: d, f) mean that after a flips there have been b,
P(L(d,f)|L(a,b:d,f))= 1 =P(L(d,f)|L(a,b:d,f))
13
!!! !!!
If there have been heads and tails, then probability
! !
𝑚 + 𝑛 𝑡 𝑡
𝑃 𝐿 𝑛, 𝐿 𝑡, 𝑃 𝐿 𝑡,
2 2 2
𝑚 + 𝑛
𝑃 𝐿 𝑛, 2
𝑛 + 𝑚 𝑡
𝑃 𝐿 𝑛, 𝐿 𝑡,
2 2
!
Can be determined by the following. If you have heads and
!
! !!
tails there are ! ! possible ways to arrange them. The
! !∗ !
! !
!!!
choosing flips out of n.) (the number of permutations
!
!–!! !
for choosing flips out of t - n. )
!
𝑛! 𝑡 − 𝑛 !
∗
𝑛 + 𝑚 𝑛 − 𝑚 𝑡−𝑛−𝑚 𝑡– 𝑛 + 𝑚
2 ! 2 ! 2 ! 2 !
14
𝑛! 𝑡 − 𝑛 !
=𝑛 + 𝑚 𝑛 − 𝑚 𝑡−𝑛−𝑚 𝑡– 𝑛 + 𝑚
2 ! 2 ! 2 ! 2 !
!!! !
This gives 𝑃 𝐿 𝑛, 𝐿 𝑡, =
! !
!! ! ! ! !
! ! ! ! ! ! !!!!! ! – ! ! !
! ! ! !
! ! ! !
=
!!
! !
!∗ !
! !
𝑡 !
! 𝑛! 𝑡 − 𝑛 !
2
𝑛 + 𝑚 𝑛 − 𝑚 𝑡−𝑛−𝑚 𝑡– 𝑛 + 𝑚
2 ! 2 ! 2 ! 2 ! ∗ 𝑡!
! ! ! !
! ! !! ∗ ! ! ∗ ! ! ! ! !! ! !
!
𝑝 𝐿 𝑡, = ! ! ! 𝑑𝑝 = ! ! =
! !∗ ! ! ∗ !!! ! !!!
! ! !
!!! !!!
!!! ! !! ∗ ! ! ∗ ! ! ! !
𝑃 𝐿 𝑛, = ! ! ! ! ! ! ! 𝑑𝑝 =
! !∗ !
! !
!!! !!!
!! ! ! !
! !
!!! !!! =
!!! ! ! ! (! ! !)
! !
𝑡 𝑚 + 𝑛
𝑃(𝐿(𝑡, )| 𝐿(𝑛, )) =
2 2
15
!!! ! !
! ! !, ! !, ! ! !,
! ! !
!!!
=
! ! !,
!
! !
! !! ! ! ! ! !
!
∗
!!! !!! !–!!! !–!!! ! ! !
! ! ! ! ! ! ! ! ∗ !!
! =
(! ! !)
! !
! !!! ! !!! !
!
!!! !!! !–!!! !–!!!
! ! ! ! ∗ (! ! !)!
! ! ! !
!!!!! ! ! !!! ! !
! ! !!!, ! !, ! ! !, ! ! !, ! !, ! ! !,
! ! ! ! ! !
!!!!!
− !!!
=
! ! ! ! !, ! ! !,
! !
! !
! (! ! !)! ! – ! ! ! !
!
!!!!! !–!–! !–!–!–! !–!–!!!
-
! ! ! !(! ! !)!
! ! ! !
! !
! (! ! !)! ! ! ! !
!
!!! !–! !–!–! !–!!!
! ! ! !(! ! !)!
! ! ! !
! !
– ! !!! ! ! ! ! ! ! !! – ! ! ! ! ! ! ! !–! !–!–! !
!
!–!!! !!!!! !–!–! !–!!!
=
! ! ! ! ! (! ! !)!
! ! ! !
16
!!! ! !
! !!! ! ! !, ! !, !! ! ! !, !!
! ! !
𝑃(𝐿(𝑡, − 𝑎)| 𝐿(𝑛, )) = !!!
.
! ! ! ! !,
!
!
𝑃 𝐿 𝑡, − 𝑎 =
!
! ! ! !
!! !! !! !! ! !! !
! !! ∗ ! ! ∗ !!! ! ! ! !
! ! ! 𝑑𝑝 = ! ! = ,
!! !∗ !! ! !! !∗ !! ! !!! ! !!!
! ! ! !
!!! !
𝑃 𝐿 𝑛, =
! (! ! !)
𝑛 + 𝑚 𝑡
𝑃 𝐿 𝑛, 𝐿 𝑡, − 𝑎
2 2
! !
If you have − 𝑎 heads and + 𝑎 tails there are
! !
!!
! ! possible ways to arrange them. The number of
!! !∗ !! !
! !
!–!! !
− 𝑎 flips out of t - n. )
!
𝑛! 𝑡 − 𝑛 !
𝑛 + 𝑚 𝑛 − 𝑚 ∗ 𝑡−𝑛−𝑚 𝑡– 𝑛 + 𝑚
2 ! 2 ! ( 2 − 𝑎)! ( 2 + 𝑎)!
17
𝑛! 𝑡 − 𝑛 !
=𝑛 + 𝑚 𝑛 − 𝑚 𝑡−𝑛−𝑚 𝑡– 𝑛 + 𝑚
2 ! 2 ! ( 2 − 𝑎)! ( 2 + 𝑎)!
!!! !
This gives 𝑃 𝐿 𝑛, 𝐿 𝑡, =
! !
!! ! ! ! !
!!! !!! !–!!! !–!!!
! !( ! !)! ( ! !)!
! ! ! !
=
!!
! !
!! !∗ !! !
! !
! !
! ! ! ! ! ! !! ! ! ! !
! !
!!! !!! !–!!! !–!!!
! !( ! !)! ( ! !)! ∗!!
! ! ! !
𝑡 𝑚 + 𝑛
𝑃(𝐿(𝑡, )| 𝐿(𝑛, )) =
2 2
!!! ! !
! ! !, ! !, ! !! ! !, ! !
! ! !
!!!
=
! ! !,
!
18
! !
!! ! ! ! ! !! ! ! ! ! !
! ! ∗
!!! !!! !–!!! !–!!! !!!
! ! ! !( ! ! !)! ( ! ! !)! ∗!!
! =
(! ! !)
! !
! ! ! ! ! !(!!!)! ! ! ! !
! !
!!! !!! !–!!! !–!!!
! !( ! !)! ( ! !)! ∗ (! ! !)!
! ! ! !
𝑡 𝑚 + 𝑛
𝑃(𝐿(𝑡, < )| 𝐿(𝑛, )) =
2 2
!.!"(! – ! ! !) ! !!!
!!!
𝑃(𝐿(𝑡, − 2𝑖)| 𝐿(𝑛, ))
! !
!!! ! !
!.!" ! – ! ! ! ! ! !, ! !, ! !! ! ! !, ! !!
! ! !
!!! !!!
! ! !,
!
𝑡 𝑡
!.!" ! – ! ! ! 2 – 2𝑎 ! 2 + 2𝑎 ! 𝑛+1 ! 𝑡 − 𝑛 !
!!! 𝑛+𝑚 𝑛−𝑚 𝑡–𝑛−𝑚
2 ! 2 ! 2 − 𝑎 ! 𝑡 – 𝑛2+ 𝑚 + 𝑎 ! ∗ 𝑡 + 1 !
19
20
Chapter 4: Uses for this alternative theorem.
has two possible outcomes and has had one of them happen
21
Graphs.
t=40;
m=4;
clear f;
for I=m/2:(t-2)/2
n=2*I;
clear d;
d=0;
d(a+1)=b/c;
22
end
f(n/2-1)=sum(d);
end
P=linspace(4,38,18);
plot(P,f);
xlabel('n');
ylabel('probability');
23
t=40;
m=6;
clear g;
for I=m/2:(t-2)/2
n=2*I;
clear d;
d=0;
24
b=factorial(t/2-2*a) * factorial(t/2+2*a);
c=factorial((n+m)/2) * factorial((n-m)/2);
n+m)/2+2*a) * factorial(t+1);
d(a+1)=b/c;
end
g(n/2-2)=sum(d);
end
P=linspace(6,38,17);
plot(P,g);
xlabel('n');
ylabel('probability');
25
t=40;
m=8;
clear h;
for I=m/2:(t-2)/2
n=2*I;
26
clear d;
d=0;
b=factorial(t/2-2*a) * factorial(t/2+2*a);
c=factorial((n+m)/2) * factorial((n-m)/2);
n+m)/2+2*a) * factorial(t+1);
d(a+1)=b/c;
end
h(n/2-3)=sum(d);
end
P=linspace(8,38,16);
plot(P,h);
xlabel('n');
ylabel('probability');
27
As you can see, increasing the value of m decreases the
28
Conclusion.
and medicine.
29
References.
2019.
http://www.eafit.edu.co/programas-
academicos/pregrados/ingenieria-matematica/practicas-
investigativas/Documents/sports-betting-odds.pdf
30
accessed on 29 August, 2019.
[4] https://www.investopedia.com/articles/financial-
theory/09/bayesian-methods-financial-modeling.asp
31