As an economist specialized in finance and mathematics lover I adore this institution despite I've never set a footstep in Massachusetts nor even the USA. Thanks Lord for these geniuses.
If we consider what was covered in the previous lecture about Stoic thinking, and we were trying to create a realistic model about the wandering drunk, wouldn’t we need to create an additional factor that would affect probability called fatigue? Where, by the more of the drunk walk the more tired they get, and they start to either walk less or take smaller steps.
Why not give the abstract class the "usual" method for walking and then override it in the inherited class? operator overloading and inheritance in one example
In the simWalks function , I think there is an error in Loop, numTrias has been passed to the WLAK function instead of passing numSteps, this is why the simulations are not dependent on the number of steps .
PLEASE - next time you film a class, show the screen whenever the teacher is discussing what's on it. Countless times I could not see what he was talking about.
late for you but for anybody else seeing this. in the first minute he alludes to the project files which you should ideally download an then you can see them in your own time :)
@@aazz7997 if the NEW STUDENT is limited to downloading the slides, will this include the laser-pointing he's doing, or should the NEW STUDENT just randomly point their finger on a note on the slide and assume that "this here" or "that over there" is where he's laser-pointing?
If someone could help me, in the textbook there's another exemple of drunk: the EW Drunk, moving only in the horizontal axe (-1, 0) and (1, 0). However this drunk is also getting farther away from the origin. But why? If after n number of steps he has equal chance to step etiher W or E, wasn't he supposed to be back to the origin according to the law of big numbers? Isn't it the same as to flip n coins and count number of head and tails?
Have you plotted it on a graph as the professor explains near the end of the video? I would expect an hourglass shape of end points. I would like to know what you found if you end up running this sim.
@@narnbrez I did not have run the simmulation because the result is presented in the textbook. The professor is computing the average of distances and not the expected value of the random walk. The random walk should be a bell curve with its peak at distance zero, so the expected value of the walk is always zero for the EW. What happens is that when the number of steps increases the bell curve becomes wider and you have small probabilities of finding bigger distances, hence the 'mean' distance increases a little bit. Hower the expected distance to the origin is still zero. Kind of misleading IMO but it is correct.
When talking about distances the sign is not relevant. Say you have two trials with one step each and lets only allow movements in x. Asumme the first trial ends at -1 and the secon one at +1. The mean of covered distance is then one while average distance from origin is zero. Its just tow ways to look at the probem: The expected value of distance from origin is 0 while the average distnace covered is not.
When the masochistic drunk moves on the y-axis he on average gets 0.1 to the north ((1.1-0.9)/2). And since he moves in the y-axis 50% of the time, he gets .05 (0.1/2) to the north on average for every step he takes. See stepChoices in the class definition.
Hey guys I have one question from the one who read this, Is there any sorting algorithm which directly predicts the place of every element in array subsequently reducing the time complexity because I m working on such a algorithm so if it is there then plz tell me.
@@sharan9993 consider this data[3,1,5,7,2,9,10,4,6,5,2,14] Here min =1 Max =14 Total numbers = 12 Now consider the first element 3 Here predict mean to predict that in this array where should be 3’s position Position =( 3-1/(14-1))*12 = 1.84 so the 3’s position should be at second which is good because when sort the list 3 stands at third position and if we have more numbers than we don’t have to compare every number with others because we only have to compare number with the other number which is at our numbers location
@@sharan9993 actually I have thought about this and I m still solving this problem but if you know that mean of the list is around min-mix/2 than this algorithm is good And if you have any thoughts about solving that problem than inform me I will glad😇😇
I love how lazy this guy is when it comes to math 😂 Need to calculate probability? Blah, let's just code do that. Pythagor for triangle with 1x1? Nahh, can't be bothered... 😂 True programmers approach IMO
This is a very misleading class in my humild opinion, because he is computing the average of distances and not the expected value of the random walk. The random walk should be a bell curve with its peak at distance zero, so the expected value of the walk is always zero for the Usual Drunk. What happens is that when the number of steps increases the bell curve becomes wider and you have small probabilities of finding bigger distances, hence the 'mean' distance increases a little bit. Hower the expected distance to the origin is still zero.
but why is the expected distance to the origin zero? for a point that is 1 step away from the origin, there is 3/4 chance for the second step to be even further away from the origin. So the distance will eventually get bigger and bigger.
This is what I wrote earlier: When talking about distances the sign is not relevant. Say you have two trials with one step each and lets only allow movements in x. Asumme the first trial ends at -1 and the secon one at +1. The mean of covered distance is then one while average distance from origin is zero. Its just tow ways to look at the probem: The expected value of distance from origin is 0 while the average distnace covered is not.
When you attend a class, the professor would face the board and write something on the board. Do your eyes follow what he writes or his back, or his but? Video guys are pretty dumb, they think they have to show the speaker as much as possible. When the professor discusses some point on the result, the video guy should show the viewers the screen Does it make sense to all of you? I am sure what I say does not make sense to you since I am the only one pointing this out. In all my lectures in the US or elsewhere, my face appears only for one minute and the rest of the video shows what I write or the results of my equations.
